Optimal power allocation in cognitive networks using non-orthogonal AF relays

Mahmoud Elsaadany
{"title":"Optimal power allocation in cognitive networks using non-orthogonal AF relays","authors":"Mahmoud Elsaadany","doi":"10.1109/LCN.2014.6925804","DOIUrl":null,"url":null,"abstract":"Underlay cognitive networks are being promoted as an implementable solution for the congestion in the wireless spectrum. With some nodes employed as relays, the throughput of such networks is enhanced through cooperative gains. In this paper, we address the problem of maximizing the throughput of an underlay cognitive network through optimal power allocation of non-orthogonal amplify-and-forward relays. In order to maintain stable communication at the primary network, the interference due to the activities of all the cognitive nodes is kept below a limit. The optimal power allocation problem is formulated and then transformed to a quadratically constrained quadratic problem (QCQP). The maximum throughput of the cognitive network is derived as an eigen-solution of a channel-dependent matrix and the corresponding signal-to-noise ratio (SNR) is shown to be the dominant eigenvalue of this matrix. The proposed power allocation achieves significant throughput improvement over equal power allocation scheme and opportunistic relay selection scheme.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"39th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2014.6925804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Underlay cognitive networks are being promoted as an implementable solution for the congestion in the wireless spectrum. With some nodes employed as relays, the throughput of such networks is enhanced through cooperative gains. In this paper, we address the problem of maximizing the throughput of an underlay cognitive network through optimal power allocation of non-orthogonal amplify-and-forward relays. In order to maintain stable communication at the primary network, the interference due to the activities of all the cognitive nodes is kept below a limit. The optimal power allocation problem is formulated and then transformed to a quadratically constrained quadratic problem (QCQP). The maximum throughput of the cognitive network is derived as an eigen-solution of a channel-dependent matrix and the corresponding signal-to-noise ratio (SNR) is shown to be the dominant eigenvalue of this matrix. The proposed power allocation achieves significant throughput improvement over equal power allocation scheme and opportunistic relay selection scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于非正交自动对焦中继的认知网络最优功率分配
底层认知网络作为解决无线频谱拥塞的一种可行的解决方案正在得到推广。利用一些节点作为中继,这种网络的吞吐量通过协作增益得到提高。在本文中,我们通过优化非正交放大转发中继的功率分配来解决底层认知网络吞吐量最大化的问题。为了在主网络中保持稳定的通信,所有认知节点的活动所造成的干扰都被控制在一定的限度以下。将最优功率分配问题转化为二次约束问题(QCQP)。认知网络的最大吞吐量推导为信道依赖矩阵的特征解,相应的信噪比(SNR)被证明是该矩阵的主导特征值。该功率分配方案比等功率分配方案和机会中继选择方案的吞吐量有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Inbound interdomain traffic engineering with LISP Delay tolerant handover for heterogeneous networks An approximation to rate-equalization fairness with logarithmic complexity for QoS Reducing MANET neighborhood discovery overhead WaP: Indoor localization and tracking using WiFi-Assisted Particle filter
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1