An OFDMA resource allocation algorithm based on coalitional games
- PDF / 561,654 Bytes
- 13 Pages / 595.276 x 793.701 pts Page_size
- 13 Downloads / 231 Views
RESEARCH
Open Access
An OFDMA resource allocation algorithm based on coalitional games Farshad Shams1, Giacomo Bacci2* and Marco Luise2
Abstract This work investigates a fair adaptive resource management criterion (in terms of transmit powers and subchannel assignment) for the uplink of an orthogonal frequency-division multiple access network, populated by mobile users with constraints in terms of target data rates. The inherent optimization problem is tackled with the analytical tools of coalitional game theory, and a practical algorithm based on Markov modeling is introduced. The proposed scheme allows the mobile devices to fulfill their rate demands exactly with a minimum utilization of network resources. Simulation results show that the average number of operations of the proposed iterative algorithm are much lower than K · N, where N and K are the number of allocated subcarriers and of mobile terminals. 1. Introduction The advent of high-definition entertainment services justifies the need for wideband, high-capacity wireless communication technologies that use the available bandwidth efficiently and provide data rates close to channel capacity [1]. Multicarrier channel access techniques such as orthogonal frequency-division multiple access (OFDMA) can be exploited to increase data rates, by dividing a frequency-selective broadband channel into a multitude of orthogonal narrowband flat-fading subchannels. An intelligent and scalable joint power and bandwidth allocation mechanism is crucial to ensure the quality of service (QoS) to the consumer at a reasonable cost [2]. The problem of subcarrier and power assignment in OFDMA has been extensively considered in the literature during the last few years. The proposed solutions mainly fall into two different categories: margin-adaptive and rate-adaptive methods. The goal of marginadaptive schemes (such as [3]) is to minimize the total transmit power expenditure to achieve the (minimum) QoS requirements. Algorithms based on the rate-adaptive criterion (such as [4]) aim on the contrary at achieving the maximum data rate subject to different QoS constraints.
* Correspondence: [email protected] 2 Dipartimento di Ingegneria dell’Informazione, University of Pisa, Via G. Caruso, 16, Pisa 56122, Italy Full list of author information is available at the end of the article
Most algorithms focus on the downlink scenario, with constraints on the total power transmitted by the radio base station. In the uplink scenario, the restrictions apply on an individual basis to each user terminal, and the simplest solution to maximize channel capacity of mobile devices under a power constraint is the water filling (WF) criterion [5]. In this case, channel capacity is increased when every subcarrier is assigned to the user with the best path gain, and the power is distributed according to the WF criterion. However, the WF solution is highly unfair, since only users with the best channel gains receive an acceptable channel capacity, while users with bad channel conditions achi
Data Loading...
