Please use this identifier to cite or link to this item: https://doi.org/10.1109/WCNC.2010.5506665
Title: Optimal power allocation for fading cognitive multiple access channels: Individual outage capacity region
Authors: Kang, X. 
Liang, Y.-C.
Garg, H.K. 
Issue Date: 2010
Source: Kang, X.,Liang, Y.-C.,Garg, H.K. (2010). Optimal power allocation for fading cognitive multiple access channels: Individual outage capacity region. IEEE Wireless Communications and Networking Conference, WCNC : -. ScholarBank@NUS Repository. https://doi.org/10.1109/WCNC.2010.5506665
Abstract: This paper is concerned with a spectrum sharing cognitive radio network. In particular, the individual outage capacity region for a M-user fading cognitive multiple access network sharing the same spectrum with an existing primary network is first characterized. The primary network's transmission is assumed to be protected by the interference power constraint. Then, under the interference power constraint and the individual transmit power constraint of each user, the individual outage capacity region is implicitly obtained by characterizing the boundary points on the individual usage probability region for a given rate vector. The optimal power allocation and decoding strategy is then derived by the Lagrange dual decomposition method. It is proved that the optimal decoding strategy is the successive decoding strategy, and the decoding order is determined by dual variables together with the channel fading gains of the primary and secondary links. Finally, several numerical examples are given to validate the proposed studies. ©2010 IEEE.
Source Title: IEEE Wireless Communications and Networking Conference, WCNC
URI: http://scholarbank.nus.edu.sg/handle/10635/71290
ISBN: 9781424463985
ISSN: 15253511
DOI: 10.1109/WCNC.2010.5506665
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

23
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


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