Paging and registration in cellular networks: Jointly optimal policies and an iterative algorithm

Brace Hajek, Kevin Mitzel, Sichao Yang

Research output: Contribution to journalConference articlepeer-review

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 processes. It is shown that there exist policies with a certain simple structure 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.

Original languageEnglish (US)
Pages (from-to)524-532
Number of pages9
JournalProceedings - IEEE INFOCOM
Volume1
StatePublished - 2003
Event22nd Annual Joint Conference on the IEEE Computer and Communications Societies - San Francisco, CA, United States
Duration: Mar 30 2003Apr 3 2003

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Paging and registration in cellular networks: Jointly optimal policies and an iterative algorithm'. Together they form a unique fingerprint.

Cite this