摘要
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.
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.
