Abstract
In this paper, we consider the problem of cognitive radio (CR) user selection to maximize overall CR network (CRN) throughput when the available spectrum bandwidth is less than the demand by all CR users. We formulate optimal CR user selection problem. Then, based on approximation of the average received signal to interference plus noise ratio (SINR) and adaptive modulation and coding (AMC), we estimate the required bandwidth of CR users with different required quality of services (QoSs). Using the principle of optimality, we propose a novel cooperative spectrum sharing algorithm for a CRN. The proposed algorithm not only achieves exhaustive search performance but also its complexity is in the order of N × M versus 2N for exhaustive search, where N is the number of CR users, and M is the spectrum pool size. Extensive simulation results illustrate that the proposed algorithm significantly outperforms the existing algorithms that ignore optimal CR user selection. Also, these results illustrate a better fairness criterion than those of previous works.
Highlights
In the fixed spectrum allocation policy that is currently used in wireless networks, fixed spectrum segments are allocated to spectrum-licensed primary radio (PR) users for a long time in large regions
We consider the problem of cognitive radio (CR) user selection to maximize overall CR network (CRN) throughput when the available spectrum bandwidth is less than the demand by all CR users
The proposed algorithm achieves exhaustive search performance and its complexity is in the order of N × M versus 2N for exhaustive search, where N is the number of CR users, and M is the spectrum pool size
Summary
In the fixed spectrum allocation policy that is currently used in wireless networks, fixed spectrum segments are allocated to spectrum-licensed primary radio (PR) users for a long time in large regions. We propose a novel optimal cooperative spectrum sharing algorithm with overall CRN throughput as its objective. In [9], authors developed a distance-dependent medium access control protocol (DDMAC) to improve the overall CRN throughput using a cooperative spectrum sharing This algorithm exploits the dependence between the signal attenuation model and the transmission distance. We propose a novel optimal cooperative spectrum sharing algorithm that has the ability to select the CR users in order to achieve optimal overall CRN throughput. We apply these and an adaptive modulation and coding (AMC), to estimate minimum required bandwidths of CR users We formulated this optimal user selection problem with the objective of maximizing overall CRN throughput and meeting constraint of the given spectrum pool size.
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
