Referenced Items are not available for this document.
In this paper, the dynamic spectrum access problem for cognitive radio (CR) networks is formulated as maximizing the sum channel capacity while satisfying the power budgets of individual secondary user radios as well as the SINR constraints on both the secondary and primary users. By applying the Karush-Kuhn-Tucker theorem, we derive a water-filling soluton. An iterative water-filling algorithm is proposed for implementing joint channel and power allocation in a dynamically changing set of available channels. The proposed algorithm has a complexity that increases linearly with both the number of channels and the number of users.
Published in:
Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on
Date of Conference: 3-6 May 2009
- Page(s):
- 450 - 454
- ISSN :
- 0840-7789
- E-ISBN :
- 978-1-4244-3508-1
- Print ISBN:
- 978-1-4244-3509-8
- INSPEC Accession Number:
- 10719602
- Conference Location :
- St. John's, NL
- Digital Object Identifier :
- 10.1109/CCECE.2009.5090174
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
