4 research outputs found
Reliable Broadcast over Cognitive Radio Networks: A Bipartite Graph-Based Algorithm
Cognitive radio (CR) is a promising technology that aims to enhance the spectrum utilisation by enabling unlicenced users to opportunistically use the vacant spectrum bands assigned to licenced users. Broadcasting is considered as a fundamental operation in wireless networks, as well as in cognitive radio networks (CRNs). The operation of most network protocols in the ad hoc network depends on broadcasting control information from neighbouring nodes. In traditional single-channel or multichannel ad hoc networks, due to uniform channel availability, broadcasting is easily implemented as nodes are tuned to a single common channel. On the contrary, broadcasting in CR ad hoc networks is both a challenging and complex task. The complexity emerges from the fact that different CR users might acquire different channels at different times. Consequently, this partitions the network into different clusters. In this chapter, the problem of broadcasting in ad hoc CR networks is presented, current solutions for the problem are discussed and an intelligent solution for broadcasting based on graph theory to connect different local topologies is developed
Intelligent spectrum management techniques for wireless cognitive radio networks
PhD ThesisThis thesis addresses many of the unique spectrum management chal-
lenges in CR networks for the rst time. These challenges have a vital
e ect on the network performance and are particularly di cult to solve
due to the unique characteristics of CR networks. Speci cally, this thesis
proposes and investigates three intelligent spectrum management tech-
niques for CR networks. The issues investigated in this thesis have a
fundamental impact on the establishment, functionality and security of
CR networks.
First, an intelligent primary receiver-aware message exchange protocol
for CR ad hoc networks is proposed. It considers the problem of alleviat-
ing the interference collision risk to primary user communication, explic-
itly to protect primary receivers that are not detected during spectrum
sensing. The proposed protocol achieves a higher measure of safeguard-
ing. A practical scenario is considered where no global network topology
is known and no common control channel is assumed to exist.
Second, a novel CR broadcast protocol (CRBP) to reliably disseminate
the broadcast messages to all or most of the possible CR nodes in the
network is proposed. The CRBP formulates the broadcast problem as a
bipartite-graph problem. Thus, CRBP achieves a signi cant successful
delivery ratio by connecting di erent local topologies, which is a unique
feature in CR ad hoc networks.
Finally, a new defence strategy to defend against spectrum sensing data
falsi cation attacks in CR networks is proposed. In order to identify
malicious users, the proposed scheme performs multiple veri cations of
sensory data with the assistance of trusted nodes.Higher Committee For Education Devel-
opment in Iraq (HCED-Iraq
Characterization of the Opportunistic Service Time in Cognitive Radio Networks,
This paper studies the service time required to transmit a packet in an opportunistic spectrum access scenario, where an unlicensed secondary user (SU) transmits a packet using the radio spectrum licensed to a primary user (PU). Considering a cognitive radio network, it is assumed that during the transmission period of an SU multiple interruptions from PUs may occur, increasing the time needed to transmit a packet. Assuming that the SU's packet length follows a geometric distribution, we start by deriving the probability of an SU transmitting its packet when k > 0 periods of PU's inactivity are observed. As the main contribution of this paper, we derive the characteristic function of the service time, which is further used to approximate its distribution in a real-time estimation process. The proposed methodology is independent of the SU's traffic condition, i.e., both saturated or non-saturated SU's traffic regime is assumed. Our analysis provides a lower bound for the service time of the SUs, which is useful to determine the maximum throughput achievable by the secondary network. Simulation results are used to validate the analysis, which confirm the accuracy of the proposed methodology