Paper Info
Title
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
Abstract
This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. The structure of jointly optimal paging and registration policies is investigated through the use of dynamic programming for partially observed Markov processes. It is shown that there exist policies with a certain simple form that are jointly optimal. An iterative algorithm for policies with the simple form is proposed and investigated. The algorithm alternates between paging policy optimization, and registration policy optimization. It finds a pair of individually optimal policies. Majorization theory and Riesz's rearrangement inequality are used to show that jointly optimal paging and registration policies are given for symmetric or Gaussian random walk models by the nearest-location-first paging policy and distance threshold registration policies.
Year
DOI
Venue
2008
10.1109/TIT.2007.913566
INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies
Keywords
DocType
Volume
registration policy optimization,paging policy optimization,optimal paging,jointly optimal policies,iterative algorithm,certain simple form,registration,nearest-location-first paging policy,cellular networks,registration policy,optimal policy,distance threshold registration policy,partially observed markov processes,index terms—paging,algorithm alternate,majorization,rearrangement theory,discrete-time markov process,indexing terms,iterative methods,markov processes,markov process,dynamic programming,cellular network
Journal
54
Issue
ISSN
ISBN
2
0743-166X
0-7803-7752-4
Citations 
PageRank 
References 
35
3.73
14
Authors
3
Name
Order
Citations
PageRank
Bruce Hajek115417.84
Kevin Mitzel2353.73
Sichao Yang323614.32