An Efficient Routing Protocol for Secured Communication in Cognitive Radio Sensor Networks

TL;DR

This paper presents a reactive routing protocol for Cognitive Radio Sensor Networks that dynamically selects stable, reliable, and secure paths by considering node mobility and spectrum availability, enhancing routing efficiency.

Contribution

The paper introduces a novel routing protocol that models spectrum and mobility factors as a weighted graph to improve path stability and security in CRSNs.

Findings

Outperforms existing routing protocols in simulations

Effectively considers mobility and spectrum dynamics

Provides stable and secure communication paths

Abstract

This paper introduces an efficient reactive routing protocol considering the mobility and the reliability of a node in Cognitive Radio Sensor Networks (CRSNs). The proposed protocol accommodates the dynamic behavior of the spectrum availability and selects a stable transmission path from a source node to the destination. Outlined as a weighted graph problem, the proposed protocol measures the weight for an edge the measuring the mobility patterns of the nodes and channel availability. Furthermore, the mobility pattern of a node is defined in the proposed routing protocol from the viewpoint of distance, speed, direction, and node's reliability. Besides, the spectrum awareness in the proposed protocol is measured over the number of shared common channels and the channel quality. It is anticipated that the proposed protocol shows efficient routing performance by selecting stable and secured paths from source to destination. Simulation is carried out to assess the performance of the protocol where it is witnessed that the proposed routing protocol outperforms existing ones.