Blotto game-based low-complexity fair multiuser subcarrier allocation for uplink OFDMA networks

  • PDF / 545,695 Bytes
  • 14 Pages / 595.28 x 793.7 pts Page_size
  • 72 Downloads / 178 Views

DOWNLOAD

REPORT


RESEARCH

Open Access

Blotto game-based low-complexity fair multiuser subcarrier allocation for uplink OFDMA networks Chee Keong Tan*, Moh Lim Sim, Teong Chee Chuah and Su Wei Tan

Abstract This article presents a subcarrier allocation scheme based on a Blotto game (SABG) for orthogonal frequencydivision multiple access (OFDMA) networks where correlation between adjacent subcarriers is considered. In the proposed game, users simultaneously compete for subcarriers using a limited budget. In order to win as many good subcarriers as possible in this game, users are required to wisely allocate their budget. Efficient power and budget allocation strategies are derived for users for obtaining optimal throughput. By manipulating the total budget available for each user, competitive fairness can be enforced for the SABG. In addition, the conditions to ensure the existence and uniqueness of Nash equilibrium (NE) for the SABG are also established. An lowcomplexity algorithm that ensures convergence to NE is proposed. Simulation results show that the proposed lowcomplexity SABG can allocate resources fairly and efficiently for both uncorrelated and correlated fading channels. Keywords: OFDMA, subcarrier allocation, Blotto game, fairness, efficiency, complexity; correlated fading

1. Introduction The need for more efficient spectrum utilization techniques in wireless networks is becoming increasingly important as the number of users continues to grow rapidly while the radio spectrum remains a scarce resource. Among the emerging broadband wireless access technologies, orthogonal frequency-division multiple access (OFDMA) is a promising technique for efficient utilization of the available spectrum. Owing to its several attractive features, OFDMA has been envisaged for possible implementation in future-generation wireless networks, e.g., 3GPP-long term evolution [1], cognitive radio networks [2], and IEEE 802.20 mobile broadband wireless access [3]. By exploiting multiuser diversity, efficient subcarrier allocation (SA) mechanism can be designed to ensure quality of service provisioning of multimedia services in OFDMA systems. Some recent studies on SA schemes have been reported in [4-7]. Nevertheless, most of the aforementioned SA schemes focus on throughput maximization and/or transmit power reduction subject to some constraints. The fairness issue, however, has largely been ignored. The deployment of such schemes naturally gives rise to the following problem: users with better * Correspondence: [email protected] Faculty of Engineering, Multimedia University, Jalan Multimedia, 63100 Cyberjaya, Selangor, Malaysia

channel conditions always dominate usage of resources, causing low throughput for users with poor channel conditions. Thus, the max-min fairness criterion is used in [8] to maximize the throughput of users with poor channel conditions, but this approach results in severe spectrum inefficiency. To resolve this conflict, Nash bargaining solution (NBS) [9] is applied where the system performance is maximized subject to