Cluster-based cooperative subcarrier sensing using antenna diversity-based weighted data fusion

Cooperative spectrum sensing (CSS) is used in cognitive radio (CR) networks to improve the spectrum sensing performance in shadow fading environments. Moreover, clustering in CR networks is used to reduce reporting time and bandwidth overhead during CSS. Thus, cluster-based cooperative spectrum sensing (CBCSS) has manifested satisfactory spectrum sensing results in harsh environments under processing constraints. On the other hand, the antenna diversity of multiple input multiple output CR systems can be exploited to further improve the spectrum sensing performance. This paper presents the CBCSS performance in a CR network which is comprised of single- as well as multiple-antenna CR systems. We give theoretical analysis of CBCSS for orthogonal frequency division multiplexing signal sensing and propose a novel fusion scheme at the fusion center which takes into account the receiver antenna diversity of the CRs present in the network. We introduce the concept of weighted data fusion in which the sensing results of different CRs are weighted proportional to the number of receiving antennas they are equipped with. Thus, the receiver diversity is used to the advantage of improving spectrum sensing performance in a CR cluster. Simulation results show that the proposed scheme outperforms the conventional CBCSS scheme

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

Cognitive radio-enabled Internet of Vehicles (IoVs): a cooperative spectrum sensing and allocation for vehicular communication

Internet of Things (IoTs) era is expected to empower all aspects of Intelligent Transportation System (ITS) to improve transport safety and reduce road accidents. US Federal Communication Commission (FCC) officially allocated 75MHz spectrum in the 5.9GHz band to support vehicular communication which many studies have found insufficient. In this paper, we studied the application of Cognitive Radio (CR) technology to IoVs in order to increase the spectrum resource opportunities available for vehicular communication, especially when the officially allocated 75MHz spectrum in 5.9GHz band is not enough due to high demands as a result of increasing number of connected vehicles as already foreseen in the near era of IoTs. We proposed a novel CR Assisted Vehicular NETwork (CRAVNET) framework which empowers CR enabled vehicles to make opportunistic usage of licensed spectrum bands on the highways. We also developed a novel co-operative three-state spectrum sensing and allocation model which makes CR vehicular secondary units (SUs) aware of additional spectrum resources opportunities on their current and future positions and applies optimal sensing node allocation algorithm to guarantee timely acquisition of the available channels within a limited sensing time. The results of the theoretical analyses and simulation experiments have demonstrated that the proposed model can significantly improve the performance of a cooperative spectrum sensing and provide vehicles with additional spectrum opportunities without harmful interference against the Primary Users (PUs) activities

Analytical Studies of Fragmented-Spectrum Multi-Level OFDM-CDMA Technique in Cognitive Radio Networks

In this paper, we present a multi-user resource allocation framework using fragmented-spectrum synchronous OFDM-CDMA modulation over a frequency-selective fading channel. In particular, given pre-existing communications in the spectrum where the system is operating, a channel sensing and estimation method is used to obtain information of subcarrier availability. Given this information, some real-valued multi-level orthogonal codes, which are orthogonal codes with values of $\{\pm1,\pm2,\pm3,\pm4, ... \}$, are provided for emerging new users, i.e., cognitive radio users. Additionally, we have obtained a closed form expression for bit error rate of cognitive radio receivers in terms of detection probability of primary users, CR users' sensing time and CR users' signal to noise ratio. Moreover, simulation results obtained in this paper indicate the precision with which the analytical results have been obtained in modeling the aforementioned system.Comment: 6 pages and 3 figure

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference