This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization
December 2007 (vol. 6 no. 12)
pp. 1426-1440
ASCII Text
x 
 
Abhishek Roy, Archan Misra, Sajal K. Das, "Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization," IEEE Transactions on Mobile Computing, vol. 6, no. 12, pp. 1426-1440, December, 2007.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2007.1059,
author = {Abhishek Roy and Archan Misra and Sajal K. Das},
title = {Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization},
journal ={IEEE Transactions on Mobile Computing},
volume = {6},
number = {12},
issn = {1536-1233},
year = {2007},
pages = {1426-1440},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2007.1059},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization
IS - 12
SN - 1536-1233
SP1426
EP1440
EPD - 1426-1440
A1 - Abhishek Roy,
A1 - Archan Misra,
A1 - Sajal K. Das,
PY - 2007
KW - Location management
KW - update
KW - paging
KW - spatial and temporal quantization
KW - information theory
KW -
VL - 6
JA - IEEE Transactions on Mobile Computing
ER -
 
In this paper we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches attempt to always accurately convey a mobile’s movement sequence and hence, cannot reduce the signaling cost below the entropy bound. Our proposed techniques, however, exploit rate-distortion theory to arbitrarily reduce the update cost, at the expense of an increase in the corresponding paging overhead. To this end, we describe two location tracking algorithms, based on spatial quantization and temporal quantization, which first quantize the movement sequence into a smaller set of codewords, and then report a compressed representation of the codeword sequence. While the spatial quantization algorithm clusters individual cells into registration areas, the more powerful temporal quantization algorithm groups sets of consecutive movement patterns. The quantizers themselves are adaptive and periodically reconfigure to accommodate changes in the mobile’s movement pattern. Simulation study with synthetic as well as real movement traces for both single-system and multi-system cellular networks demonstrate that the proposed algorithms can reduce the mobile’s update frequency to 3-4 updates/day with reasonable paging cost, low computational complexity, storage overhead and codebook updates.

[1] I.F. Akyildiz and J.S.M. Ho, “Dynamic Mobile User Location Update for Wireless PCS Networks,” ACM Wireless Networks, vol. 1, no. 2, pp. 187-196, July 1995.
[2] 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, Jan. 2002.
[3] A. Bar-Noy and I. Kessler, “Tracking Mobile Users in Wireless Communication Networks,” IEEE/ACM Trans. Information Theory, vol. 39, no. 6, pp. 1877-1886, Nov. 1993.
[4] A. Bar-Noy, I. Kessler, and M. Sidi, “Mobile Users: To Update or Not to Update,” Wireless Networks, vol. 1, no. 2, pp. 175-185, July 1995.
[5] A. Bar-Noy, I. Kessler, and M. Naghshineh, “Topology-Based Tracking Strategies for Personal Communication Networks,” Mobile Networks and Applications, vol. 1, no. 1, pp. 49-56, Jan. 1996.
[6] K. Barr and K. Asanovic, “Energy Aware Lossless Data Compression,” Proc. ACM MobiSys, May 2003.
[7] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach for Personal Mobility Tracking in PCS Networks,” Wireless Networks, vol. 8, no. 2, pp. 121-137, 2002.
[8] Y. Birk and Y. Nachman, “User Direction and Elapsed-Time Information to Reduce the Wireless Cost of Locating Mobile Users in Cellular Networks,” Wireless Networks, vol. 1, no. 4, pp. 403-412, Dec. 1995.
[9] C. Castellucia, “Extending Mobile IP with Adaptive Individual Paging: A Performance Analysis,” ACM Mobile Computing and Comm. Rev., vol. 5, no. 2, pp. 15-26, 1999.
[10] I.R. Chen and B. Gu, “A Comparative Cost Analysis of Degradable Location Management Algorithms in Wireless Networks,” The Computer J., vol. 45, no. 3, 2002.
[11] J.G. Cleary and I.H. Witten, “Data Compression Using Adaptive Coding and Partial String Matching,” IEEE Trans. Comm., vol. 32, no. 4, pp. 396-402, Apr. 1984.
[12] T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
[13] http://cmc.cs.dartmouth.edu/datadartmouth , Mar. 2005.
[14] I. Demirkol, C. Ersoy, M.U. Caglayan, and H. Delic, “Location Area Planning in Cellular Networks Using Simulated Annealing,” Proc. IEEE INFOCOM, vol. 1, pp. 13-20, 2001.
[15] Deployment of Mobile Telephony Infrastructure Hindered, http://strategis.ic.gc.ca/epic/internet/ inimr-ri.nsf/engr111954e.html, June 2006.
[16] Digital Wireless Basics, http://www.privateline.com/PCS Frequencies.htm#anchor5612950 , Aug. 2006.
[17] N. Farvardin and J. Modestino, “Optimum Quantizer Performance for a Class of Non-Gaussian Memoryless Sources,” IEEE Trans. Information Theory, vol. 30, no. 3, pp. 485-498, May 1984.
[18] M. Feder, N. Merhav, and M. Gutman, “Universal Prediction of Individual Sequences,” IEEE Trans. Information Theory, vol. 38, no. 4, pp. 1258-1270, 1992.
[19] R. Gau and Z. Haas, “Concurrent Search of Mobile Users in Cellular Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 1, pp. 117-130, Feb. 2004.
[20] A. Gersho and R.M. Gray, Vector Quantization and Signal Processing. Kluwer Academic Publishers, 1992.
[21] V. Casares-Ginerl and P. Garcia-Escallel, On the Fractional Movement-Distance Based Scheme for PCS Location Management with Selective Paging. Springer-Verlag, 2005.
[22] A. Harter and A. Hopper, “A Distributed Location System for the Active Office,” IEEE Network, vol. 8, no. 1, pp. 62-70, Jan./Feb. 1994.
[23] J.S.M. Ho and I. Akyildiz, “Mobile User Location Update and Paging under Delay Constraints,” ACM/Kluwer Wireless Networks, vol. 1, no. 4, pp. 413-425, Dec. 1995.
[24] A. Jagoe, Mobile Location Services: The Definitive Guide. Scitech Publishing, 2003.
[25] B. Liang and Z.J. Haas, “Predictive Distance-Based Mobility Management for PCS Networks,” Proc. IEEE INFOCOM, Mar. 1999.
[26] G.L. Lyberopoulos, J.G. Markoulidakis, D.V. Polymeros, D.F. Tsirkas, and E.D. Sykas, “Intelligent Paging Strategies for Third Generation Mobile Telecommunication Systems,” IEEE Trans. Vehicular Technology, vol. 44, no. 3, pp. 543-553, Aug. 1995.
[27] U. Madhow, M. Honig, and K. Steiglitz, “Optimization of Wireless Resources for Personal Communications Mobility Tracking,” IEEE/ACM Trans. Networking, vol. 3, no. 6, pp. 698-707, Dec. 1995.
[28] A. Misra, A. Roy, and S.K. Das, “An Information Theoretic Framework for Optimal Location Tracking in Multi-System 4G Wireless Networks,” Proc. IEEE INFOCOM, vol. 1, pp. 286-297, 2004.
[29] P. Mutaf and C. Castelluccia, “Hash-Based Paging and Location Update Using Bloom Filters,” Mobile Networks and Applications, vol. 9, no. 6, pp. 627-631, 2005.
[30] http://www.ofcom.org.uk/static/archive/ra/ topics/mpsafety/school-auditstewqa.htm#bs2 , 2007.
[31] A. Orlitsky, “Worst-Case Rate of Scalar vs. Vector Quantization,” IEEE Trans. Information Theory, vol. 48, no. 6, pp. 1393-1409, June 2002.
[32] G.P. Pollini and I. Chih-Lin, “A Profile-Based Location Strategy and Its Performance,” IEEE J. Selected Areas in Comm., vol. 15, no. 8, pp.1415-1424, 1997.
[33] C. Rose, “Minimizing the Average Cost of Paging and Registration: A Timer-Based Method,” Wireless Networks, vol. 2, pp. 109-116, 1996.
[34] C. Rose and R. Yates, “Ensemble Polling Strategies for Increased Capacity in Mobile Communications Networks,” Wireless Networks, vol. 3, no. 2, pp. 159-167, May 1997.
[35] C. Rose and R. Yates, “Minimizing the Average Cost of Paging under Delay Constraints,” Wireless Networks, vol. 1, no. 2, pp. 211-219, 1995.
[36] A. Roy, A. Misra, and S.K. Das, “The Minimum Expected Cost Paging Problem for Multi-System Wireless Networks,” Proc. IEEE/ACM Workshop Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '04), 2004.
[37] A. Roy, A. Misra, and S.K. Das, “A Rate-Distortion Framework for Information-Theoretic Mobility Management,” Proc. IEEE Int'l Conf. Comm. (ICC '04), vol. 27, no. 1, pp. 3937-3941, 2004.
[38] C. Shannon, “A Mathematical Theory of Communication,” Bell Systems Technical J., vol. 27, pp. 379-423 and 623-656, 1948.
[39] L. Song, D. Kotz, R. Jain, and X. He, “Evaluating Location Predictors with Extensive Wi-Fi Mobility Data,” Proc. IEEE INFOCOM, vol. 23, no. 1, pp. 1415-1425, 2004.
[40] S. Tabbane, “An Alternative Strategy for Location Tracking,” IEEE J. Selected Areas in Comm., vol. 13, no. 5, pp. 880-892, June 1995.
[41] T. Tung and A. Jamalipour, “Adaptive Location Management Strategy Combining Distance-Based Update and Sectional Paging Techniques,” Proc. 36th Hawaii Int'l Conf. System Sciences (HICSS '03), Jan. 2003.
[42] G. Wan and E. Lin, “A Dynamic Paging Scheme for Wireless Communications Systems,” Proc. ACM MobiCom, 1997.
[43] J. Ziv and A. Lempel, “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530-536, Sept. 1978.

Index Terms:
Location management, update, paging, spatial and temporal quantization, information theory,
Citation:
Abhishek Roy, Archan Misra, Sajal K. Das, "Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization," IEEE Transactions on Mobile Computing, vol. 6, no. 12, pp. 1426-1440, Dec. 2007, doi:10.1109/TMC.2007.1059
Usage of this product signifies your acceptance of the Terms of Use.