Degraded link-disjoint multipath routing in ad hoc networks

Authors:
Junxia Cai;Wei Wu
Affiliations:
State Key laboratory of Virtual Reality Technology and Systems, Beihang university, dept. of computer, Beijing, China;State Key laboratory of Virtual Reality Technology and Systems, Beihang university, dept. of computer, Beijing, China
Venue:
ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Year:
2009

Citing 5
Cited 0

A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of TCP performance over mobile ad hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Real-Time Multiple Description and Layered Encoded Video Streaming with Optimal Diverse Routing

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a multiple-path routing protocol, called as degraded link-disjoint Multipath (DLDM) routing protocol, which is based on Ad-hoc On-demand Distance Vector(AODV) routing protocol for ad-hoc networks. The proposed protocol establishes disjoint-link paths if disjoint-link paths exist in the network and establishes multiple-path routing that have no more than one common link according to the network condition during the route discovery procedure. This saves network bandwidth and reduces route reconstruction time when a routing path fails. Our modeling effort shows while that proposed multipath routing is significantly better than AOMDV, the performance advantage is small beyond a few paths and for long path lengths. It also shows that the routing overhead and the route reconstruction time to find a new route is reduced. We perform simulation experiments which validate these findings.