iterative optimization of registration and paging policies sichao yang and bruce hajek

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

Upload: janae

Post on 16-Mar-2016

28 views

Category:

Documents


0 download

DESCRIPTION

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. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Iterative Optimization of Registration and Paging Policies Sichao Yang and Bruce Hajek

Iterative Optimization of Registration and Paging PoliciesSichao Yang and Bruce Hajek

Illinois Center forWireless Systems

Problems

Paging Cost. --- bandwidth Registration Cost. --- power and bandwidth

There is a tradeoff between these two costs

Ideas

Hexagonal Grid Motion Model

Continuation Region Continuation Region

Continuation Region Conclusions

Iteration algorithm can be applied to an generalMarkov Chain

Mobile issues registration when it is not whereit is expected to be

Continuation region tends to move with mobileContinuation region tends to increase withConverge to locally optimal, but not globally

optimal

Registration Policy Notation

Registration Policy

Continuation Region