By Topic

Algorithms for optimal resource allocation in heterogeneous 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
$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

4 Author(s)
Lei Wang ; Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China ; Wenjun Xu ; Zhiqiang He ; Jiaru Lin

In this paper, the problem of resource allocation in heterogeneous cognitive radio networks is investigated under the constraints of interference temperature limit. The resource allocation problem is formulated as a mixed-integer programming problem and solved by Lagrangian dual method based on which a centralized subgradient update algorithm is proposed. The approximate optimality of this algorithm is promised by time-sharing condition. We also realize this centralized algorithm distributively following the implication of dual decomposition. Two algorithms are compared in terms of complexity, communication signaling, latency etc.. At last, simulations are carried out to validate the proposed algorithms.

Published in:

Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on  (Volume:2 )

Date of Conference:

19-20 Dec. 2009