loading...
Achieving loop-free incremental routing in ad hoc networks
Alexandria, Egypt June 28-July 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358402Ninth IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
H. Rangarajan, Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
J.J. Garcia-Luna-Aceves, Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
We present the dynamic incremental routing (DIR) protocol, which features instantaneous loop-free routing of data packets based on their destination addresses (hop-by-hop routing). Loop-free routes are maintained by using "feasible distances" to order the nodes with respect to a destination. Simulation results show that the performance of DIR is much better than the performance of AODV, DSR and OLSR, which are indicative of the state of the art in routing protocols.
Citation:
H. Rangarajan, J.J. Garcia-Luna-Aceves, "Achieving loop-free incremental routing in ad hoc networks," iscc, vol. 1, pp.182-187, Ninth IEEE Symposium on Computers and Communications 2004 Volume 1 (ISCC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.