Jointly optimal paging and registration for a symmetric random walk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Jointly optimal paging and registration policies are identified for a cellular network composed of a linear array of cells. Motion is modeled as a random walk with a symmetric, unimodal step size distribution. Minimization of the discounted, infinite-horizon average cost is addressed. The jointly optimal pair of paging and registration policies is found. The optimal registration policy is a distance threshold type: the mobile station. registers whenever its distance from the previous reporting point exceeds a-threshold. The paging policy is ping-pong type: cells are searched in an order of increasing distance from the cell in which the previous report occurred.

Original languageEnglish (US)
Title of host publicationProceedings of the 2002 IEEE Information Theory Workshop, ITW 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages20-23
Number of pages4
ISBN (Electronic)0780376293, 9780780376298
DOIs
StatePublished - 2002
Event2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India
Duration: Oct 20 2002Oct 25 2002

Publication series

NameProceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Other

Other2002 IEEE Information Theory Workshop, ITW 2002
Country/TerritoryIndia
CityBangalore
Period10/20/0210/25/02

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Jointly optimal paging and registration for a symmetric random walk'. Together they form a unique fingerprint.

Cite this