Spatially Diffuse Pathsets for Robust Routing in Ad Hoc Networks

Abstract

Ad hoc wireless networks are characterized by frequent node mobility, limited power reserves and interfering transmissions. On-demand routing proves to be more successful in such networks, as it reduces the traffic overhead of sending periodic updates, but they may be susceptible to both random uncertainty in radio links, and malicious jamming. We consider a network of nodes addressed by their locations, and propose a novel routing technique that we call Petal Routing, which maximizes reliability by using pathsets, made of diverse multiple paths, in place of a single path. Petal Routing takes advantage of the broadcast nature of wireless networks to reduce the number of transmissions for multiple paths by overlapping the multiple diverse paths. Various tunable parameters built into the approach can be used to improve metrics such as delay, number of transmissions and packet delivery ratio. We evaluate the performance of our scheme using extensive simulations, and show that it is viable.

SS_PAR: Signal Strength Based Petal Ant Routing Algorithm for Mobile Ad Hoc Network

“…The SS_PAR is a routing algorithm based on swarm intelligence technique called Ant based routing for mobile ad hoc network, which is an extended variant of SARA [10] and extract few feature of petal routing [19]. The main objective of SS_PAR is to minimize the overhead by eliminating redundant Forward Ant [FANT], Backward Ant [BANT] and the node that processed during the route discovery phase.…”

PAR: Petal Ant Routing Algorithm for Mobile Ad Hoc Network

“…Petal routing [19] is a routing algorithm for MANET. In this routing approach it merge the concept of multipath and geographic routing algorithm, where network nodes are addressed based on geographic location rather than IP address with no routing principle.…”

“…In this section, we present details of PAR architecture constructs as similar to others routing algorithm. PAR algorithm is an improved version of Simple Ant Routing Algorithm (SARA) [13] and combines the few characteristics of Petal routing [19]. PAR consists of 3 phases namely Route discovers, Route maintenance and Route repair.…”

Spatial DSDV (S-DSDV) routing algorithm for mobile ad hoc network

“…In this section we describe a routing algorithm for mobile ad hoc network called Spatial Destination Sequenced Distanced vector (S-DSDV), which composed of petal algorithm [15] and Destination Sequenced Distanced Vector (DSDV) routing algorithm [14]. The S-DSDV identifies and broadcast route update packet to only selected area.…”