Iterative Optimization of Registration and Paging Policies

Slides:



Advertisements
Similar presentations
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Advertisements

Value Iteration & Q-learning CS 5368 Song Cui. Outline Recap Value Iteration Q-learning.
Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Paper Discussion: “Simultaneous Localization and Environmental Mapping with a Sensor Network”, Marinakis et. al. ICRA 2011.
SA-1 1 Probabilistic Robotics Planning and Control: Markov Decision Processes.
First introduced in 1977 Lots of mathematical derivation Problem : given a set of data (data is incomplete or having missing values). Goal : assume the.
Distributed PageRank Computation Based on Iterative Aggregation- Disaggregation Methods Yangbo Zhu, Shaozhi Ye and Xing Li Tsinghua University, Beijing,
Mean-Shift Algorithm and Its Application Bohyung Han
Apprenticeship Learning by Inverse Reinforcement Learning Pieter Abbeel Andrew Y. Ng Stanford University.
Apprenticeship Learning by Inverse Reinforcement Learning Pieter Abbeel Andrew Y. Ng Stanford University.
Pricing What Can Pricing Do In Wireless Networks? Jianning Mai and Lihua Yuan
Latent Learning in Agents iCML 03 Robotics/Vision Workshop Rati Sharma.
An Iterative Optimization Strategy in Multiple Points to Multiple Points MIMO (M4) Mobile Communication Systems MCL Yun-Shen Chang
1 A Shifting Strategy for Dynamic Channel Assignment under Spatially Varying Demand Harish Rathi Advisors: Prof. Karen Daniels, Prof. Kavitha Chandra Center.
Distributed Q Learning Lars Blackmore and Steve Block.
Cooperative Q-Learning Lars Blackmore and Steve Block Expertness Based Cooperative Q-learning Ahmadabadi, M.N.; Asadpour, M IEEE Transactions on Systems,
Department of Computer Science Undergraduate Events More
Motion Planning in Dynamic Environments Two Challenges for Optimal Path planning.
DCL Concepts STL Concepts ContainerIteratorAlgorithmFunctorAdaptor What New Concepts are Needed for a “DCL”? (Distributed Computing Library) Distributed.
Factor Graphs Young Ki Baik Computer Vision Lab. Seoul National University.
1 Applications of Relative Importance  Why is relative importance interesting? Web Social Networks Citation Graphs Biological Data  Graphs become too.
Micro-Mobility Support in Wireless Networks. Motivation More Users: more portables and PDAs More Users: more portables and PDAs Need for Connectivity.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
Practical Dynamic Programming in Ljungqvist – Sargent (2004) Presented by Edson Silveira Sobrinho for Dynamic Macro class University of Houston Economics.
Cooperative Q-Learning Lars Blackmore and Steve Block Multi-Agent Reinforcement Learning: Independent vs. Cooperative Agents Tan, M Proceedings of the.
Distributed Q Learning Lars Blackmore and Steve Block.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Some Final Thoughts Abhijit Gosavi. From MDPs to SMDPs The Semi-MDP is a more general model in which the time for transition is also a random variable.
Source Page US:official&tbm=isch&tbnid=Mli6kxZ3HfiCRM:&imgrefurl=
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
Путешествуй со мной и узнаешь, где я сегодня побывал.
Hidden Markov Models – Concepts 1 2 K … 1 2 K … 1 2 K … … … … 1 2 K … x1x1 x2x2 x3x3 xKxK 2 1 K 2.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project A Distributed Newton Method for Network Optimization Ali Jadbabaie and Asu Ozdaglar.
Relaxation Methods in the Solution of Partial Differential Equations
Authors: Jiang Xie, Ian F. Akyildiz
Khiem Lam Jimmy Vuong Andrew Yang
MCMC Output & Metropolis-Hastings Algorithm Part I
You Zhang, Jeffrey Meyer, Joubin Nasehi Tehrani, Jing Wang
Zac Hall Dr. Bryan Shader Partially supported by Wyoming EPSCoR
Labor Market information and Trends
Image & Model Fitting Abstractions February 2017
SRAM Yield Rate Optimization EE201C Final Project
Quantifying the Impact of Edge Computing on Mobile Applications
© 2010 Pearson Education, Inc. All rights reserved
ECEN “Mobile Wireless Networking”
Page 1. Page 2 Page 3 Page 4 Page 5 Page 6 Page 7.
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Cross-Layer Optimization for State Update in Mobile Gaming
Iterative Optimization
Extending a secure development methodology to distributed systems
Jason A. Fuemmeler, and Venugopal V. Veeravalli Edwin Lei
Discrete-time markov chain (continuation)
Probabilistic Convergence and Bounds
The Five Themes of Geography A Framework for Studying the World
Building Fractal Landscapes

Introduction to Scientific Computing II
Compute convex lower bounding function and optimize it instead!
Redundant Ghost Nodes in Jacobi
Bucket Renormalization for Approximate Inference
(c) SNU CSE Biointelligence Lab,
Motion-Aware Routing in Vehicular Ad-hoc Networks
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Hidden Markov Models (cont.) Markov Decision Processes
Generalized Chain Propose and discuss a simple generalization of the chain algorithm to minimize memory for the following situations: (A) Two simple paths.
Introduction to Scientific Computing II
Trademark And Copyright Solution | Basic Principles Of Copyrights
Presentation transcript:

Iterative Optimization of Registration and Paging Policies Sichao Yang and Bruce Hajek Illinois Center for Wireless Systems Problems Ideas Paging Cost. --- bandwidth l Registration Cost. --- power and bandwidth l There is a tradeoff between these two costs l Registration Policy Notation Hexagonal Grid Motion Model Registration Policy l Continuation Region l Continuation Region Continuation Region Conclusions Continuation Region Iteration algorithm can be applied to an general l Markov Chain Mobile issues registration when it is not where l it is expected to be Continuation region tends to move with mobile l Continuation region tends to increase with l d Converge to locally optimal, but not globally l optimal