Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31094
Title: Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Authors: Choi, W
Das, SK
Cao, J 
Datta, AK
Keywords: Adaptive routing
Congestion control
Mobile ad hoc networks
Nomadic control packets
Randomization
Wireless networks
Issue Date: 2005
Source: Journal of parallel and distributed computing, 2005, v. 65, no. 2, p. 107-123 How to cite?
Journal: Journal of Parallel and Distributed Computing 
Abstract: Several approaches have been proposed for designing multihop routing protocols in mobile ad hoc networks (MANET). Many of them adopt a method, called flooding, to discover a routing path. Due to the time-varying nature of the route in MANET, the discovered route needs to be dynamically maintained for optimality in terms of traffic load, hop-distance, and resource usage. It is easy to see that flooding incurs significant overhead and hence is inappropriate for the dynamic route maintenance. In this paper we propose a randomized, dynamic route maintenance scheme for adaptive routing in MANET. The scheme makes use of a nomadic control packet (NCP) which travels through the network based on a random walk, and collects its stopovers as a traversal record. The NCP uses the traversal record to probabilistically provide the nodes with clue for routing path updates. From the clue, the nodes can find the routing path update information that is up-to-date and optimal (less-loaded and shorter), thereby adapting to the dynamic network topology and traffic load conditions. We present an analytical model for measuring the effectiveness of NCP in terms of its frequency of visits and probability of finding the clue from the NCP traversal record. The proposed randomized scheme serves as a routing protocol supporting layer and can be easily applied with minimum modifications to the existing on-demand routing protocols such as AODV and DSR. In our experimental study, we modified the AODV protocol to maintain routing paths using NCPs' traversal record. Simulation results show that NCPs help the routing protocol to notably reduce average end-to-end packet delay with increased route optimality and better control on traffic congestion.
URI: http://hdl.handle.net/10397/31094
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2004.09.003
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Jul 13, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
Citations as of Jul 19, 2017

Page view(s)

25
Last Week
1
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.