Publication 2008 Issue No. 9 - September Abstract - Searching for Multiple Mobile Users
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Zohar Naor
Searching for Multiple Mobile Users
September 2008 (vol. 7 no. 9)
pp. 1071-1083
 ASCII Text x Zohar Naor, "Searching for Multiple Mobile Users," IEEE Transactions on Mobile Computing, vol. 7, no. 9, pp. 1071-1083, September, 2008.
 BibTex x @article{ 10.1109/TMC.2008.25,author = {Zohar Naor},title = {Searching for Multiple Mobile Users},journal ={IEEE Transactions on Mobile Computing},volume = {7},number = {9},issn = {1536-1233},year = {2008},pages = {1071-1083},doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.25},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Mobile ComputingTI - Searching for Multiple Mobile UsersIS - 9SN - 1536-1233SP1071EP1083EPD - 1071-1083A1 - Zohar Naor, PY - 2008KW - location managementKW - PagingKW - mobileKW - multipleKW - searchKW - cellular networks.VL - 7JA - IEEE Transactions on Mobile ComputingER -
The problem of searching for mobile users in cellular networks is addressed in this study. Previous studies addressing this issue have focused on the problem of searching for a single user. As it is shown in this study, the problem of maximizing the expected rate of successful searches under delay and bandwidth constraints is NP-hard. {\bf When the potential locations of different users overlap, the derivation of an optimal concurrent search for many independent users from a set of optimal single user searches is NP-hard}. In reality, a cellular network has to serve many competing search requests sharing a limited bandwidth. Since the problem of maximizing the expected rate of successful searches under delay and bandwidth constraints is NP-hard, this study proposes a heuristic algorithm, that is optimal for most probable cases, and its worst case running time complexity is $O(n(\log{n} + C\log{C}))$, where $n$ is the number of mobile users that must be found, and $C$ is the number of their potential locations. {\bf The approximation ratio of the proposed search algorithm is less than 2}.

[1] N. Alon, Y. Azar, G. Woeginger, and T. Yadid, “Approximation Schemes for Scheduling,” Proc. Eighth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '97), pp. 493-500, 1997.
[2] I.F. Akyildiz, J.S.M. Ho, and Y.B. Lin, “Movement-Based Location Update and Selective Paging Schemes,” IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 629-638, 1996.
[3] A. Bar-Noy and I. Kessler, “Tracking Mobile Users in Wireless Networks,” IEEE Trans. Information Theory, vol. 39, 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, 1995.
[5] A. Bar-Noy and Z. Naor, “Establishing a Mobile Conference Call under Delay and Bandwidth Constraints,” Proc. IEEE INFOCOM, 2004.
[6] A.K. Chandra and C.K. Wong, “Worst Case Analysis of a Placement Algorithm Related to Storage Allocation,” SIAM J. Computing, vol. 4, no. 3, pp. 249-263, 1975.
[7] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” Proc. ACM MobiCom, 1999.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[9] R.L. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM J. Applied Math., vol. 17, no. 2, pp. 416-429, 1969.
[10] D.S. Hochbaum and D. Shmoys, “Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results,” J. ACM, vol. 34, no. 1, pp. 144-162, 1987.
[11] L. Kleinrock, Queueing Systems, vol. 1, p. 2, Wiley, 1976.
[12] U. Madhow, L. Honig, and K. Steiglitz, “Optimization of Wireless Resources for Personal Communications Mobility Tracking,” IEEE Trans. Networking, vol. 3, no. 6, pp. 698-707, 1995.
[13] S. Madhavapeddy, K. Basu, and A. Roberts, “Adaptive Paging Algorithms for Cellular Systems,” Wireless Information Networks: Architecture, Resource Management and Mobile Data, pp. 83-101, 1996.
[14] Z. Naor, “On-Line Search for Mobile Users,” Proc. IEEE INFOCOM, 2005.
[15] Z. Naor and H. Levy, “LATS: A Load-Adaptive Threshold Scheme for Tracking Mobile Users,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 808-817, 1999.
[16] C. Rose and R. Yates, “Minimizing the Average Cost of Paging under Delay Constraints,” ACM J. Wireless Networks, vol. 1, no. 2, pp. 211-219, 1995.
[17] C. Rose, “Minimizing the Average Cost of Paging and Registration : A Timer-Based Method,” ACM J. Wireless Networks, vol. 2, no. 2, pp. 109-116, 1996.
[18] C. Rose and R. Yates, “Ensemble Polling Strategies for Increased Paging Capacity in Mobile Communication Networks,” ACM J. Wireless Networks, vol. 3, pp. 159-167, 1997.
[19] “Cellular Radio-Telecommunications Intersystem Operations,” EIA/TIA Technical Report IS-41 Revision C, 1995.

Index Terms:
location management, Paging, mobile, multiple, search, cellular networks.
Citation:
Zohar Naor, "Searching for Multiple Mobile Users," IEEE Transactions on Mobile Computing, vol. 7, no. 9, pp. 1071-1083, Sept. 2008, doi:10.1109/TMC.2008.25