Adaptive paging schemes for group calls in mobile broadband cellular systems

In this paper, we analyze the problem of efficient paging for group call searches under realistic mobility patterns. Taking as a basis a location update scheme, based on the definition of an adaptive macro-location area, adapted to the mobility pattern of the terminals, we characterize the residence probabilities in each location area of a generic macro-area. With this information, we propose and evaluate different sequential group paging strategies, also taking into account their computational cost. Results show the suitability of some of the proposals (semiadaptive and hybrid schemes) and its applicability to new packet-based broadband cellular systems.

[1]  Kyandoghere Kyamakya,et al.  Location management in cellular networks: classification of the most important paradigms, realistic Simulation framework, and relative performance analysis , 2005, IEEE Transactions on Vehicular Technology.

[2]  José Ramón Gállego,et al.  An adaptive location management scheme for mobile broadband cellular systems , 2009, ISWCS 2009.

[3]  Vicente Casares Giner,et al.  Reducing location update and paging costs in a PCS network , 2002, IEEE Trans. Wirel. Commun..

[4]  rd Generation Partnership.  Multimedia broadcast multicast service (MBMS) ; Architecture and functional description , 2004 .

[5]  Leah Epstein,et al.  The Conference Call Search Problem in Wireless Networks , 2005, WAOA.

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

[7]  Amotz Bar-Noy,et al.  Efficient multicast search under delay and bandwidth constraints , 2006, Wirel. Networks.

[8]  Christian Bonnet,et al.  Vehicular Mobility Simulation for VANETs , 2007, 40th Annual Simulation Symposium (ANSS'07).

[9]  Thomas Kunz,et al.  The Peril of Evaluating Location Management Proposals through Simulations , 2001, Wirel. Networks.

[10]  Amotz Bar-Noy,et al.  Establishing wireless conference calls under delay constraints , 2004, J. Algorithms.

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

[12]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.