Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm

DOI10.1109/TIT.2007.913566zbMATH Open1311.94003arXivcs/0702102WikidataQ114983482 ScholiaQ114983482MaRDI QIDQ3604602FDOQ3604602

Authors: Bruce Hajek, Kevin Mitzel, Sichao Yang 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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, though the dynamic programming approach does not directly provide an efficient method to find the policies. 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, but an example is given showing that the policies need not be jointly optimal. 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.

Full work available at URL: https://arxiv.org/abs/cs/0702102

Recommendations

• Paging mobile users in cellular networks: optimality versus complexity and simplicity
• Competitive on-line paging strategies for mobile users under delay constraints
• Location-area partition in a cellular radio network
• Structural Information and Communication Complexity
• A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks

Mathematics Subject Classification ID

Communication theory (94A05) Circuits, networks (94C99) Discrete-time Markov processes on general state spaces (60J05)

Cited In (4)

• Title not available (Why is that?)
• Paging mobile users in cellular networks: optimality versus complexity and simplicity
• Optimal communication scheduling and remote estimation over an additive noise channel
• Suboptimal event‐triggered control for networked control systems

This page was built for publication: Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604602)