Jointly optimal paging and registration for a symmetric random walk

Bruce Hajek

doi:10.1109/ITW.2002.1115405

Jointly optimal paging and registration for a symmetric random walk

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	20-23
Number of pages	4
ISBN (Electronic)	0780376293, 9780780376298
DOIs	https://doi.org/10.1109/ITW.2002.1115405
State	Published - 2002
Event	2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India Duration: Oct 20 2002 → Oct 25 2002

Publication series

Name	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Other

Other	2002 IEEE Information Theory Workshop, ITW 2002
Country/Territory	India
City	Bangalore
Period	10/20/02 → 10/25/02

ASJC Scopus subject areas

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

Online availability

10.1109/ITW.2002.1115405

Library availability

Discover UIUC Full Text

Cite this

Jointly optimal paging and registration for a symmetric random walk. / Hajek, Bruce.
Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 20-23 1115405 (Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hajek, B 2002, Jointly optimal paging and registration for a symmetric random walk. in Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002., 1115405, Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002, Institute of Electrical and Electronics Engineers Inc., pp. 20-23, 2002 IEEE Information Theory Workshop, ITW 2002, Bangalore, India, 10/20/02. https://doi.org/10.1109/ITW.2002.1115405

@inproceedings{13722ef647da4537bfd997086ef7eda3,

title = "Jointly optimal paging and registration for a symmetric random walk",

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.",

author = "Bruce Hajek",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 2002 IEEE Information Theory Workshop, ITW 2002 ; Conference date: 20-10-2002 Through 25-10-2002",

year = "2002",

doi = "10.1109/ITW.2002.1115405",

language = "English (US)",

series = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "20--23",

booktitle = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

address = "United States",

}

TY - GEN

T1 - Jointly optimal paging and registration for a symmetric random walk

AU - Hajek, Bruce

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39849107276&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39849107276&partnerID=8YFLogxK

U2 - 10.1109/ITW.2002.1115405

DO - 10.1109/ITW.2002.1115405

M3 - Conference contribution

AN - SCOPUS:39849107276

T3 - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

SP - 20

EP - 23

BT - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2002 IEEE Information Theory Workshop, ITW 2002

Y2 - 20 October 2002 through 25 October 2002

ER -

Jointly optimal paging and registration for a symmetric random walk

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this