Scalability and Route Failure Time of a Hybrid Protocol for Identification of Node-Disjoint Paths in Mobile Ad Hoc Networks

Authors:
Ash Mohammad Abbas
Affiliations:
Department of Computer Engineering Zakir Husain College of Engineering and Technology, Aligarh Muslim University, Aligarh, India 110016
Venue:
ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Year:
2008

Citing 3
Cited 0

Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Mobile Networks and Applications
Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks

Computer Communications
Mitigating path diminution in disjoint multipath routing for mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying a maximal set of node-disjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. In this paper, we analyze a protocol that adopts an approach that is a hybrid of the approaches taken by a protocol that tries to identify multiple node-disjoint paths in a single go and a protocol that identifies them incrementally. In our analysis, we focus on the following parameters: (i) scalability, and (ii) route failure time.