Accession Number:
ADA509713
Title:
Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks
Descriptive Note:
Final project rept. 23 Sep 2008-22 Sep 2009
Corporate Author:
JACKSON STATE UNIV MS DEPT OF COMPUTER SCIENCE
Personal Author(s):
Report Date:
2009-09-01
Pagination or Media Count:
136.0
Abstract:
The high-level contribution of this paper is the design and development of a node-disjoint multi-path extension for the Location Prediction Based Routing protocol referred to as LPBR-M. LPBR-M reduces the number of global broadcast multi-path route discoveries. Simulations have been conducted with both flooding and DMEF as the broadcast route discovery strategies. We compared the performance of LPBR-M with that of the link-disjoint path based AODM and the node-disjoint path based AODVM multi-path routing protocols. LPBR-M achieves the longest time between successive route discoveries and the lowest control message overhead. Also, the LPBR-M multi-paths incur hop count that is very much equal to those obtained with the minimum-hop based AODVM and AODVM routing protocols. Moreover, DMEF helps each of the multi-path routing protocols to determine a set of node or link disjoint paths that exist for a long time and at the same time does not increase the source-destination hop count appreciably. When used with DMEF, each of the multi-path routing protocols incurred a lower energy spent per route discovery, compared to flooding.
Descriptors:
Subject Categories:
- Computer Systems
- Computer Systems Management and Standards