## Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks (2001)

Venue: | IEEE INFOCOM |

Citations: | 41 - 3 self |

### BibTeX

@INPROCEEDINGS{Yu01mobility-basedpredictive,

author = {Fei Yu and Victor Leung},

title = {Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks},

booktitle = {IEEE INFOCOM},

year = {2001},

pages = {518--526}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper presents call admission control and bandwidth reservation schemes in wireless cellular networks that have been developed based on assumptions more realistic than existing proposals. In order to guarantee the handoff dropping probability, we propose to statistically predict user mobility based on the mobility history of users. Our mobility prediction scheme is motivated by computational learning theory, which has shown that prediction is synonymous with data compression. We derive our mobility prediction scheme from data compression techniques that are both theoretically optimal and good in practice. In order to utilize resource more efficiently, we predict not only the cell to which the mobile will handoff but also when the handoff will occur. Based on the mobility prediction, bandwidth is reserved to guarantee some target handoff dropping probability. We also adaptively control the admission threshold to achieve a better balance between guaranteeing handoff dropping probability and maximizing resource utilization. Simulation results show that the proposed schemes meet our design goals and outperform the static-reservation and cell-reservation schemes. Paper submitted to Computer Networks. This paper is based on a paper presented at IEEE Infocom 2001, Anchorage, Alaska, April 2001. Technical subject area: call admission control, bandwidth reservation, mobility prediction. Please address all correspondence to Professor Victor Leung at the above address. This work was supported by a grant from Motorola Canada Ltd., and by the Canadian Natural Sciences and Engineering Research Council under grant CRDPJ 223095. Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks Yu 1 I.

### Citations

730 | Compression of individual sequences via variable-rate coding
- Ziv, Lempel
- 1978
(Show Context)
Citation Context ...evelop our mobility prediction algorithm based on the Ziv-Lempel algorithms for data compression, which are both theoretically optimal and good in practice. The original word-based Ziv-Lempel encoder =-=[23] b-=-reaks the input string into block-to-variable codes. The algorithm parses each block of size n in a greedy manner into distinct substrings x1 , x2 , ..., xn with the following property. For each j ≥... |

729 | Tarjan: Amortized efficiency of list update and paging rules - Sleator, E - 1985 |

664 |
Arithmetic coding for data compression
- Witten, Neal, et al.
- 1987
(Show Context)
Citation Context ... maintained in a trie [9]. The equivalent character-based Ziv-Lempel algorithm builds in an on-line fashion a probabilistic model (or a trie) that feeds probability information to an arithmetic coder =-=[22], which en-=-codes a sequence of probability of p using lg bits. We show by an example how these algorithms work. 1 ⎛--⎞ = – lgp ⎝p⎠ Example 1: Let the alphabet be {a, b, c}. We consider an input string ... |

524 |
CDMA: principles of spread spectrum communications
- Viterbi
- 1995
(Show Context)
Citation Context ...ff could fail due to insufficient bandwidth in the new cell, causing the handoff call to be dropped. In this paper, we do not consider (1) soft handoff in Code Division Multiple Access (CDMA) systems =-=[20]-=-, in which a mobile can communicate with two base stations simultaneously; (2) delay-insensitive applications, which can tolerate long handoff time delay when there is momentarily insufficient bandwid... |

236 | Optimal Prefetching via Data Compression
- Vitter, Krishnan
- 1991
(Show Context)
Citation Context ...h has shown that prediction is synonymous with generalization and data compression. Similar prediction approaches were applied previously to the problems of prefetching in large-scale database system =-=[21]-=- and location management of mobile users in cellular networks [2]. Although the possibility of applying these approaches to QoS provisioning was mentioned in [2], no further development was reported. ... |

157 |
Data Compression: Methods and Theory
- Storer
- 1988
(Show Context)
Citation Context ...actice, in order to reduce the memory and computation complexity, it is desirable to limit the size of the data structure for prediction. Several techniques are known for limiting data structure size =-=[19]-=-. An explicit upper bound M is placed on the size of the data structure. The data structure is either frozen when its size reaches M, flushed and rebuilt when its size reaches M, or frozen when its si... |

137 | A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept
- Levine, Akyildiz, et al.
- 1997
(Show Context)
Citation Context ...ted under the assumptions of exponentially-distributed channel holding time and perfect knowledge of the rate of handoff. These assumptions are unrealistic in real networks. The shadow cluster scheme =-=[11] est-=-imates future resource requirements in a 1s“Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks” Yu collection of cells in which a mobile is li... |

126 | On optimal call admission control in cellular networks. Wireless Networks
- Ramjee, Towsley, et al.
- 1997
(Show Context)
Citation Context ...CAC algorithms. Based on the above considerations, several schemes have recently been proposed for CAC in wireless cellular networks. The guard channel policy [15] and fractional guard channel policy =-=[16]-=- determine the number of guard channels reserved for handoffs by considering just the status of the local cell. Users are assumed uniformly located in any cell of the mobile network under these polici... |

120 |
Distributed call admission control in mobile/wireless network
- Naghshineh, Schwartz
- 1996
(Show Context)
Citation Context ...or handoffs by considering just the status of the local cell. Users are assumed uniformly located in any cell of the mobile network under these policies. The distributed call admission control scheme =-=[13]-=- considers not only the status of the local cell but also that of adjacent cells. The total required bandwidth for both handoff and existing connections is calculated under the assumptions of exponent... |

63 | Adaptive Resource Management Algorithms for Indoor Mobile Computing Environments
- Lu, Bharghavan
- 1996
(Show Context)
Citation Context ... the shadow cluster in real networks, as it assumes either precise knowledge of user mobility or totally random user movements. There have also been some research efforts to predict user mobility. In =-=[12]-=-, the next cell to which a mobile will move is predicted in an indoor environment. But this scheme does not estimate channel holding time and therefore cannot be directly applied for efficient bandwid... |

60 | Predictive and adaptive bandwidth reservation for handoffs in QoS-sensitive cellular networks. A CMSIGCOMM Computer Communication Review
- Choi, Shin
- 1998
(Show Context)
Citation Context ...which a mobile will move is predicted in an indoor environment. But this scheme does not estimate channel holding time and therefore cannot be directly applied for efficient bandwidth reservation. In =-=[5], ha-=-ndoff histories of mobile users are observed over time, and the mobile’s movement can be predicted by utilizing this observation. However, in this scheme, prediction of each specific mobile’s move... |

44 |
Probability distribution of channel holding time in cellular telephone systems
- Jedrzycki, Leung
- 1996
(Show Context)
Citation Context ...similar to the call holding time in the fixed telephone network, it is often a fraction of the total call duration in a wireless cellular network and needs not have the same statistical properties [7]=-=[8]-=-. Most research work on CAC and bandwidth reservation assumes the channel holding times in all cells are independent and identically distributed (i.i.d.) according to an exponential distribution [6][1... |

42 |
On the necessity of Occam Algorithms
- Board, Pitt
- 1990
(Show Context)
Citation Context ...ility prediction approach is derived from data compression techniques that are both theoretically optimal and good in practice. Our motivation is recent research work in computational learning theory =-=[3]-=-, which has shown that prediction is synonymous with generalization and data compression. Similar prediction approaches were applied previously to the problems of prefetching in large-scale database s... |

32 |
Smaller cells for greater performance
- Lee
- 1991
(Show Context)
Citation Context ... are available throughout the lifetime of a connection. Thus users may experience performance degradations due to mobile handoffs. This problem will be magnified in future micro/picocellular networks =-=[10], -=-where handoff events may occur at a much higher rate compared to today’s macro-cellular systems. Call admission control (CAC) and bandwidth reservation mechanisms are required to address this proble... |

26 |
A note on the Ziv-Lempel model for compressing individual sequences
- Langdon
- 1983
(Show Context)
Citation Context ...f the last character of xj , using lgα bits, where α is the size of the input sequence’s alphabet. Because of this Prefix Property, the substring parsed so far can be efficiently maintained in a t=-=rie [9]-=-. The equivalent character-based Ziv-Lempel algorithm builds in an on-line fashion a probabilistic model (or a trie) that feeds probability information to an arithmetic coder [22], which encodes a seq... |

25 |
Traffic policies in cellular radio that minimizes blocking of handoff calls
- Posner, Guerin
- 1985
(Show Context)
Citation Context ...s another critical factor for evaluating CAC algorithms. Based on the above considerations, several schemes have recently been proposed for CAC in wireless cellular networks. The guard channel policy =-=[15]-=- and fractional guard channel policy [16] determine the number of guard channels reserved for handoffs by considering just the status of the local cell. Users are assumed uniformly located in any cell... |

24 |
Connection admission control for mobile multipleclass personal communications networks
- Chao, Chen
- 1997
(Show Context)
Citation Context ...7][8]. Most research work on CAC and bandwidth reservation assumes the channel holding times in all cells are independent and identically distributed (i.i.d.) according to an exponential distribution =-=[6]-=-[11][16]. Like the structured models for network topology, i.i.d. exponential distribution simplifies the analyses, but does not give an accurate representation of the real characteristics of cellular... |

19 |
Practical Dictionary Management for Hardware Data Compression
- Bunton, Borriello
- 1992
(Show Context)
Citation Context ...eaches M, or frozen when its size reaches M/2 and a new one is built while the old one is used for prediction. There are also more sophisticated techniques that use least-recently-used (LRU) strategy =-=[4]-=- on the data structure to maintain its size. In our simulations in Section V, We set upper bound 200 bytes to the trie size and use LRU strategy to maintain its size. IV. CALL ADMISSION CONTROL AND BA... |

8 |
LeZi-Update: An information theoretic approach to track mobile users in PCS networks
- Bhattacharya, Das
- 1999
(Show Context)
Citation Context ...data compression. Similar prediction approaches were applied previously to the problems of prefetching in large-scale database system [21] and location management of mobile users in cellular networks =-=[2]-=-. Although the possibility of applying these approaches to QoS provisioning was mentioned in [2], no further development was reported. In this paper, we extend that idea to the context of CAC and band... |

5 | A new mobility model and its application in the channel holding time characterization
- Fang, Chlamtac
- 1999
(Show Context)
Citation Context ...is similar to the call holding time in the fixed telephone network, it is often a fraction of the total call duration in a wireless cellular network and needs not have the same statistical properties =-=[7]-=-[8]. Most research work on CAC and bandwidth reservation assumes the channel holding times in all cells are independent and identically distributed (i.i.d.) according to an exponential distribution [6... |

3 |
On the Ziv-Lempel proof and related topics
- Sheinwald
- 1994
(Show Context)
Citation Context ...pel incremental parsing algorithm achieves for any sequence given to it a compression ratio that is (asymptotically) equal to qx , and thus the algorithm is universal and n ( ) asymptotically optimal =-=[17]-=-. In [1], it has been shown that the code length obtained in the character-based version of the Ziv-Lempel algorithm is as least as good as that obtained using the word-based approach. Hence, the opti... |