Modelling and verifying the AODV routing protocol

@article{Glabbeek2015ModellingAV,
  title={Modelling and verifying the AODV routing protocol},
  author={Rob J. van Glabbeek and Peter H{\"o}fner and Marius Portmann and Wee Lum Tan},
  journal={Distributed Computing},
  year={2015},
  volume={29},
  pages={279-315}
}
This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of mobile ad hoc networks and wireless mesh network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol… Expand
An Efficient Loop-free Version of ADOVv2
TLDR
This work presents their proposed version of AODVv2 precisely which not only ensures loop freedom but also improves the performance. Expand
Modeling and efficient verification of wireless ad hoc networks
TLDR
An actor-based modeling language is presented with the aim to model MANETs and it is illustrated the applicability of the framework through two routing protocols, namely flooding and AODVv2-11, and how efficiently their state spaces can be reduced by the proposed techniques. Expand
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)
This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and dataExpand
Adaptive Formal Framework for WMN Routing Protocols
TLDR
This model uses Uppaal SMC to identify the main common components of routing protocols, capturing timing aspect of protocols, communication between nodes, probabilities of message loss and link breakage, etc. Expand
AODVv2: Performance vs. Loop Freedom
We compare two evolutions of the Ad-hoc On-demand Distance Vector (AODV) routing protocol, i.e. DYMO and AODVv2-16. In particular, we apply statistical model checking to investigate the performanceExpand
Simulation based comparison of routing protocols in wireless multihop adhoc networks
TLDR
This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs) and results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. Expand
Implementation and Performance Assessment of Location-based Routing Protocols for MANETs
TLDR
A thorough assessment of the performance achieved by three routing protocols under different conditions depending on: 1) the node density (i.e sparse and dense networks), 2) the mobility pattern ( i.e pedestrian and vehicular nodes) and 3) the payload length (e.g. data coming from sensors wrt. regular data traffic). Expand
Formal Analysis of Network Routing Protocols
TLDR
The objective of this dissertation is to study different routing protocols of wireless mesh networks using formal techniques as well as to propose a generic framework to formally model, analyse and verify such protocols as the ultimate goal. Expand
Reliable Restricted Process Theory
TLDR
This work examines the effects of this adaptation on the semantics of the framework with regard to the non-blocking property of communication in MANETs, the notion of behavioral equivalence relation and its axiomatization, and introduces a novel proof process, based on a precongruence relation. Expand
Geographic forwarding rules to reduce broadcast redundancy in mobile ad hoc wireless networks
TLDR
This paper proposes a new decentralized technique, called geographic forwarding rules (GFRs), to reduce the number of broadcast messages in mobile ad hoc networks, and uses the location information of nodes to divide the network into virtual zones, to avoid duplicate retransmissions between the zones. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 78 REFERENCES
A rigorous analysis of AODV and its variants
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector routing protocol using a formal specification in AWN (Algebra for Wireless Networks), a process algebra which has been specifically tailored for the modelling of Mobile Ad Hoc Networks and Wireless Mesh Network protocols. Expand
The proof of AODV loop freedom
TLDR
This paper gives a formal description of the AODV protocol and presents a strictly formal proof of its loop freedom property in Isabelle/HOL, demonstrating the feasibility of completely formal verification of some properties of routing protocols with reasonable effort. Expand
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group is presented. Expand
A Timing Analysis of AODV
TLDR
This work considers the Ad hoc On Demand Distance Vector protocol, a reactive protocol currently undergoing standardisation at the IETF (RFC3561), and applies the real-time model checker Uppaal to consider the effect of the protocol parameters on the timing behaviour of AODV, thus complementing the earlier untimed verification effort. Expand
Automated Analysis of AODV Using UPPAAL
TLDR
An automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector routing protocol, a popular protocol used in wireless mesh networks, using the UPPAAL model checker to automatically locate problematic and undesirable behaviours. Expand
Formal verification of standards for distance vector routing protocols
TLDR
This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally. Expand
Making on-demand routing protocols based on destination sequence numbers robust
TLDR
A new approach is presented for the handling of sequence numbers in AODV that eliminates the use of delete periods for destination-based sequence numbers, and it is shown that the new approach performs the same as or better than A ODV. Expand
Performance comparison of two on-demand routing protocols for ad hoc networks
  • Samir R Das, C. Perkins, E. Belding-Royer
  • Computer Science
  • Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials. Expand
Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols
TLDR
The performance of OLSR with the performance of basic link state protocols using full flooding and the performance in two radio network model: the random graph model and the unit graph model is analyzed. Expand
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)
This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and dataExpand
...
1
2
3
4
5
...