Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDu, KL-
dc.contributor.authorSwamy, MNS-
dc.contributor.authorNi, Q-
dc.identifier.citationCCECE '09. Canadian Conference on Electrical and Computer Engineering. St. John's, NL, 3-6 May 2009. pp. 450 - 454.en
dc.description.abstractAbstract—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 waterfilling 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.en
dc.format.extent262287 bytes-
dc.titleA dynamic spectrum access scheme for cognitive radio networksen
dc.typeConference Paperen
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
plugin-getPDF.jsp.pdf256.14 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.