Robust resource allocation for cognitive relay networks with multiple primary users
Abstract A robust resource allocation (RA) algorithm for cognitive relay networks with multiple primary users considering joint channel uncertainty and interference uncertainty is proposed to maximize the capacity of the networks subject to the interference threshold limitations of primary users’ re...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-06-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13638-017-0893-4 |
id |
doaj-67c75813b1c5484fb97fb11deafd0a66 |
---|---|
record_format |
Article |
spelling |
doaj-67c75813b1c5484fb97fb11deafd0a662020-11-25T02:20:28ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992017-06-012017111110.1186/s13638-017-0893-4Robust resource allocation for cognitive relay networks with multiple primary usersWeiwei Yang0Xiaohui Zhao1College of Communication Engineering, Jilin UniversityCollege of Communication Engineering, Jilin UniversityAbstract A robust resource allocation (RA) algorithm for cognitive relay networks with multiple primary users considering joint channel uncertainty and interference uncertainty is proposed to maximize the capacity of the networks subject to the interference threshold limitations of primary users’ receivers (PU-RXs) and the total power constraint of secondary user’s transmitter and relays. Ellipsoid set and interval set are adopted to describe the uncertainty parameters. The robust relay selection and power allocation problems are separately formulated as semi-infinite programming (SIP) problems. With the worst-case approach, the SIP problems are transformed into equivalent convex optimization problems and solved by Lagrange dual decomposition method. Numerical results show the impact of channel uncertainties and validation of the proposed robust algorithm for strict guarantee the interference threshold requirements at different PU-RXs.http://link.springer.com/article/10.1186/s13638-017-0893-4Cognitive relay networksRobust resource allocationChannel and interference uncertaintyWorst-case approachLagrange dual decomposition method |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Weiwei Yang Xiaohui Zhao |
spellingShingle |
Weiwei Yang Xiaohui Zhao Robust resource allocation for cognitive relay networks with multiple primary users EURASIP Journal on Wireless Communications and Networking Cognitive relay networks Robust resource allocation Channel and interference uncertainty Worst-case approach Lagrange dual decomposition method |
author_facet |
Weiwei Yang Xiaohui Zhao |
author_sort |
Weiwei Yang |
title |
Robust resource allocation for cognitive relay networks with multiple primary users |
title_short |
Robust resource allocation for cognitive relay networks with multiple primary users |
title_full |
Robust resource allocation for cognitive relay networks with multiple primary users |
title_fullStr |
Robust resource allocation for cognitive relay networks with multiple primary users |
title_full_unstemmed |
Robust resource allocation for cognitive relay networks with multiple primary users |
title_sort |
robust resource allocation for cognitive relay networks with multiple primary users |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1499 |
publishDate |
2017-06-01 |
description |
Abstract A robust resource allocation (RA) algorithm for cognitive relay networks with multiple primary users considering joint channel uncertainty and interference uncertainty is proposed to maximize the capacity of the networks subject to the interference threshold limitations of primary users’ receivers (PU-RXs) and the total power constraint of secondary user’s transmitter and relays. Ellipsoid set and interval set are adopted to describe the uncertainty parameters. The robust relay selection and power allocation problems are separately formulated as semi-infinite programming (SIP) problems. With the worst-case approach, the SIP problems are transformed into equivalent convex optimization problems and solved by Lagrange dual decomposition method. Numerical results show the impact of channel uncertainties and validation of the proposed robust algorithm for strict guarantee the interference threshold requirements at different PU-RXs. |
topic |
Cognitive relay networks Robust resource allocation Channel and interference uncertainty Worst-case approach Lagrange dual decomposition method |
url |
http://link.springer.com/article/10.1186/s13638-017-0893-4 |
work_keys_str_mv |
AT weiweiyang robustresourceallocationforcognitiverelaynetworkswithmultipleprimaryusers AT xiaohuizhao robustresourceallocationforcognitiverelaynetworkswithmultipleprimaryusers |
_version_ |
1724871100339322880 |