Home > Research > Publications & Outputs > A dynamic spectrum access scheme for cognitive ...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

A dynamic spectrum access scheme for cognitive radio networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

A dynamic spectrum access scheme for cognitive radio networks. / Du, K. -L.; Swamy, M. N. S.; Ni, Qiang.
Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on. NEW yORK: IEEE, 2009. p. 450-454.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Du, K-L, Swamy, MNS & Ni, Q 2009, A dynamic spectrum access scheme for cognitive radio networks. in Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on. IEEE, NEW yORK, pp. 450-454, 22nd IEEE Canadian Conference on Electrical and Computer Engineering, St Johns, 3/05/09. https://doi.org/10.1109/CCECE.2009.5090174

APA

Du, K. -L., Swamy, M. N. S., & Ni, Q. (2009). A dynamic spectrum access scheme for cognitive radio networks. In Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on (pp. 450-454). IEEE. https://doi.org/10.1109/CCECE.2009.5090174

Vancouver

Du K-L, Swamy MNS, Ni Q. A dynamic spectrum access scheme for cognitive radio networks. In Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on. NEW yORK: IEEE. 2009. p. 450-454 doi: 10.1109/CCECE.2009.5090174

Author

Du, K. -L. ; Swamy, M. N. S. ; Ni, Qiang. / A dynamic spectrum access scheme for cognitive radio networks. Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on. NEW yORK : IEEE, 2009. pp. 450-454

Bibtex

@inproceedings{dd05bab1018744868cf0cff5903da594,
title = "A dynamic spectrum access scheme for cognitive radio networks",
abstract = "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.",
author = "Du, {K. -L.} and Swamy, {M. N. S.} and Qiang Ni",
year = "2009",
doi = "10.1109/CCECE.2009.5090174",
language = "English",
isbn = "978-1-4244-3509-8",
pages = "450--454",
booktitle = "Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on",
publisher = "IEEE",
note = "22nd IEEE Canadian Conference on Electrical and Computer Engineering ; Conference date: 03-05-2009 Through 06-05-2009",

}

RIS

TY - GEN

T1 - A dynamic spectrum access scheme for cognitive radio networks

AU - Du, K. -L.

AU - Swamy, M. N. S.

AU - Ni, Qiang

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1109/CCECE.2009.5090174

DO - 10.1109/CCECE.2009.5090174

M3 - Conference contribution/Paper

SN - 978-1-4244-3509-8

SP - 450

EP - 454

BT - Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on

PB - IEEE

CY - NEW yORK

T2 - 22nd IEEE Canadian Conference on Electrical and Computer Engineering

Y2 - 3 May 2009 through 6 May 2009

ER -