This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamical Mobile Terminal Location Registration in Wireless PCS Networks
November/December 2005 (vol. 4 no. 6)
pp. 630-640
ASCII Text
x 
 
Zikuan Liu, Tien Dai Bui, "Dynamical Mobile Terminal Location Registration in Wireless PCS Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 6, pp. 630-640, November/December, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2005.88,
author = {Zikuan Liu and Tien Dai Bui},
title = {Dynamical Mobile Terminal Location Registration in Wireless PCS Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {4},
number = {6},
issn = {1536-1233},
year = {2005},
pages = {630-640},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2005.88},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Dynamical Mobile Terminal Location Registration in Wireless PCS Networks
IS - 6
SN - 1536-1233
SP630
EP640
EPD - 630-640
A1 - Zikuan Liu,
A1 - Tien Dai Bui,
PY - 2005
KW - Index Terms- Personal communication service system
KW - location registration
KW - Markov decision process
KW - single sample path-based ordinal optimization.
VL - 4
JA - IEEE Transactions on Mobile Computing
ER -
 
In this paper, we propose a mobile terminal (MT) location registration/update model. In this model, the registration decision is based on two factors—the time elapsed since last call arrival and the distance the MT has traveled since last registration. It is established that the optimal registration strategy can be represented by a curve. Only when the state of the system reaches this curve is a registration performed. In order for an MT to calculate its traveled distance, an interactive implementation scheme and a distance calculation algorithm are developed. When the call interarrival times are independent and geometrically distributed, the proposed model becomes a distance-based model and, in this case, the optimal registration strategy is of threshold structure. For the distance-based model, a single sample path-based ordinal optimization algorithm is devised. In this algorithm, without any knowledge about the system parameters, the MT observes the system state transitions, estimates the ordinal of a set of strategies, and updates the registration strategy adaptively. Since only a single sample path is used, this algorithm can be implemented online. Several numerical examples are provided to compare the proposed model and the existing ones.

[1] I.F. Akyildiz and W. Wang, “A Dynamic Location Management Scheme for Next-Generation Multitier PCS Systems,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 178-189, 2002.
[2] I.F. Akyildiz, Y.B. Lin, W.R. Lai, and R.J. Chen, “A New Random Walk Model for PCS Networks,” IEEE J. Selected Areas in Comm., vol. 18, pp. 1254-1260, 2000.
[3] I.F. Akyildiz, J. McNair, J. Ho, H. Zunalioglu, and W. Wang, “Mobility Management in Next-Generation Wireless Systems,” Proc. IEEE, vol. 87, pp. 1347-1384, 1999.
[4] I.F. Akyildiz, J. Ho, and Y.B. Lin, “Movement-Based Location Update and Selective Paging for PCS Networks,” IEEE/ACM Trans. Networking, vol. 4, pp. 629-638, 1996.
[5] A. Bar-Noy, I. Kessler, and S. Moshe, “Mobile Users: To Update or Not to Update?” ACM/Baltzer, J. Wireless Networks, vol. 1, no. 2, pp. 175-195, 1995.
[6] D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming. Belmont, Mass.: Athena Scientific, 1996.
[7] C.G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Boston: Kluwer Academic, 1999.
[8] X.R. Cao and H.F. Chen, “Perturbation Realization, Potentials, and Sensitivity Analysis of Markov Process,” IEEE Trans. Automatic Control, vol. 42, no. 10, pp. 1382-1893, 1997.
[9] E. Cayirci and I.F. Akyildiz, “User Mobility Pattern Scheme for Location Update and Paging in Wireless Systems,” IEEE Trans. Mobile Computing, vol. 1, no. 3, pp. 236-247, July-Sept. 2002.
[10] L. Dai, “Convergence Properties of Ordinal Comparison in the Simulation of Discrete Event Dynamic Systems,” J. Optimization Theory and Application, vol. 91, pp. 363-388, 1996.
[11] D. Gu and S.S. Rappaport, “A Dynamic Location Tracking Strategy for Mobile Communication Systems,” Proc. IEEE Vehicular Technology Conf. (VTC '98), pp. 259-263, May 1998.
[12] J.S.M. Ho and I.F. Akyildiz, “Mobile User Location Update and Paging under Delay Constraints,” ACM-Baltzer J. Wireless Networks, vol. 1, pp. 413-425, 1995.
[13] Y.C. Ho, R.S. Sreenivas, and P. Vakili, “Ordinal Optimization in DEDS,” J. Discrete Event Dynamic Systems: Theory and Application, vol. 2, pp. 61-88, 1992.
[14] B. Liang and Z. Hass, “Predictive Distance-Based Mobility Management for PCS Networks,” Proc. IEEE INFOCOM '99, 1999.
[15] Y.B. Lin, “Reducing Location Update Cost in a PCS Network,” IEEE/ACM Trans. Networking, vol. 5, pp. 25-33, 1997.
[16] Z. Liu and F.S. Tu, “Single Sample-Based Sensitivity Analysis of Markov Processes Using Uniformization,” IEEE Trans. Automatic Control, vol. 43, no. 4, pp. 872-875, 1999.
[17] J.G. Markoulidakis, G.L. Lyberopoulos, and M.E. Anagnostou, “Traffic Model for Third Generation Cellular Mobile Telecommunications Systems,” ACM-Baltzer J. Wireless Networks, vol. 4, pp. 389-400, 1998.
[18] Z. Naor, “Tracking Mobile Users with Uncertain Parameters,” Wireless Networks, vol. 9, pp. 637-646, 2003.
[19] Z. Naor and H. Levy, “Minimizing the Wireless Cost of Tracking Mobile Users: An Adaptive Threshold Scheme,” Proc. IEEE INFOCOM '98, pp. 720-727, 1998.
[20] G.P. Pollini et al., “A Profile-Based Location Strategy and Its Performance,” IEEE J. Selected Areas in Comm. (JSAC), vol. 15, no. 8, pp. 1415-24, 1997.
[21] C. Rose, “State-Based Paging/Registration: A Greedy Technique,” IEEE Trans. Vehicular Technology, vol. 48, pp. 166-173, 1999.
[22] C. Rose, “Minimizing the Average Cost of Paging and Registration: A Timer-Based Method,” ACM/Baltzer J. Wireless Networks, vol. 2, no. 2, pp. 109-116, 1996.
[23] S.M. Ross, Stochastic Processes. John Wiley, 1983.
[24] S.M. Ross, Applied Probability Models with Optimization Applications. Holden-Day, 1970.
[25] S.K. Sen, A. Bhattacharya, and S.K. Das, “A Selective Location Update Strategy for PCS Users,” ACM/Baltzer J. Wireless Networks, vol. 5, no. 5, pp. 313-326, 1999.
[26] Y.C. Tseng and C.C. Tan, “An Improved Cell Type Classification for Random Walk Modeling in Cellular Networks,” IEEE Comm. Letters, vol. 5, no. 8, pp. 337-339, 2001.
[27] G. Wan and E. Lin, “Cost Reduction in Location Management Using Semi-Realtime Movement Information,” ACM/Baltzer J. Wireless Networks, vol. 5, no. 4, pp. 245-256, 1999.
[28] W.S. Wong and C.M. Leung, “An Adaptive Distance-Based Location Update Algorithm for Next-Generation PCS Networks,” IEEE J. Selected Areas in Comm., vol. 19, no. 10, pp. 1942-1952, 2001.
[29] V. Wong and V. Leung, “Location Management for Next Generation Personal Communication Networks,” IEEE Network, vol. 14, pp. 18-24, 2000.
[30] G. Xue, “An Improved Random Walk Model for PCS Networks,” IEEE Trans. Comm., vol. 50, no. 8, pp. 1224-1226, 2002.

Index Terms:
Index Terms- Personal communication service system, location registration, Markov decision process, single sample path-based ordinal optimization.
Citation:
Zikuan Liu, Tien Dai Bui, "Dynamical Mobile Terminal Location Registration in Wireless PCS Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 6, pp. 630-640, Nov.-Dec. 2005, doi:10.1109/TMC.2005.88
Usage of this product signifies your acceptance of the Terms of Use.