Title | Fair Allocation of Subcarrier and Power in an OFDMA Wireless Mesh Network |
Publication Type | Journal Article |
Year of Publication | 2006 |
Authors | Lee, K. - D., and V. C. M. Leung |
Journal | Selected Areas in Communications, IEEE Journal on |
Volume | 24 |
Pagination | 2051 -2060 |
Date Published | nov. |
ISSN | 0733-8716 |
Keywords | frequency division multiple access, integer programming, mesh router, Nash bargaining solution fairness criterion, nonlinear mixed integer programming, nonlinear programming, OFDM modulation, OFDMA wireless mesh network, orthogonal frequency-division multiple-access, power allocation, radio networks, scheduling, scheduling scheme, telecommunication network routing, telecommunication network topology, WMN |
Abstract | This paper presents a new fair scheduling scheme for orthogonal frequency-division multiple-access-based wireless mesh networks (WMNs), which fairly allocates subcarriers and power to mesh routers (MRs) and mesh clients to maximize the Nash bargaining solution fairness criterion. In WMNs, since not all the information necessary for scheduling is available at a central scheduler (e.g., MR), it is advantageous to involve the MR and as many mesh clients as possible in distributed scheduling based on the limited information that is available locally at each node. Instead of solving a single global control problem, we hierarchically decouple the subcarrier and power allocation problem into two subproblems, where the MR allocates groups of subcarriers to the mesh clients, and each mesh client allocates transmit power among its subcarriers to each of its outgoing links. We formulate the two subproblems by nonlinear integer programming and nonlinear mixed integer programming, respectively. A simple and efficient solution algorithm is developed for the MR's problem. Also, a closed-form solution is obtained by transforming the mesh client's problem into a time-division scheduling problem. Extensive simulation results demonstrate that the proposed scheme provides fair opportunities to the respective users (mesh clients) and a comparable overall end-to-end rate when the number of mesh clients increases |
URL | http://dx.doi.org/10.1109/JSAC.2006.881628 |
DOI | 10.1109/JSAC.2006.881628 |