Abstract
In this paper, we mainly address the problem of two-layered spectrum sharing between primary users (PUs) and secondary users (SUs) in a multi-channel cooperative cognitive radio network (CCRN). In CCRN, PUs select SUs as relays to increase their transmission rates while SUs gain the spectrum usage opportunities for transmitting their own traffics. However, how to select appropriate SUs as relays for PUs is still an important research issue, particularly in such an environment of multi-channel with multiple PUs and multiple SUs. In this work, we propose an approach of stable matching with peer effects, in which the stable matching and the swap matching algorithms are proposed to form the matched pairings between PUs and SUs, such that the SU will relay its paired-PU's data in exchange for gaining the spectrum usage opportunities. Finally, the benefits of the stable matching and the swap matching approaches comparing to the ones of random matching and optimal allocation are demonstrated by the simulations.
Highlights
In recent years, cooperative cognitive radio networks (CCRN)(1-4) has emerged as an efficient and power-saving communication paradigm, in which the secondary users (SUs) act as cooperative relays to assist the primary users (PUs)' transmission in exchange for accessing the spectrum opportunities
The benefits of the stable matching and the swap matching approaches comparing to the ones of random matching and optimal allocation are verified by the simulation results
The primary base station (PBS) and the PUs are assumed to be located on a squared network of length four, and the secondary access point (SAP) and the SUs are
Summary
Cooperative cognitive radio networks (CCRN)(1-4) has emerged as an efficient and power-saving communication paradigm, in which the SUs act as cooperative relays to assist the PUs' transmission in exchange for accessing the spectrum opportunities. We investigate the cooperative spectrum sharing strategies between multiple PUs and multiple SUs in a multi-channel CCRN. We apply the stable matching theory[5,6,7,8] to determine the cooperative relays for PUs in a two-layered hierarchical spectrum sharing environment. Stable matching theory proposed by Gale-Shapley[5] has been applied recently to solve the resource allocation problems in wireless networks[8,9,10,11]. In [10], a distributed matching algorithm was proposed to investigate the spectrum sharing strategies between multiple PUs and multiple SUs in a cognitive radio network. The benefits of the stable matching and the swap matching approaches comparing to the ones of random matching and optimal allocation are verified by the simulation results
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
