RACON

Abstract

Advancement of Cognitive Radio technology can remedy the problems encountered from bandwidth and spectrum access limitations. In Cognitive Radio Ad Hoc Networks routing is one of the most important issues to be addressed and desires deep investigation. Previously proposed routing protocols assume the presence of a connected path from the source to the destination. In some scenarios, due to the characteristics of ad hoc networks and the features of the used cognitive radios, this assumption is likely to be invalid. In this study, a novel routing algorithm for future multi-hop Cognitive Radio Networks is proposed. The main motivation is to maximize data rates and minimize data delivery latency for a set of user communication sessions to deliver messages for the case where there is no connected path from the source to the destination or when network is partitioned at the time a message is originated. Experimental evaluations are performed in the ns2 simulator. It has been shown that the proposed approach provides better adaptability to the environment and maximizes throughput in a number of realistic scenarios and outperforms recently proposed routing protocols for Cognitive Radio networks.