Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-19195-9_7 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Mobile ad hoc network,Ad hoc On-Demand Distance Vector Routing,Computer science,Routing table,Distributed computing,Adversarial system | Conference | 9039 |
ISSN | Citations | PageRank |
0302-9743 | 6 | 0.45 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kedar S. Namjoshi | 1 | 948 | 50.41 |
| Richard J. Trefler | 2 | 222 | 14.59 |