scholarly journals Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Sunil Kumar ◽  
Siddharth Khimsara ◽  
Kashyap Kambhatla ◽  
Kalyani Girivanesh ◽  
John D. Matyjas ◽  
...  

Node mobility in mobile ad hoc networks (MANETs) causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU), for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i) a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI) for discovery of reliable routes; (ii) alocal path updatemechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii) akeep alivemechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv) apacket salvagingscheme to improve packet delivery in the event of a route breakage; and (v) low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

2020 ◽  
Vol 16 (1) ◽  
pp. 155014772090363
Author(s):  
Qingwen Wang ◽  
Haitao Yu

To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.


2005 ◽  
Vol 11 (1-2) ◽  
pp. 21-38 ◽  
Author(s):  
Yih-Chun Hu ◽  
Adrian Perrig ◽  
David B. Johnson

Sign in / Sign up

Export Citation Format

Share Document