DocumentCode :
2607094
Title :
Jointly optimal paging and registration for a symmetric random walk
Author :
Hajek, Bruce
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fYear :
2002
fDate :
20-25 Oct. 2002
Firstpage :
20
Lastpage :
23
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.
Keywords :
cellular radio; optimisation; paging communication; probability; cellular radio network; distance threshold policy; infinite-horizon average cost; jointly optimal paging/registration; linear array; mobile station; optimal registration policy; ping-pong paging policy; symmetric random walk; unimodal step size distribution; Algebra; Costs; Land mobile radio cellular systems; Markov processes; Symmetric matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2002. Proceedings of the 2002 IEEE
Print_ISBN :
0-7803-7629-3
Type :
conf
DOI :
10.1109/ITW.2002.1115405
Filename :
1115405
Link To Document :
بازگشت