Cart (Loading....) | Create Account
Close category search window
 

Throughput Optimization of 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

3 Author(s)

In this paper, we study the problem of finding the maximum throughput achievable by secondary users while primary users are guaranteed to achieve the minimum required data rates. We assume that node positions and channel side informations are available, and a virtual central unit is in responsible for scheduling both primary and secondary users. The optimal solution provides a theoretical upper bound of throughput for cognitive radio networks. An iterative algorithm proposed in [1] was extended to solve the throughput optimization problem, which can be decomposed into sub-problems and solved iteratively. However, due to the NP-hardness of Maximum Weighted Independent Set (MWIS) problem which has to be solved at each iteration, some greedy approximation method with polynomial computation time is applied in the iterative algorithm. Finally, we derive a theoretical upper bound for the distance between the greedy solution and the optimal solution, and guarantee that the optimal solution must be within this upper bound of the greedy solution. Numerical results are given to validate the solution.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.