An adaptive hierarchical scheme for bandwidth allocation in cellular networks
10 Dec 2002-Vol. 5, pp 2441-2445
TL;DR: This work proposes a bandwidth allocation scheme for cellular networks that copes with user mobility, and constructs, for each user, hierarchical clusters (HCs), which are tree-like structures having sub-clusters of cells as nodes.
Abstract: The proliferation of wireless networks has led to a demand for providing bandwidth guarantees to mobile users that are comparable to the ones received by users in fixed networks. Error-prone communication links and user mobility make this a challenging task. We propose a bandwidth allocation scheme for cellular networks that copes with user mobility. Our proposed scheme constructs, for each user, hierarchical clusters (HCs) which are tree-like structures having sub-clusters of cells as nodes. The HC of any user represents the cells that he is expected to visit during the lifetime of his call. Bandwidth is reserved in all cells of the HC thereby providing an estimation of future resource availability. Such estimates are used to determine the feasibility of admitting new calls. In constructing HCs, we use the velocity of the user and available data on user movement. Our scheme is adaptive since it works with any amount of available data. Results of simulations are provided to demonstrate the performance obtained using our proposed scheme.
Citations
More filters
Proceedings Article•
16 Feb 2007
TL;DR: The GPS based handover mechanism which will reserve bandwidth in one cell and unnecessary reservations at many neighboring cells are avoided and dropping probability of handover calls is reduced to minimum and blocking probability of new calls is also maintained to minimum.
Abstract: In order to meet the ever increase in users' demand, and to accommodate more number of users, the cell size in mobile wireless cellular networks is being reduced Because of that bandwidth in each cell has become limited Due to decrease of cell size more number of handovers takes place If bandwidth allocation to these handover calls is not done properly then dropping probability of handover calls will be increased Also if sufficient bandwidth is not available to new calls, then blocking probability for newly generated calls will be increased Dropping of handover calls is less desirable than blocking of new calls Many schemes have been proposed to solve the problem in resource allocation Presently available solutions are not enough to provide and maintain QOS (Quality of Service) for multimedia handover calls
In this paper we propose the GPS based handover mechanism which will reserve bandwidth in one cell and unnecessary reservations at many neighboring cells are avoided Also we propose bandwidth reservation and allocation to handover calls using sliding bandwidth window method In this method, bandwidth window size will change according to network traffic conditions and it is maintained flexible in changing its size Based upon the expected number of handover calls, the window size changes its capacity, so that more number of handover calls can be accommodated In order to maintain QOS (Quality of Service) for multimedia handover calls, our focus, in this paper, is to allocate required bandwidth to this call For lower priority handover call (data call), at least minimum bandwidth will be allocated in worst case scenario In the mean time, we maintain the balance with locally generated calls in allocation of bandwidth In this method dropping probability of handover calls is reduced to minimum and blocking probability of new calls is also maintained to minimum
1 citations
Cites background from "An adaptive hierarchical scheme for..."
...2003, Volume: 2, On page(s): 1273- 1277 [6] Sridhar Machraju and Siva Ram murthy, An Adaptive Hirarchical Scheme for Bandwidth Allocation in Cellular Networks, Proceedings...
[...]
References
More filters
TL;DR: This article provides a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes, and other important issues in resource allocation such as overlay cells, frequency planning, and power control.
Abstract: This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.
1,273 citations
TL;DR: This paper proposes a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment and can tolerate a high degree of information imprecision.
Abstract: In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision.
878 citations
TL;DR: In this article, the authors provide a detailed discussion of wireless resource and channel allocation schemes and compare their trade-offs in terms of complexity and performance, and discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.
Abstract: This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed⁄centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.
742 citations
TL;DR: The fundamental technical challenges and business motivations behind wireless position location systems are described, and promising techniques for solving the practical position location problem are treated.
Abstract: With the advances in wireless communications and low-power electronics, accurate position location may now be accomplished by a number of techniques which involve commercial wireless services. Emerging position location systems, when used in conjunction with mobile communications services, will lead to enhanced public safety and revolutionary products and services. The fundamental technical challenges and business motivations behind wireless position location systems are described, and promising techniques for solving the practical position location problem are treated.
673 citations
TL;DR: A call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable "dropping probability" being requested.
Abstract: The shadow cluster concept can be used to estimate future resource requirements and to perform call admission decisions in wireless networks. Shadow clusters can be used to decide if a new call can be admitted to a wireless network based on its quality-of-service (QoS) requirements and local traffic conditions. The shadow cluster concept can especially be useful in future wireless networks with microcellular architectures where service will be provided to users with diverse QoS requirements. The framework of a shadow cluster system is completely distributed, and can be viewed as a message system where mobile terminals inform the base stations in their neighborhood about their requirements, position, and movement parameters. With this information, base stations predict future demands, reserve resources accordingly, and admit only those mobile terminals which can be supported adequately. The shadow cluster concept involves some processing and communication overheads. These overheads have no effect on wireless resources, but only on the base stations and the underlying wireline network. It is shown how base stations determine the probabilities that a mobile terminal will be active in other cells at future times, define and maintain shadow clusters by using probabilistic information on the future position of their mobile terminals with active calls, and predict resource demands based on shadow cluster information. In addition, a call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable "dropping probability" being requested. Performance results showing the advantages of the shadow cluster concept are also included.
653 citations
"An adaptive hierarchical scheme for..." refers background or methods in this paper
...This may not be as comprehensive and well defined as assumed in [3] or non-existent as assumed in [1]....
[...]
...The schemes proposed in [1] and [3] consider users in nonadjacent cells....
[...]
...The motivation behind our proposed scheme is largely drawn from the Shadow Cluster (SC) scheme proposed in [3] and the Most Likely Cluster (MLC) scheme proposed in [1]....
[...]
...Several such schemes have been proposed in [1], [3], [5] and [6]....
[...]