Nianjun Zhou
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.
- C. E. Perkins, E. M. Belding-Royer, and S. R. Das. Ad hoc on-demand distance vector (AODV) routing. Internet Draft draft-ietf-manet-aodv-12.txt, Mobile Ad Hoc Networking Working Group, November 4 2002.]]Google Scholar
- D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva. The dynamic source routing protocol for mobile ad hoc networks (DSR). Internet Draft draft-ietf-manet-dsr-07.txt, IETF MANET Working Group, February 21 2002.]] Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad-hoc network routing protocols. In Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'98), pages 85--97, Dallas, Texas, USA, October 1998.]] Google ScholarDigital Library
- ns-Network Simulator. 1995. http://www.isi.edu/nsnam/ns/.]]Google Scholar
- Y.-C. Hu and D. B. Johnson. Caching strategies in on-demand routing protocols for wireless ad hoc networks. In Proceedings of the sixth annual international conference on Mobile computing and networking, pages 231--242, Boston, Massachusetts, United States, 2000.]] Google ScholarDigital Library
- D. Estrin et al. Embedded Everywhere: A research agenda for networked systems of embedded computers. National Research Council, 2001.]] Google ScholarDigital Library
- P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In W. M. McEneaney, G. Yin, Q. Zhang, and Birkhauser, editors, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, Boston, 1998.]]Google Scholar
- F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. To appear in Wireless Networks.]] Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.]] Google ScholarDigital Library
Index Terms
- Reactive routing overhead in networks with unreliable nodes
Recommendations
A review and a new approach to reduce routing overhead in MANETs
Mobile Ad hoc networks are characterized by a frequently changing in the network topology and the need of an efficient dynamic routing protocol. In this work, we have compared the performance of five ad hoc routing protocols against three different ...
The impact of traffic patterns on the overhead of reactive routing protocols
This paper presents a mathematical and simulative framework for quantifying the overhead of reactive routing protocols, such as dynamic source routing and ad hoc on-demand distance vector, in wireless variable topology (ad hoc) networks. A model of the ...
Comparative Performance Analysis of DSDV, AODV and DSR Routing Protocols in MANET Using NS2
ACE '10: Proceedings of the 2010 International Conference on Advances in Computer EngineeringMobile Ad-Hoc networks are highly dynamic networks characterized by the absence of physical infrastructure. Nodes of these networks functions as a routers which discovers and maintains the routes to other nodes in the network. In such networks, nodes ...
Comments