3DMRP: 3-Directional Zone-Disjoint Multipath Routing Protocol

Dongseung SHIN
Dongkyun KIM

IEICE TRANSACTIONS on Information and Systems   Vol.E92-D    No.4    pp.620-629
Publication Date: 2009/04/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.620
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Networks
zone-disjoint,  multipath routing,  route coupling,  3DMRP,  

Full Text: PDF(862.9KB)>>
Buy this Article

In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.

open access publishing via