**Reliable Broadcast over Cognitive Radio Networks: A Bipartite Graph-Based Algorithm**

Yasir Ahmed Al-Mathehaji, Said Boussakta and Martin Johnston

Additional information is available at the end of the chapter

http://dx.doi.org/10.5772/intechopen.69216

#### **Abstract**

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.

**Keywords:** reliable broadcast, cognitive radio, bipartite graph, network topology, data dissemination, ad hoc network
