Achieving loop-free incremental routing in ad hoc networks

H. Rangarajan; J.J. Garcia-Luna-Aceves

doi:10.1109/ISCC.2004.1358402

Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)

Achieving loop-free incremental routing in ad hoc networks

Year: 2004, Volume: 1, Pages: 182-187 Vol.1

DOI Bookmark: 10.1109/ISCC.2004.1358402

Authors

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

Abstract

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.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

Loop-free multipath routing using generalized diffusing computations
Proceedings IEEE INFOCOM'98 Conference on Computer Communications Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies Gateway to the 21st Century
Area-based, loop-free internet routing
Proceedings of INFOCOM '94 Conference on Computer Communications
A new framework for loop-free on-demand routing using destination sequence numbers
2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems
A new approach to on-demand loop-free multipath routing
Proceedings of IC3N'99: Eighth International Conference on Computer Communications and Networks
On-Demand Loop-Free Routing with Link Vectors
Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004.
A loop-free path-finding algorithm: specification, verification and complexity
IEEE Computer and Communications Societies, Annual Joint Conference of the
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks
IEEE Transactions on Parallel & Distributed Systems
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking
RIPPLE: Loop-Free Multi-Path Routing with Minimum Blocking during Convergence
2022 IEEE Future Networks World Forum (FNWF)
Achieving Fast Loop-Free Updates With Ingress Port in Software-Defined Networks
IEEE/ACM Transactions on Networking

Achieving loop-free incremental routing in ad hoc networks

Authors

Abstract

Related Articles