Paper Info
Title
On the reliability of ad hoc routing protocols for loss-and-delay sensitive applications
Abstract
In this paper, we analyze the packet delivery reliability of ad hoc routing protocols for loss-and-delay sensitive applications. Since a typical flooding-based route discovery used in ad hoc routing protocols -DSR for instance - can only discover node-disjoint paths. In this context, we first show that the reliability function of such a multipath system is concave with respect to the total number of paths. Therefore, maximum steady-state reliability may be attained by routing each packet through a small set of node-disjoint paths. Subsequently, we prove that a partially-disjoint path is more reliable than a node-disjoint path. Hence, high reliability and significant energy savings may be achieved by routing a packet through fewer partially-disjoint paths. Based on these findings, we suggest modifications to flooding-based route discovery procedure to discover partially-disjoint paths. We complement our theoretical outcomes through extensive simulations. Finally, we analyze the reliability of beacon-based routing protocols and derive an upper bound on the number of hops at which a beacon should be placed to satisfy a given packet reliability constraint.
Year
DOI
Venue
2011
10.1016/j.adhoc.2010.07.012
Ad Hoc Networks
Keywords
Field
DocType
Wireless ad hoc and sensor networks,Routing protocol,Reliability,Energy efficiency,Scalability
Multipath routing,Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Computer science,Computer network,DSRFLOW,Destination-Sequenced Distance Vector routing,Optimized Link State Routing Protocol,Source routing,Distributed computing
Journal
Volume
Issue
ISSN
9
3
Ad Hoc Networks
Citations 
PageRank 
References 
8
0.61
23
Authors
4
Name
Order
Citations
PageRank
Muhammad Saleem1614.18
Israr Ullah2412.38
Syed Ali Khayam345033.86
Muddassar Farooq4122183.47