A closed-form of cooperative detection probability using EGC-based soft decision under Suzuki fading

© 2017 IEEE. In cooperative spectrum sensing based on energy detection, several researchers have concluded that Soft Decision has better detection performance than Hard Decision. In this paper, we focus on Equal Gain Combining (EGC)-based soft decision under Suzuki fading which is a composite Rayleigh-lognormal fading. We use Moment-Generating function (MGF) to approximate Probability Density Function (PDF) of power sum of received signals at Fusion Center. Then we propose a novel method to evaluate cooperative detection performance under the effect of i.i.d Suzuki fading by using Gauss-Hermite approximation and MGF matching. Finally, we compare the results of EGC-based Soft Decision with those of Hard Decision

Energy efficient scheme based on simultaneous transmission of the local decisions in cooperative spectrum sensing

A common concern regarding cooperative spectrum sensing (CSS) schemes is the occupied bandwidth and the energy consumption during the transmissions of sensing information to the fusion center over the reporting control channels. This concern is intensified if the number of cooperating secondary users in the network is large. This article presents a new fusion strategy for a CSS scheme, aiming at increasing the energy efficiency of a recently proposed bandwidth-efficient fusion scheme. Analytical results and computational simulations unveil a high increase in energy efficiency when compared with the original approach, yet achieving better performances in some situations, and lower implementation complexity

Coalition Formation Games for Collaborative Spectrum Sensing

Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the detection of the primary user (PU) and maintaining a reasonable false alarm probability (e.g., for maintaining a good spectrum utilization). In this paper, we study the impact of this tradeoff on the network structure and the cooperative incentives of the SUs that seek to cooperate for improving their detection performance. We model the CSS problem as a non-transferable coalitional game, and we propose distributed algorithms for coalition formation. First, we construct a distributed coalition formation (CF) algorithm that allows the SUs to self-organize into disjoint coalitions while accounting for the CSS tradeoff. Then, the CF algorithm is complemented with a coalitional voting game for enabling distributed coalition formation with detection probability guarantees (CF-PD) when required by the PU. The CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e., coalitions that achieve the target detection probability with minimal costs. For both algorithms, we study and prove various properties pertaining to network structure, adaptation to mobility and stability. Simulation results show that CF reduces the average probability of miss per SU up to 88.45% relative to the non-cooperative case, while maintaining a desired false alarm. For CF-PD, the results show that up to 87.25% of the SUs achieve the required detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea