{"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}
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%.