Distributed power control with robust protection for PUs in cognitive radio networks
In cognitive radio networks, it is challenging for secondary users (SUs) to estimate and control their interference at the receivers of primary users (PUs), due to incomplete or erroneous channel information between SUs and PUs. Thus, SUs need to estimate the worst-case aggregate interference at PU...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89509 http://hdl.handle.net/10220/44933 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-89509 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-895092020-03-07T11:49:00Z Distributed power control with robust protection for PUs in cognitive radio networks Gong, Shimin Wang, Ping Duan, Lingjie School of Computer Science and Engineering Cognitive Radio Power Control In cognitive radio networks, it is challenging for secondary users (SUs) to estimate and control their interference at the receivers of primary users (PUs), due to incomplete or erroneous channel information between SUs and PUs. Thus, SUs need to estimate the worst-case aggregate interference at PU receivers to ensure guaranteed protection for PUs from excessive interference. As it is rare that all SU-PU channels experience the worst-case conditions simultaneously, we propose a practical model (namely, the worst-case selective robust model) for SUs to estimate their aggregate interference power. This model employs an adjustable parameter to control the number of SU-PU channels that are in the worst-case conditions. For an individual SU-PU channel, the estimation of worst-case channel gain is subject to a distribution uncertainty. Given this robust model, we study SUs' power control problem in a non-cooperative game where each SU selfishly maximizes its own throughput performance subject to coupled interference constraints at PU receivers. We study the existence and uniqueness of Nash equilibrium and propose an iterative algorithm for SUs to achieve the equilibrium in a distributed manner. Numerical results show that our algorithm provides guaranteed protection for PUs and fair throughput performance for SUs, provided with uncertain SU-PU channel information. MOE (Min. of Education, S’pore) Accepted version 2018-06-01T06:53:44Z 2019-12-06T17:27:17Z 2018-06-01T06:53:44Z 2019-12-06T17:27:17Z 2015 Journal Article Gong, S., Wang, P., & Duan, L. (2015). Distributed power control with robust protection for PUs in cognitive radio networks. IEEE Transactions on Wireless Communications, 14(6), 3247-3258. 1536-1276 https://hdl.handle.net/10356/89509 http://hdl.handle.net/10220/44933 10.1109/TWC.2015.2403357 en IEEE Transactions on Wireless Communications © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TWC.2015.2403357]. 11 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Cognitive Radio Power Control |
spellingShingle |
Cognitive Radio Power Control Gong, Shimin Wang, Ping Duan, Lingjie Distributed power control with robust protection for PUs in cognitive radio networks |
description |
In cognitive radio networks, it is challenging for secondary users (SUs) to estimate and control their interference at the receivers of primary users (PUs), due to incomplete or erroneous channel information between SUs and PUs. Thus, SUs need to estimate the worst-case aggregate interference at PU receivers to ensure guaranteed protection for PUs from excessive interference. As it is rare that all SU-PU channels experience the worst-case conditions simultaneously, we propose a practical model (namely, the worst-case selective robust model) for SUs to estimate their aggregate interference power. This model employs an adjustable parameter to control the number of SU-PU channels that are in the worst-case conditions. For an individual SU-PU channel, the estimation of worst-case channel gain is subject to a distribution uncertainty. Given this robust model, we study SUs' power control problem in a non-cooperative game where each SU selfishly maximizes its own throughput performance subject to coupled interference constraints at PU receivers. We study the existence and uniqueness of Nash equilibrium and propose an iterative algorithm for SUs to achieve the equilibrium in a distributed manner. Numerical results show that our algorithm provides guaranteed protection for PUs and fair throughput performance for SUs, provided with uncertain SU-PU channel information. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Gong, Shimin Wang, Ping Duan, Lingjie |
format |
Article |
author |
Gong, Shimin Wang, Ping Duan, Lingjie |
author_sort |
Gong, Shimin |
title |
Distributed power control with robust protection for PUs in cognitive radio networks |
title_short |
Distributed power control with robust protection for PUs in cognitive radio networks |
title_full |
Distributed power control with robust protection for PUs in cognitive radio networks |
title_fullStr |
Distributed power control with robust protection for PUs in cognitive radio networks |
title_full_unstemmed |
Distributed power control with robust protection for PUs in cognitive radio networks |
title_sort |
distributed power control with robust protection for pus in cognitive radio networks |
publishDate |
2018 |
url |
https://hdl.handle.net/10356/89509 http://hdl.handle.net/10220/44933 |
_version_ |
1681047303974027264 |