A Novel Routing Algorithm in Cognitive Radio Ad Hoc Networks

Author

Jun Li ; Zhou, Yifeng ; Lamont, Louise ; Gagnon, Francois

Author_Institution

Commun. Res. Centre Canada, Ottawa, ON, Canada

fYear

2011

fDate

5-9 Dec. 2011

Firstpage

1

Lastpage

5

Abstract

Cognitive radio ad hoc networks (CRAHNs) have become a popular network architecture for connecting mobile nodes thanks to the flexibility and adaptability of such type of network. In this paper, we propose a novel scheme for efficient routing design in CRAHNs. The proposed routing scheme firstly forms a simple directed graph for the given physical network. Using the simple directed graph, multiple optimal routing paths can be computed for a pair of cognitive radio users. An optimal routing path minimizes both the hop count and the adjacent hop interference. Examples are used to demonstrate the performance and efficiency of the proposed CRAHN routing technique. Results are also compared with other existing routing techniques for CRAHNs.

Keywords

ad hoc networks; cognitive radio; directed graphs; telecommunication network routing; CRAHN; cognitive radio ad hoc network; directed graph; hop count; hop interference; network architecture; optimal routing path; routing algorithm; Ad hoc networks; Cognitive radio; Interference; Network topology; Peer to peer computing; Routing; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Conference_Location

Houston, TX, USA

ISSN

1930-529X

Print_ISBN

978-1-4244-9266-4

Electronic_ISBN

1930-529X

Type

conf

DOI

10.1109/GLOCOM.2011.6134370

Filename

6134370