By Topic

Utility-Based Scheduling Algorithm for Multiple Services in OFDM Cognitive Radio 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
$33 $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

5 Author(s)
Qiongyao Li ; State Key Lab. of Inf. Photonics & Opt. Commun., Beijing Univ. of Posts & Telecommun., Beijing, China ; Pengfei Lu ; Zhongyuan Yu ; Shijia Ma
more authors

In this paper, the utility-based resource allocation algorithms for the secondary users (SU) supporting heterogeneous services in orthogonal frequency division multiplexing (OFDM)-based cognitive radio cellular networks (CogCells) are studied. Two kinds of users are considered: best-effort-only service users and multiple services users. According to the convex optimization theory, the Lagrangian dual method is proposed, in which the joint subcarrier assignment and power allocation are performed to achieve the optimal solution. To simplify the computation complexity, a low complexity dynamic subcarrier allocation algorithm, named Max Utility for Multiple Services on Cognitive Radio (CR-MUMS), is formulated to extend the non-linear integer optimization to a continuous convex optimization. Final simulation results illustrate that the proposed algorithm with low computational complexity provides better optimal performance than Modified Largest Weighted Delay First (M-LWDF) and Proportional Fair (PF) algorithms.

Published in:

Vehicular Technology Conference (VTC Spring), 2012 IEEE 75th

Date of Conference:

6-9 May 2012