By Topic

Utility-based resource allocation in orthogonal frequency division multiple access networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fathi, M. ; Electr. Dept., Amirkabir Univ. of Technol., Tehran, Iran ; Taheri, H.

The authors consider network utility maximisation problem in orthogonal frequency division multiple access (OFDMA) networks to study cross-layer, fair and efficient resource allocation. Assuming knowledge of the instantaneous channel gains, this problem is decomposed into rate control and scheduling problems at the transport and medium access control/physical layers, respectively. In contrast to the rate control problem that is solved using subgradient method, the scheduling problem has high computational complexity owing to optimising integer and continuous variables simultaneously. Based on the results from analysing the integer relaxed scheduling problem, computationally efficient adaptive scheduling (CEAS) and opportunistic time division multiple access (Opp-TDMA) scheduling schemes are proposed to joint subcarrier assignment and power allocation. Simulation results demonstrate that aggregate utility achieved in the network with the cooperation between rate control and proposed scheduling schemes outperforms those of previously proposed joint channel-aware and queue-aware scheduling schemes. Also, through comparison with the optimal solution, the authors conclude that CEAS is applicable for OFDMA real-time scheduling due to low computational complexity and high performance.

Published in:

Communications, IET  (Volume:4 ,  Issue: 12 )