Joint scheduling and power allocation in Cognitive Radio systems

Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami
{"title":"Joint scheduling and power allocation in Cognitive Radio systems","authors":"Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami","doi":"10.1109/ICCW.2015.7247212","DOIUrl":null,"url":null,"abstract":"This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"24 1","pages":"399-404"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
认知无线电系统中的联合调度与功率分配
研究了由多个辅助用户(SU)和主用户(PU)组成的认知无线电(CR)网络中的联合频谱调度和功率分配问题。目标是在最低服务质量(QoS)约束、对pu的最大峰值和平均干扰约束下最小化SU系统的总体功耗(在几个正交频带上)。由于频谱调度策略是离散的,所以问题的非凸性是主要的挑战。我们通过考虑一个基于拉格朗日松弛的更简单的凸问题来克服这个问题。结果是,这个问题有离散解它们是初始非凸问题的最优解。我们提出了一种迭代次梯度算法来计算最优解,当它存在时,假设通道是随机绘制的。在对称系统的情况下,该算法不适用。因此,我们研究了这样一个我们给出解析解的情况。文中还提供了几个数值结果,这些结果支持并提供了对解决这一问题的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CI/DS-CDMA scheme for autonomous underwater vehicle communication Optimising OFDM based visible light communication for high throughput and reduced PAPR A channel sensing based design for LTE in unlicensed bands Local and cooperative spectrum sensing via Kuiper's test Delay-aware energy-efficient communications over Nakagami-m fading channel with MMPP traffic
×
引用
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