底层认知无线网络中的资源选择匹配算法

Jiangjingxian Chen, Zhipei Zhu, Shibing Zhang
{"title":"底层认知无线网络中的资源选择匹配算法","authors":"Jiangjingxian Chen, Zhipei Zhu, Shibing Zhang","doi":"10.1117/12.2288323","DOIUrl":null,"url":null,"abstract":"In this paper, the resource allocation in an underlay cognitive radio network is considered, in which the SUs can operate on the same spectrum band with the primary users simultaneously. In order to maximize the total throughput of SUs, an optimal selection matching (OSM) algorithm is proposed to allocate the resource in the underlay cognitive radio network. It makes every SU find the satisfied spectrum resource, and meanwhile the interference from SUs is induced. Simulation results show that the proposed algorithm has the significant improvement in total throughput compared with others.","PeriodicalId":415022,"journal":{"name":"International Conference on Wireless and Optical Communications","volume":"254 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource selection matching algorithm in underlay cognitive radio networks\",\"authors\":\"Jiangjingxian Chen, Zhipei Zhu, Shibing Zhang\",\"doi\":\"10.1117/12.2288323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the resource allocation in an underlay cognitive radio network is considered, in which the SUs can operate on the same spectrum band with the primary users simultaneously. In order to maximize the total throughput of SUs, an optimal selection matching (OSM) algorithm is proposed to allocate the resource in the underlay cognitive radio network. It makes every SU find the satisfied spectrum resource, and meanwhile the interference from SUs is induced. Simulation results show that the proposed algorithm has the significant improvement in total throughput compared with others.\",\"PeriodicalId\":415022,\"journal\":{\"name\":\"International Conference on Wireless and Optical Communications\",\"volume\":\"254 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Wireless and Optical Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2288323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Wireless and Optical Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2288323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了底层认知无线电网络中的资源分配问题,在这种网络中,单元可以与主用户同时在同一频段上工作。为了使单元的总吞吐量最大化,提出了一种最优选择匹配(OSM)算法来分配底层认知无线网络中的资源。它使每个单元都能找到满意的频谱资源,同时也能诱导来自单元的干扰。仿真结果表明,与其他算法相比,该算法在总吞吐量方面有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource selection matching algorithm in underlay cognitive radio networks
In this paper, the resource allocation in an underlay cognitive radio network is considered, in which the SUs can operate on the same spectrum band with the primary users simultaneously. In order to maximize the total throughput of SUs, an optimal selection matching (OSM) algorithm is proposed to allocate the resource in the underlay cognitive radio network. It makes every SU find the satisfied spectrum resource, and meanwhile the interference from SUs is induced. Simulation results show that the proposed algorithm has the significant improvement in total throughput compared with others.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信