Derivation of Moving Distance Distribution to Enhance Sequential Paging in Distance-Based Mobility Management for PCS Networks

The total signaling cost of distance-based location management scheme, which is the lowest among dynamic location management schemes for PCS networks, can be further reduced by a sequential paging strategy that pages first the cells in which the mobile is most likely located. To enable this strategy, we derive the probability distribution of a mobile's moving distances between the last location update and the next call arrival. An efficient and effective sequential paging scheme is presented, which guarantees that a mobile can be located during the first paging step with a probability equal to or better than a predefined value. The features of the proposed model include flexible cell topologies, general cell residence time, and full use of mobile's moving pattern

[1]  Victor C. M. Leung,et al.  Probability distribution of channel holding time in cellular telephony systems , 1996, Proceedings of Vehicular Technology Conference - VTC.

[2]  Yi-Bing Lin Reducing location update cost in a PCS network , 1996, Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications.

[3]  Keqin Li,et al.  Optimal dynamic mobility management for PCS networks , 2000, TNET.

[4]  Ian F. Akyildiz,et al.  Movement-based location update and selective paging for PCS networks , 1996, TNET.

[5]  Ian F. Akyildiz,et al.  A new random walk model for PCS networks , 2000, IEEE Journal on Selected Areas in Communications.

[6]  Yihua Zhu,et al.  A general probability formula of the number of location areas' boundaries crossed by a mobile between two successive call arrivals , 2008, Journal of Computer Science and Technology.

[7]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[8]  Victor C. M. Leung,et al.  An adaptive distance-based location update algorithm for PCS networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[9]  Stephen B. Wicker,et al.  Optimal Sequential Paging in Cellular Wireless Networks , 2004, Wirel. Networks.

[10]  Victor C. M. Leung,et al.  Location management for next-generation personal communications networks , 2000, IEEE Netw..

[11]  Jang Hyun Baek,et al.  Modeling and analysis of distance-based registration with implicit registration , 2003 .

[12]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.

[14]  Yuguang Fang Movement-Based Mobility Management and Trade Off Analysis for Wireless Mobile Networks , 2003, IEEE Trans. Computers.

[15]  Victor C. M. Leung,et al.  An adaptive distance-based location update algorithm for next-generation PCS networks , 2001, IEEE J. Sel. Areas Commun..