Efficient techniques for cooperative spectrum sensing in cognitive radio networks
thesisposted on 2021-05-23, 12:20 authored by Lamiaa Khalid
In this thesis, we focus on two important design aspects of cooperative spectrum sensing (CSS) in cognitive radio networks which are the selection criterion of cooperating secondary users and the fusion technique for combining their local sensing decisions. We propose a novel adaptive user-group assignment algorithm that addresses the problem of sensing accuracy-efficiency trade-off in group-based CSS with heterogeneous cooperating secondary users. The performance of the proposed algorithm is bounded by 4.2% of the optimal solution. Through extensive simulations, we demonstrate that the proposed algorithm can effectively improve the performance of CSS in terms of the opportunistic throughput, sensing overhead and the number of sensing rounds needed to discover an available channel. Considering the different detection performance of cooperating secondary users, we propose a novel reliability-based decision fusion scheme in which a weight is assigned to each secondary user's local decision based on its reliability. Since the knowledge of the local probabilities of detection and false alarm for each secondary detector may not be known in practice, we employ a counting process to estimate those probabilities based on past global and local decisions. We then formulate the problem of minimizing the network probability of sensing error and develop a dual search algorithm, based on a non-linear Lagrangian approach, to solve the formulated problem. Our simulation results show that the dual algorithm converges to the optimal value with zero duality gap using few numbers of iterations. We also show that the probability of error is reduced by 18% and 88% compared to the OR and AND fusion rules, respectively, when the number of secondary users is eight. We then address the practical concern of secondary users reporting correlated local decisions to the fusion center. For this scenario, we formulate the problem of minimizing the network probability of sensing error optimization problem and employ the genetic algorithm to jointly find the optimal K*-out-of-M fusion rule and the optimal local threshold for a certain correlation index. Simulation results show that the network probability of sensing error degrades as the degree of correlation between cooperating secondary users increases. We also study the problem of multiband cooperative joint detection in the presence of sensing errors due to time offset. We derive the aggregate opportunistic throughput and aggregate interference to primary users for multiband cooperative joint detection in the presence of time offset. Our numerical results demonstrate the negative impact of the time offset on the aggregate opportunistic throughput of multiband cooperative joint detection.