Cooperative subcarrier sensing using antenna diversity based weighted virtual sub clustering

The idea of cooperation and the clustering amongst cognitive radios (CRs) has recently been focus of attention of research community, owing to its potential to improve performance of spectrum sensing (SS) schemes. This focus has led to the paradigm of cluster based cooperative spectrum sensing (CBCSS). In perspective of high date rate 4th generation wireless systems, which are characterized by orthogonal frequency division multiplexing (OFDM) and spatial diversity, there is a need to devise effective SS strategies. A novel CBCSS scheme is proposed for OFDM subcarrier detection in order to enable the non-contiguous OFDM (NC-OFDM) at the physical layer of CRs for efficient utilization of spectrum holes. Proposed scheme is based on the energy detection in MIMO CR network, using equal gain combiner as diversity combining technique, hard combining (AND, OR and Majority) rule as data fusion technique and antenna diversity based weighted clustering as virtual sub clustering algorithm. Results of proposed CBCSS are compared with conventional CBCSS scheme for AND, OR and Majority data fusion rules. Moreover the effects of antenna diversity, cooperation and cooperating clusters are also discussed

Cooperative sensing of spectrum opportunities

Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions

Collaborative spectrum sensing optimisation algorithms for cognitive radio networks

The main challenge for a cognitive radio is to detect the existence of primary users reliably in order to minimise the interference to licensed communications. Hence, spectrum sensing is a most important requirement of a cognitive radio. However, due to the channel uncertainties, local observations are not reliable and collaboration among users is required. Selection of fusion rule at a common receiver has a direct impact on the overall spectrum sensing performance. In this paper, optimisation of collaborative spectrum sensing in terms of optimum decision fusion is studied for hard and soft decision combining. It is concluded that for optimum fusion, the fusion centre must incorporate signal-to-noise ratio values of cognitive users and the channel conditions. A genetic algorithm-based weighted optimisation strategy is presented for the case of soft decision combining. Numerical results show that the proposed optimised collaborative spectrum sensing schemes give better spectrum sensing performance

Data Transmission with Reduced Delay for Distributed Acoustic Sensors

This paper proposes a channel access control scheme fit to dense acoustic sensor nodes in a sensor network. In the considered scenario, multiple acoustic sensor nodes within communication range of a cluster head are grouped into clusters. Acoustic sensor nodes in a cluster detect acoustic signals and convert them into electric signals (packets). Detection by acoustic sensors can be executed periodically or randomly and random detection by acoustic sensors is event driven. As a result, each acoustic sensor generates their packets (50bytes each) periodically or randomly over short time intervals (400ms~4seconds) and transmits directly to a cluster head (coordinator node). Our approach proposes to use a slotted carrier sense multiple access. All acoustic sensor nodes in a cluster are allocated to time slots and the number of allocated sensor nodes to each time slot is uniform. All sensor nodes allocated to a time slot listen for packet transmission from the beginning of the time slot for a duration proportional to their priority. The first node that detect the channel to be free for its whole window is allowed to transmit. The order of packet transmissions with the acoustic sensor nodes in the time slot is autonomously adjusted according to the history of packet transmissions in the time slot. In simulations, performances of the proposed scheme are demonstrated by the comparisons with other low rate wireless channel access schemes.Comment: Accepted to IJDSN, final preprinted versio

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

Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel Cognitive Radio Networks

In this paper, we propose a semi-distributed cooperative spectrum sen sing (SDCSS) and channel access framework for multi-channel cognitive radio networks (CRNs). In particular, we c onsider a SDCSS scheme where secondary users (SUs) perform sensing and exchange sensing outcomes with ea ch other to locate spectrum holes. In addition, we devise the p -persistent CSMA-based cognitive MAC protocol integrating the SDCSS to enable efficient spectrum sharing among SUs. We then perform throughput analysis and develop an algorithm to determine the spectrum sensing and access parameters to maximize the throughput for a given allocation of channel sensing sets. Moreover, we consider the spectrum sensing set optimization problem for SUs to maxim ize the overall system throughput. We present both exhaustive search and low-complexity greedy algorithms to determine the sensing sets for SUs and analyze their complexity. We also show how our design and analysis can be extended to consider reporting errors. Finally, extensive numerical results are presented to demonstrate the sig nificant performance gain of our optimized design framework with respect to non-optimized designs as well as the imp acts of different protocol parameters on the throughput performance.Comment: accepted for publication EURASIP Journal on Wireless Communications and Networking, 201

Energy-efficient spectrum sensing approaches for cognitive radio systems

Designing an energy efficient cooperative spectrum sensing for cognitive radio network is our main research objective in this dissertation. Two different approaches are employed to achieve the goal, clustering and minimizing the number of participating cognitive radio users in the cooperative process. First, using clustering technique, a multilevel hierarchical cluster-based structure spectrum sensing algorithm has been proposed to tackle the balance between cooperation gain and cost by combining two different fusion rules and exploiting the tree structure of the cluster. The algorithm considerably minimizes the reporting overhead while satisfying the detection requirements. Second, based on reducing the number of participating cognitive radio users, primary user protection is considered to develop an energy efficient algorithm for cluster-based cooperative spectrum sensing system. An iterative algorithm with low complexity has been proposed to design energy efficient spectrum sensing for cluster-based cooperative systems. Simulation results show that the proposed algorithm can significantly minimize the number of contributing of cognitive radio users in the collaboration process and can compromise the performance gain and the incurred overhead. Moreover, a variable sensing window size is also considered to propose three novel strategies for energy efficient centralized cooperative spectrum sensing system using the three hard decision fusion rules. The results show that strategies remarkably increase the energy efficiency of the cooperative system; furthermore, it is shown optimality of k out of N rule over other two hard decision fusion rules. Finally, joint optimization of transmission power and sensing time for a single cognitive radio is considered. An iterative algorithm with low computational requirements has been proposed to jointly optimize power and sensing time to maximize the energy efficiency metric. Computer results have shown that the proposed algorithm outperforms those existing works in the literature