Reactive Routing Overhead in Networks with Unreliable Nodes

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2003, Pages 147-160

  Zhou, Nianjun ^a   Wu, Huaming ^a   Abouzeid, Alhussein A ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Ad hoc networks; AODV; DSR; Reactive routing; Reliability; Routing overhead; Sensor networks

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; NETWORK PROTOCOLS; ROUTERS; SENSORS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

REACTIVE ROUTING; ROUTING OVERHEAD; SENSOR NETWORKS;

COMPUTER NETWORKS;

EID: 1542358980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/938985.939001     Document Type: Conference Paper

References (9)

1. 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.
2. 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.
3. 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.
4. ns-Network Simulator. 1995. http://www.isi.edu/nsnam/ns/.
5. 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.
6. D. Estrin et al. Embedded Everywhere: A research agenda for networked systems of embedded computers. National Research Council, 2001.
7. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In W. M. McEneaney, G. Yin, Q. Zhang, and Birkhäuser, editors, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, Boston, 1998.
8. F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. To appear in Wireless Networks.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.