Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems

  • Amotz Bar-Noy
  • Panagiotis Cheilaris
  • Yi Feng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6049)

Abstract

Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are independent. The task is to find any one, or all, of the users, by paging the cells in a predetermined number of rounds. In each round, any subset of the cells can be paged. When a cell is paged, the list of users in it is returned. The paging process terminates when the required user(s) are found. The objective is to minimize the expected number of paged cells. Finding any one user is known as the yellow page problem, and finding all users is known as the conference call problem. The conference call problem has been proved NP-hard, and a polynomial time approximation scheme exists. We study both problems in a unified framework. We introduce three methods for computing the paging cost. We give a hierarchical classification of users. For certain classes of users, we either provide polynomial time optimal solutions, or provide relatively efficient exponential time solutions. We design a family of twelve fast greedy heuristics that generate competitive paging strategies. We implement optimal algorithms and non-optimal heuristics. We test the performance of our greedy heuristics on many patterns of input data with different parameters. We select the best heuristics for both problems based on our simulation. We evaluate their performances on randomly generated Zipf and uniform data and on real user data.

Keywords

cellular networks paging location management experimental analysis of algorithms heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., Mcnair, J., Ho, J., Uzunalioglu, H., Wang, W.: Mobility management in next-generation wireless systems. In: Proc. IEEE, pp. 1347–1384 (1999)Google Scholar
  2. 2.
    Bar-Noy, A., Cheilaris, P., Feng, Y.: Paging multiple users in cellular network: Yellow page and conference call problems. Tech. Rep. TR-2010003, Department of Computer Science, The Gradaute Center of CUNY, New York, NY (2010)Google Scholar
  3. 3.
    Bar-Noy, A., Feng, Y., Golin, M.J.: Paging mobile users efficiently and optimally. In: Proc. IEEE Conference on Computer Communications, pp. 1910–1918 (2007)Google Scholar
  4. 4.
    Bar-Noy, A., Malewicz, G.: Establishing wireless conference calls under delay constraints. J. Algorithms 51(2), 145–169 (2004)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bar-Noy, A., Naor, Z.: Efficient multicast search under delay and bandwidth constraints. Wireless Networks 12(6), 747–757 (2006)CrossRefGoogle Scholar
  6. 6.
    Cohen, E., Fiat, A., Kaplan, H.: Efficient sequences of trials. In: Proc. of the ACM-SIAM symposium on Discrete algorithms (SODA), pp. 737–746 (2003)Google Scholar
  7. 7.
    Epstein, L., Levin, A.: The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3), 418–429 (2006)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Epstein, L., Levin, A.: A PTAS for delay minimization in establishing wireless conference calls. Discrete Optimization 5(1), 88–96 (2008)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Gau, R.H., Haas, Z.J.: Concurrent search of mobile users in cellular networks. IEEE/ACM Trans. Netw. 12(1), 117–130 (2004)CrossRefGoogle Scholar
  10. 10.
    Goodman, D.J., Krishnan, P., Sugla, B.: Minimizing queuing delays and number of messages in mobile phone location. Mobile Netw. and Appl. 1(1), 39–48 (1996)CrossRefGoogle Scholar
  11. 11.
    Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Proc. of ACM Symposium on Theory of Computing (STOC), pp. 356–365 (2005)Google Scholar
  12. 12.
    Krishnamachari, B., Gau, R.H., Wicker, S.B., Haas, Z.J.: Optimal sequential paging in cellular wireless networks. Wireless Netw. 10(2), 121–131 (2004)CrossRefGoogle Scholar
  13. 13.
    Rose, C., Yates, R.D.: Minimizing the average cost of paging under delay constraints. Wireless Netw. 1(2), 211–219 (1995)CrossRefGoogle Scholar
  14. 14.
    Rose, C., Yates, R.D.: Ensemble polling strategies for increased paging capacity in mobile communication networks. Wireless Netw. 3(2), 159–167 (1997)CrossRefGoogle Scholar
  15. 15.
    Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641–654 (1979)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Amotz Bar-Noy
    • 1
    • 2
  • Panagiotis Cheilaris
    • 3
  • Yi Feng
    • 1
  1. 1.Department of Computer Science, The Graduate Center of CityUniversity of New YorkNew York, NY
  2. 2.Department of Computer and Information SciencesBrooklyn College of City University of New YorkBrooklyn, NY
  3. 3.Center for Advanced Studies in Mathematics, Department of MathematicsBen-Gurion University of the NegevBe’er ShevaIsrael

Personalised recommendations