Abouzeid, “Reactive routing overhead in networks with unreliable nodes (2003) [6 citations — 1 self]
Abstract:
This paper presents a new mathematical and simulative framework for quantifying the overhead of a broad class of reactive routing protocols, such as DSR and AODV, in wireless variable topology (ad-hoc) networks. We focus on situations where the nodes are stationary but unreliable, as is common in the case of sensor networks. We explicitly model the application-level traffic in terms of the statistical description of the number of hops between a source and a destination. The sensor network is modelled by an unreliable regular Manhattan (i.e. degree four) grid, and expressions for various components of the routing overhead are derived. Results are compared against ns-2 simulations for regular and random topologies, which corroborate the essential characteristics of the analytical results. One of the key insights that can be drawn from the mathematical results of this paper is that it is possible to design infinitely scalable reactive routing protocols for variable topology networks by judicious engineering of the traffic patterns to satisfy the conditions presented in this paper.
Citations
| 5825 | Introduction to Algorithms – Cormen, Leiserson, et al. - 2001 |
| 894 | A performance comparison of multi-hop wireless ad hoc network routing protocols – Broch, Maltz, et al. - 1998 |
| 410 | The dynamic source routing protocol for mobile ad hoc networks (DSR),” http://www.ietf.org/internetdrafts/draft-ietf-manetdsr-07.txt, February 2002, work in progress – Johnson, Maltz, et al. |
| 299 | Ad hoc ondemand distance vector (AODV) routing,” http://www.ietf.org/internetdrafts/draft-ietfmanet-aodv-10.txt – Perkins, Belding-Royer, et al. |
| 206 | Critical power for asymptotic connectivity in wireless networks,’’ in Stochastic Analysis, Control, and Optimization and Applications: A Volume in Honor of – Gupta, Kumar - 1998 |
| 113 | Caching strategies in on-demand routing protocols for wireless ad hoc networks – Hu, Johnson - 2000 |
| 103 | The number of neighbors needed for connectivity of wireless networks – Xue, Kumar - 2004 |
| 26 | et al., “Embedded Everywhere: A Research Agenda for Networked Systems – Estrin - 2001 |
