Stable Path Routing Protocol Research Articles

Eigenvector centrality-based stable path routing protocol for cognitive radio ad hoc networks

We propose to use eigenvector centrality (EVC) as the basis for determining stable paths and arrive at benchmarks for the number of path transitions incurred with stability-based routing in cognitive radio ad hoc networks (CRAHNs) wherein secondary users (SUs) use the available (idle) licensed channels of primary users (PUs). We model a time-variant network graph (at any time instant) of SU nodes whose adjacency matrix indicates the number of common available PU channels in the mutually intersecting neighbourhoods of any two SU nodes at the time instant. Such an adjacency matrix is used as the basis to compute the EVC of the vertices in the network graph of SU nodes and determine an end-to-end source-destination path whose constituent SU nodes have a higher EVC. Simulation results indicate EVC-based paths between any two SU nodes incur significantly fewer transitions without any appreciable increase in the average hop count per path.

A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels

We propose a novel local spectrum knowledge-based distributed stable path routing protocol for cognitive radio ad hoc networks (CRAHNs) where the unlicensed secondary users (SUs) make use of the licensed channels of the Primary Users (PUs) when the latter are not actively using the channels. We model a time-variant CRAHN of SUs with links between any two SUs if they have at least one common PU channel available for use in their neighborhood and the weight of an edge is the number of such common PU channels available for use. Referred to as the Maximum Common Primary User channel-based Routing (MCPUR) protocol, the proposed protocol prefers to choose an SU-SU source-destination ( s-d ) path with the largest value for the sum of the number of common PU channels available for use across each of its constituent edges. Our hypothesis is that such an s-d route is likely to exist for a longer time (and incur fewer broadcast route discoveries) as the end nodes of the constituent SU-SU edges are more likely to have at least one common available PU channel that can be used to complete the transmission and reception of data packets. Simulation results confirm our hypothesis to be true: the number of path transitions incurred with MCPUR could be at most 62% lower than that of the path transitions incurred with a minimum hop-based shortest path routing (SPR) protocol. The tradeoff is a low-moderate increase in the hop count per path (as large as 17%)

A Unicast Stable Path Routing Protocol for Mobile Ad hoc Networks based on the Inverse of Link Expiration Time

The high-level contribution of this paper is the design and development of a unicast stable path routing protocol (referred to as SILET) that determines long-living routes based on the Inverse of the Link Expiration Times (LET) for Mobile Ad hoc Networks (MANETs). From a graph theoretical perspective, we model SILET as a minimization problem to discover stable routes with the lowest value for the sum of the link weights; the weight of a link defined as 1 plus the inverse of the LETs. The inclusion of ‘1’ in the link weights helps to reduce the number of constituent links of the paths (i.e. the hop count). Performance comparison of SILET with FORP, DSR and ABR routing protocols in ns-2 illustrate that SILET discovers routes whose lifetimes are significantly longer compared to that of DSR and ABR and at most 20-40% lower than that of FORP; the hop counts of SILET routes are at most 4% larger than the minimum hop count; and the end-to-end delay per data packet for SILET routes is the lowest among all the routing protocols simulated – an indication that SILET effectively minimizes the stability-hop count tradeoff observed with the currently available MANET unicast routing protocols.