Bandwidth Reservation Policy for Cellular Networks Using Geographical Information 


Vol. 31,  No. 10, pp. 891-899, Oct.  2006


PDF
  Abstract

Generally, a geographical area consists of many regions called cells in wireless networks. Each mobile host(MH) in a cell communicates with a base station(BS) located in the center of the cell. The BSs are connected to each other by a static wired network. Since users are expected to move around during communication sessions, one of the most important QoS factors is related to the handoff. But, the handoff could fail due to unavailability of sufficient bandwidth in the next cell. As the individual cell size gradually shrinks to accommodate increasing the number of MHs, the probability of successful handoffs can be dropped. In this paper, we suppose a bandwidth reservation method to guarantee MHs against connection failure in case of frequent handoffs. This method predicts the mobility based on the geographical information and assigns the bandwidth reservation in proportion to the speed of MHs' motion. As a result, we can expect more exact moving path of MH and to reduce the waste of bandwidth.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Yu, C. Y. Park, J. Park, "Bandwidth Reservation Policy for Cellular Networks Using Geographical Information," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 10, pp. 891-899, 2006. DOI: .

[ACM Style]

Jae-bong Yu, Chan Young Park, and Joon-seok Park. 2006. Bandwidth Reservation Policy for Cellular Networks Using Geographical Information. The Journal of Korean Institute of Communications and Information Sciences, 31, 10, (2006), 891-899. DOI: .

[KICS Style]

Jae-bong Yu, Chan Young Park, Joon-seok Park, "Bandwidth Reservation Policy for Cellular Networks Using Geographical Information," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 10, pp. 891-899, 10. 2006.