维普中文期刊产品整合服务

Joint optimal sensing time and power allocation for multi-channel cognitive radio networks considering sensing-channel selection

查看全文 作  者:YU [1]HuoGen;TANG [1]WanBin;LI [1]ShaoQian 高影响力作者 机构地区:[1]National Key Laboratory of Science and Technology on Communications,University of Electronic Science and Technology of China高影响力机构 出  处:《Science China(Information Sciences)》索引2014年第57卷第4期,共8页高影响力期刊 基  金:supported in part by High-tech R&D Program of China (863 Program) (Grant Nos. 2009AA011801, 2009AA012002);National Fundamental Research Program of China (Grant No. A1420080150);National Basic Research Program of China (973 Program) (Grant No. 2009CB320405);Nation Grand Special Science and Technology Project of China (Grant Nos. 2008ZX03005-001, 2009ZX03007-004, 2009ZX03005-002, 2009ZX03005004, 2010ZX03006-002);Foundation Project of National Key Laboratory of Science and Technology on Communications and Special Project on Broadband Wireless Access sponsored by Huawei Co., Ltd. 摘  要:In this paper,we consider a multi-channel cognitive radio network(CRN)where each secondary user(SU)can only choose to sense a subset of channels.We formulate a joint optimization problem of sensingchannel selection,sensing time and power allocation under the constraints of average transmit power budget and average interference power budget,which maximizes the CRN’s total throughput.We propose a greedy algorithm to solve the joint optimization problem,which has much less computational complexity.Moreover,it is shown that the search space of the greedy algorithm can be further pruned.Finally,numerical results demonstrate that the greedy algorithm has comparable performance to the exhaustive search algorithm. 关 键 词:无线电网络 通道选择 感应时间 功率分配 传感 多通道 贪心算法 优化问题
相关文献

参考文献(23)

引证文献(3)

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费