By Topic

Low complexity utility-based scheduling algorithm for heterogeneous services in OFDM Wireless 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 $13
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

3 Author(s)
Xiaoyan Huang ; Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Yu-ming Mao ; Fan Wu

In this paper, we concentrated on resource allocation for heterogeneous traffic in OFDM wireless networks. We considered three types of traffic, i.e. hard QoS, soft QoS and best effort (BE), the characteristics of which can be described by three different utility functions. We proposed a utility-based cross-layer resource scheduling model, which performs combinational-optimization adaptive resources allocation. At first, the scheduling model is formulated as a non-linear integer programming problem with the objective of maximization total utility, constrained to the CCI restriction and the quality-of-service requirement of QoS traffic. And then, it's transformed into a continue relaxing convex programming problem and solved. Based on the optimal relaxing solution, a low complexity dynamic subcarrier allocation algorithm, namely MHSU algorithm, is provided. Simulation results demonstrate that our scheduling algorithm guarantees a good performance of supporting heterogeneous services, and the system utility value obtained by MHSU algorithm is very close to the optimal value.

Published in:

Communications, Circuits and Systems, 2009. ICCCAS 2009. International Conference on

Date of Conference:

23-25 July 2009