An Efficient Loop-free Version of AODVv2
Behnaz Yousefi, Fatemeh Ghassemi
TL;DR
This paper introduces a new loop-free version of the AODVv2 routing protocol for MANETs, addressing previous loop formation issues and enhancing network performance.
Contribution
The paper proposes a modified AODVv2 protocol that guarantees loop freedom and improves routing efficiency in mobile ad-hoc networks.
Findings
Counterexamples show loop formation in existing AODVv2 versions
Proposed protocol ensures loop freedom
Performance improvements over previous versions
Abstract
Ad hoc On Demand distance Vector (AODV) routing protocol is one of the most prominent routing protocol used in Mobile Ad-hoc Networks (MANETs). Due to the mobility of nodes, there exists many revisions as scenarios leading to the loop formation were found. We demonstrate the loop freedom property violation of AODVv2-11, AODVv2-13, and AODVv2-16 through counterexamples. We present our proposed version of AODVv2 precisely which not only ensures loop freedom but also improves the performance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Cooperative Communication and Network Coding · Vehicular Ad Hoc Networks (VANETs)