A graph based routing algorithm for multi-hop cognitive radio networks

Authors:
Yogesh R Kondareddy;Prathima Agrawal
Affiliations:
Auburn University, Auburn, AL;Auburn University, Auburn, AL
Venue:
Proceedings of the 4th Annual International Conference on Wireless Internet
Year:
2008

Citing 3
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
An interference-aware routing metric in multi-radio multi-hop networks

ACM-SE 45 Proceedings of the 45th annual southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterized by dynamically changing channel sets at each node. The graph theoretic approach used in traditional multi-hop networks fails to efficiently model multi-hop cognitive radio networks and capture the required information for optimal routing. Hence, conventional graph-based routing protocols such as DSR or AODV cannot be used directly, for route discovery in such networks. In this paper, a unique multi-edge planar graph model for routing in such type of networks is proposed, which is quite simple and could be used in conjunction with any conventional graph-based routing protocol. The model is validated through simulations and the complexity of the model is shown to be lesser than an earlier layered graph model.