Predictive and adaptive bandwidth reservation for hand-offs in QoS-sensitive cellular networks

How to control hand-off drops is a very important Quality-of-Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes for the bandwidth reservation for the existing connections' handoffs and the admission control of new connections.We first develop a method to estimate user mobility based on an aggregate history of hand-offs observed in each cell. This method is then used to predict (probabilistically) mobiles' directions and hand-off times in a cell. For each cell, the bandwidth to be reserved for hand-offs is calculated by estimating the total sum of fractional bandwidths of the expected hand-offs within a mobility-estimation time window. We also develop an algorithm that controls this window for efficient use of bandwidth and effective response to (1) time-varying traffic/mobility and (2) inaccuracy of mobility estimation. Three different admission-control schemes for new connection requests using this bandwidth reservation are proposed. Finally, we evaluate the performance of the proposed schemes to show that they meet our design goal and outperform the static reservation scheme under various scenarios.

[1]  Kang G. Shin,et al.  A cellular wireless local area network with QoS guarantees for heterogeneous traffic , 1998, Mob. Networks Appl..

[2]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[3]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[4]  Stephen S. Rappaport,et al.  Traffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures , 1986, IEEE Transactions on Vehicular Technology.

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[6]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[7]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[9]  Ian F. Akyildiz,et al.  A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept , 1997, TNET.

[10]  B. R. Badrinath,et al.  On accommodating mobile hosts in an integrated services packet network , 1997, Proceedings of INFOCOM '97.

[11]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[12]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[13]  Kang G. Shin,et al.  Uplink CDMA systems with diverse QoS guarantees for heterogeneous traffic , 1997, MobiCom '97.

[14]  Stephen S. Rappaport,et al.  Comments on "Teletraffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures" , 1986 .

[15]  Kam Lee.  Supporting mobile multimedia in integrated services networks , 1996, Wirel. Networks.

[16]  Songwu Lu,et al.  Adaptive resource management algorithms for indoor mobile computing environments , 1996, SIGCOMM '96.

[17]  Anindo Banerjea,et al.  The Tenet real-time protocol suite: design, implementation, and experiences , 1996, TNET.

[18]  Kang G. Shin,et al.  Comparison of connection admission-control schemes in the presence of hand-offs in cellular networks , 1998, MobiCom '98.

[19]  Mischa Schwartz,et al.  Distributed call admission control in mobile/wireless networks , 1996, IEEE J. Sel. Areas Commun..