Optimization of Distance-Based Location Management for PCS Networks

Location management (LM) is an important function in a personal communication network to track movements of mobile terminals (MTs) for call delivery. It is well-known that the total signaling cost of a distance-based LM scheme is the lowest among dynamic location management schemes for PCS networks. In this paper, we derive the joint probability distribution of two random variables: the moving distance of an MT and the number of location updates resulting from the moving distances exceeding the distance threshold. As special cases, the probability distributions of an MT's moving distances and the number of location updates during an LM interval are obtained. These statistics are generally applicable to irregular cell topologies and general cell residence time distributions. Based on the derived statistics, the optimal distance thresholds for distance based LM schemes with blanket paging and sequential paging are solved analytically. Numeric results show that our optimized distance-based LM scheme outperforms some well-known LM schemes in total LM cost.

[1]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1995, Wirel. Networks.

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

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

[5]  Amotz Bar-Noy,et al.  To Update or Not to Update? , 1996 .

[6]  Victor C. M. Leung,et al.  Optimization of Sequential Paging in Movement-Based Location Management Based on Movement Statistics , 2007, IEEE Transactions on Vehicular Technology.

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

[8]  Ian F. Akyildiz,et al.  Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems , 2001, Wirel. Networks.

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[11]  Victor C. M. Leung,et al.  Derivation of Moving Distance Distribution to Enhance Sequential Paging in Distance-Based Mobility Management for PCS Networks , 2006, IEEE Transactions on Wireless Communications.

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

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

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

[15]  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.

[16]  Albert Y. Zomaya,et al.  Evolving Cellular Automata for Location Management in Mobile Computing Networks , 2003, IEEE Trans. Parallel Distributed Syst..

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

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

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

[20]  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).