Skip to Main content Skip to Navigation
Conference papers

Loop Freedom in AODVv2

Abstract : The AODV protocol is used to establish routes in a mobile, ad-hoc network (MANET). The protocol must operate in an adversarial environment where network connections and nodes can be added or removed at any point. While the ability to establish routes is best-effort under these conditions, the protocol is required to ensure that no routing loops are ever formed. AODVv2 is currently under development at the IETF, we focus attention on version 04. We detail two scenarios that show how routing loops may form in AODVv2 routing tables. The second scenario demonstrates a problem with the route table update performed on a Broken route entry. Our solution to this problem has been incorporated by the protocol designers into AODVv2, version 05. With the fix in place, we present an inductive and compositional proof showing that the corrected core protocol is loop-free for all valid configurations.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01767329
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 10:18:50 AM
Last modification on : Monday, April 16, 2018 - 10:20:25 AM

File

978-3-319-19195-9_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Kedar Namjoshi, Richard Trefler. Loop Freedom in AODVv2. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.98-112, ⟨10.1007/978-3-319-19195-9_7⟩. ⟨hal-01767329⟩

Share

Metrics

Record views

131

Files downloads

151