Agent Based Approach for Radio Resource Optimization for Cellular Networks
01 Jan 2011-Communications in computer and information science (Springer, Berlin, Heidelberg)-pp 95-104
TL;DR: This paper presents an agent based distributed scheme for efficient management of radio resources in cellular networks such that QoS is assured for every transaction and would perform better in terms of call blocking probability.
Abstract: Wireless cellular networks are used for data services like browsing, streaming, and conferencing The increased demand for guaranteed service performance as well as for higher resources as required for bandwidth thirsty applications demand for an efficient call admission control mechanism Most of the existing solutions targeting to meet this dipole demand follow either a predictive mechanism or some statistical approach Predictive solutions require extensive computational load over switching centers Further, the efficiency of solution depends on the degree of accuracy of the prediction On the contrary, statistical approaches reduce the overhead to some extent through distributed mechanism However, it needs synchronization among participating components This paper presents an agent based distributed scheme for efficient management of radio resources in cellular networks such that QoS is assured for every transaction Agents coupled to network components, like Radio Resource Manager, actively participate in network resource management In the perspective of call admission control, agents facilitate proactive and reactive capturing requirement of each application’s bandwidth Agents also anticipate the resource requirement continually and optimize allocation of resources with fairness among the contending user applications Besides, the proposed solution does not require any additional infrastructural and would perform better in terms of call blocking probability
References
More filters
[...]
TL;DR: A traffic model and analysis for cellular mobile radio telephone systems with handoff, which shows, for example, blocking probability, forced termination probability, and fraction of new calls not completed, as functions of pertinent system parameters.
Abstract: A traffic model and analysis for cellular mobile radio telephone systems with handoff are described. Three schemes for call traffic handling are considered. One is nonprioritized and two are priority oriented. Fixed channel assignment is considered. In the nonprioritized scheme the base stations make no distinction between new call attempts and handoff attempts. Attempts which find all channels occupied are cleared. In the first priority scheme considered, a fixed number of channels in each cell are reserved exclusively for handoff calls. The second priority scheme employs a similar channel assignment strategy, but, additionally, the queueing of handoff attempts is allowed. Appropriate analytical models and criteria are developed and used to derive performance characteristics. These show, for example, blocking probability, forced termination probability, and fraction of new calls not completed, as functions of pertinent system parameters. General formulas are given and specific numerical results for nominal system parameters are presented.
1,650 citations
[...]
TL;DR: It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.
Abstract: In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.
453 citations
[...]
TL;DR: A novel dynamic guard channel scheme is proposed which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoffs call blocking probability close to the targeted objective.
Abstract: In future personal communications networks (PCNs) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks reduces handoff call blocking probability substantially at the expense of slight increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. While the effectiveness of a fixed number of guard channels has been demonstrated under stationary traffic conditions, with nonstationary call arrival rates in a practical system, the achieved handoff call blocking probability may deviate significantly from the desired objective. We propose a novel dynamic guard channel scheme which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff call blocking probability close to the targeted objective while constraining the new call blocking probability to be below a given level. The proposed scheme is applicable to channel allocation over cellular mobile networks, and is extended to bandwidth allocation over the backbone network to enable a unified approach to prioritized call admission control over the ATM-based PCN.
213 citations
[...]
TL;DR: A novel, rate-based, borrowing scheme for QoS provisioning in high-speed cellular networks carrying multimedia traffic that outperforms the best previously known schemes in terms of call dropping probability, call blocking probability, and bandwidth utilization.
Abstract: Now that cellular networks are being called upon to support real-time interactive multimedia traffic such as video teleconferencing, these networks must be able to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts, scarcity of bandwidth, and channel fading make QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The management of such adaptive multimedia applications is becoming a new research area in wireless networks. As it turns out, the additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in the QoS parameters can be exploited by protocol designers to significantly improve the overall performance of wireless systems. The main contribution of this paper is to propose a novel, rate-based, borrowing scheme for QoS provisioning in high-speed cellular networks carrying multimedia traffic. Our scheme attempts to allocate the desired bandwidth to every multimedia connection originating in a cell or being handed off to the cell. The novelty of our scheme is that, in case of insufficient bandwidth, in order not to deny service to requesting connections (new or hand-off), bandwidth will be borrowed, on a temporary basis, from existing connections. Our borrowing scheme guarantees that no connection gives up more than its fair share of bandwidth, in the sense that the amount of bandwidth borrowed from a connection is proportional to its tolerance to bandwidth loss. Importantly, our scheme ensures that the borrowed bandwidth is promptly returned to the degraded connections. Extensive simulation results show that our rate-based QoS provisioning scheme outperforms the best previously known schemes in terms of call dropping probability, call blocking probability, and bandwidth utilization.
159 citations
[...]
TL;DR: A survey of admission control schemes for cellular networks and the research in this area, including those designed for multi-service networks and hierarchical systems as well as complete knowledge schemes and those using pricing for CAC.
Abstract: Call admission control (CAC) is a key element in the provision of guaranteed quality of service (QoS) in wireless networks. The design of CAC algorithms for mobile cellular networks is especially challenging given the limited and highly variable resources, and the mobility of users encountered in such networks. This article provides a survey of admission control schemes for cellular networks and the research in this area. Our goal is to provide a broad classification and thorough discussion of existing CAC schemes. We classify these schemes based on factors such as deterministic/stochastic guarantees, distributed/local control and adaptivity to traffic conditions. In addition to this, we present some modeling and analysis basics to help in better understanding the performance and efficiency of admission control schemes in cellular networks. We describe several admission control schemes and compare them in terms of performance and complexity. Handoff prioritization is the common characteristic of these schemes. We survey different approaches proposed for achieving handoff prioritization with a focus on reservation schemes. Moreover, optimal and near-optimal reservation schemes are presented and discussed. Also, we overview other important schemes such as those designed for multi-service networks and hierarchical systems as well as complete knowledge schemes and those using pricing for CAC. Finally, the paper concludes on the state of current research and points out some of the key issues that need to be addressed in the context of CAC for future cellular networks. Copyright © 2005 John Wiley & Sons, Ltd.
150 citations
Related Papers (5)
[...]
[...]
[...]
[...]