Loading [a11y]/accessibility-menu.js
Jointly optimal paging and registration for a symmetric random walk | IEEE Conference Publication | IEEE Xplore

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 symm...Show More

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.
Date of Conference: 25-25 October 2002
Date Added to IEEE Xplore: 06 January 2003
Print ISBN:0-7803-7629-3
Conference Location: Bangalore, India

Contact IEEE to Subscribe

References

References is not available for this document.