协同认知无线网络优化模型及网络参数优化算法

T. Zhang
{"title":"协同认知无线网络优化模型及网络参数优化算法","authors":"T. Zhang","doi":"10.1155/2023/3748089","DOIUrl":null,"url":null,"abstract":"In recent years, the combination of cognitive radio and collaborative communication has been widely studied and applied because of its ability to increase user throughput and improve spectrum utilization in a flat-fading wireless channel environment. Such cognitive radio networks that use user collaboration to improve channel capacity and spectrum utilization are called collaborative cognitive radio networks. A Nash equilibrium game-based relay node selection algorithm is investigated, which aims to maximize the utility function of primary and cognitive users. Secondly, a Stackelberg game is introduced, which aims to select the better set of nodes to achieve spectrum sharing. Simulation results show that the algorithm proposed in the study maximizes the utility functions of both primary and cognitive users and enables the selection of a better set of nodes for spectrum sharing. Specifically, the Nash equilibrium game-based relay node selection algorithm at \n \n c\n \n  = 0.3 \n \n \n \n ∗\n \n \n  10−6 results in better utility values for both PU and CU, and the algorithm enables more CU to access the spectrum so that users can get longer access time. The relay node selection algorithm based on the Stackelberg game demonstrates high feasibility. Under the condition of parameter \n \n α\n =\n \n \n α\n \n ∗\n \n \n , the algorithm can achieve high-quality cooperation, and CU in better positions can be used as relay cooperation nodes. The algorithm can improve the main user utility function by 20%–35%.","PeriodicalId":23352,"journal":{"name":"Turkish J. Electr. Eng. Comput. Sci.","volume":"1 1","pages":"3748089:1-3748089:11"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Collaborative Cognitive Wireless Network Optimization Model and Network Parameter Optimization Algorithm\",\"authors\":\"T. Zhang\",\"doi\":\"10.1155/2023/3748089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, the combination of cognitive radio and collaborative communication has been widely studied and applied because of its ability to increase user throughput and improve spectrum utilization in a flat-fading wireless channel environment. Such cognitive radio networks that use user collaboration to improve channel capacity and spectrum utilization are called collaborative cognitive radio networks. A Nash equilibrium game-based relay node selection algorithm is investigated, which aims to maximize the utility function of primary and cognitive users. Secondly, a Stackelberg game is introduced, which aims to select the better set of nodes to achieve spectrum sharing. Simulation results show that the algorithm proposed in the study maximizes the utility functions of both primary and cognitive users and enables the selection of a better set of nodes for spectrum sharing. Specifically, the Nash equilibrium game-based relay node selection algorithm at \\n \\n c\\n \\n  = 0.3 \\n \\n \\n \\n ∗\\n \\n \\n  10−6 results in better utility values for both PU and CU, and the algorithm enables more CU to access the spectrum so that users can get longer access time. The relay node selection algorithm based on the Stackelberg game demonstrates high feasibility. Under the condition of parameter \\n \\n α\\n =\\n \\n \\n α\\n \\n ∗\\n \\n \\n , the algorithm can achieve high-quality cooperation, and CU in better positions can be used as relay cooperation nodes. The algorithm can improve the main user utility function by 20%–35%.\",\"PeriodicalId\":23352,\"journal\":{\"name\":\"Turkish J. Electr. Eng. Comput. Sci.\",\"volume\":\"1 1\",\"pages\":\"3748089:1-3748089:11\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Turkish J. Electr. Eng. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2023/3748089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Turkish J. Electr. Eng. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2023/3748089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,认知无线电与协同通信的结合由于能够在平坦衰落的无线信道环境中提高用户吞吐量和频谱利用率而得到了广泛的研究和应用。这种利用用户协作来提高信道容量和频谱利用率的认知无线网络被称为协作认知无线网络。以初级用户和认知用户的效用函数最大化为目标,研究了一种基于纳什均衡博弈的中继节点选择算法。其次,引入Stackelberg博弈,选择较好的节点集实现频谱共享;仿真结果表明,本文提出的算法最大限度地提高了初级用户和认知用户的效用函数,能够选择更好的节点集进行频谱共享。具体而言,在c = 0.3∗10−6时,基于纳什均衡博弈的中继节点选择算法对PU和CU都有更好的效用值,并且该算法使更多的CU可以访问频谱,从而使用户可以获得更长的访问时间。基于Stackelberg博弈的中继节点选择算法具有较高的可行性。在参数α = α *的条件下,该算法可以实现高质量的合作,并且位置较好的CU可以作为中继合作节点。该算法可将主要用户效用函数提高20% ~ 35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collaborative Cognitive Wireless Network Optimization Model and Network Parameter Optimization Algorithm
In recent years, the combination of cognitive radio and collaborative communication has been widely studied and applied because of its ability to increase user throughput and improve spectrum utilization in a flat-fading wireless channel environment. Such cognitive radio networks that use user collaboration to improve channel capacity and spectrum utilization are called collaborative cognitive radio networks. A Nash equilibrium game-based relay node selection algorithm is investigated, which aims to maximize the utility function of primary and cognitive users. Secondly, a Stackelberg game is introduced, which aims to select the better set of nodes to achieve spectrum sharing. Simulation results show that the algorithm proposed in the study maximizes the utility functions of both primary and cognitive users and enables the selection of a better set of nodes for spectrum sharing. Specifically, the Nash equilibrium game-based relay node selection algorithm at c  = 0.3  ∗  10−6 results in better utility values for both PU and CU, and the algorithm enables more CU to access the spectrum so that users can get longer access time. The relay node selection algorithm based on the Stackelberg game demonstrates high feasibility. Under the condition of parameter α = α ∗ , the algorithm can achieve high-quality cooperation, and CU in better positions can be used as relay cooperation nodes. The algorithm can improve the main user utility function by 20%–35%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信