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%.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.