|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
A New Routing Protocol Using Route Redundancy in Ad Hoc Networks
Sangkyung KIM Sunshin AN
Publication
IEICE TRANSACTIONS on Communications
Vol.E88-B
No.3
pp.1000-1008 Publication Date: 2005/03/01 Online ISSN:
DOI: 10.1093/ietcom/e88-b.3.1000 Print ISSN: 0916-8516 Type of Manuscript: Special Section PAPER (Special Section on Ubiquitous Networks) Category: Network Keyword: mobile ad hoc network, on-demand ad hoc routing, redundancy based routing, destination-initiated partial recovery,
Full Text: PDF(536.6KB)>>
Summary:
This paper proposes a new ad hoc routing protocol using route redundancy as one of route selection criteria. It is important to provide redundancy for the route from source to destination in mobile ad hoc networks that are susceptible to failure. Route redundancy implies the relative possibility that redundant paths will exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward a destination node by involving intermediate nodes with relatively more adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route rediscoveries at route failures. We show the route setup procedure considering link redundancy and the route reconfiguration procedures employing redundant path information at the intermediate nodes. Further, this paper presents a new route maintenance protocol. Most of existing ad hoc routing protocols re-initiate a route query procedure when a destination node moves away and a route failure occurs. However, our scheme makes the destination node find a neighbor node that knows the way to the source node and establish a partial route to the neighbor node. If the destination node can find any and connect to it, the route will be recovered. This produces less control overhead than a source-initiated route discovery. We show the performance of our routing schemes through simulations using the Network Simulator 2 (ns-2).
|
|
|