Formal Verification of Routing Protocols for Wireless Ad Hoc Networks

Routing is one of the most basic and important tasks in a collaborative computer network. Having a correct, robust, and efficient routing protocol is fundamental to any wireless network. However, a difficult problem is how to guarantee these desirable qualities. Neither simulations nor testbed implementations can ensure the quality required for these protocols. As an alternative to these methods, some researchers have successfully investigated the use of formal verification as a mean to guarantee the quality of routing protocols. Formal verification is a technique that assures a system has, or has not, a given property, based on a formal specification of the system under evaluation. This technique has proved to be a valuable tool, even contradicting some authors’ claims and informal proofs. This chapter presents the main tools, proposals, and techniques available to perform formal verification of routing algorithms for wireless ad hoc networks.

[1]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[2]  Fred L. Templin,et al.  Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) , 2004, RFC.

[3]  Anthony Hall,et al.  Seven myths of formal methods , 1990, IEEE Software.

[4]  Oskar Wibling,et al.  Ad hoc routing protocol validation , 2005 .

[5]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[6]  Ming T. Liu,et al.  Protocol verification using reachability analysis: the state space explosion problem and relief strategies , 1987, Computer Communication Review.

[7]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[8]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[9]  Mark R. Greenstreet,et al.  Formal verification in hardware design: a survey , 1999, TODE.

[10]  Jonathan Billington,et al.  An Abstract Model of Routing in Mobile Ad Hoc Networks , 2005 .

[11]  David L. Dill,et al.  Counter-Example Based Predicate Discovery in Predicate Abstraction , 2002, FMCAD.

[12]  F. de Renesse,et al.  Formal verification of ad-hoc routing protocols using SPIN model checker , 2004, Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference (IEEE Cat. No.04CH37521).

[13]  Tadao Murata,et al.  Modeling and simulation of routing protocol for mobile ad hoc networks using colored petri nets , 2002, FME 2002.

[14]  E. Allen Emerson,et al.  From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking , 1999, CHARME.

[15]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[16]  Sérgio Vale Aguiar Campos,et al.  Compositional Reasoning in Model Checking , 1997, COMPOS.

[17]  Dawson R. Engler,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Cmc: a Pragmatic Approach to Model Checking Real Code , 2022 .

[18]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[19]  Gerard J. Holzmann,et al.  An improvement in formal verification , 1994, FORTE.

[20]  Jonathan P. Bowen,et al.  Seven More Myths of Formal Methods , 1995, IEEE Softw..

[21]  Lars Michael Kristensen,et al.  Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad Hoc Networks , 2004, SoftSpez Final Report.

[22]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[23]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[24]  Michael Goldsmith,et al.  A Methodology for Model-Checking Ad-hoc Networks , 2003, SPIN.

[25]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[26]  Luc J. M. Claesen,et al.  A symbolic core approach to the formal verification of integrated mixed-mode applications , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[27]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[28]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[29]  Arnold Pears,et al.  Ad Hoc Routing Protocol Verification Through Broadcast Abstraction , 2005, FORTE.

[30]  Marta Z. Kwiatkowska,et al.  A Timing Analysis of AODV , 2005, FMOODS.

[31]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

[32]  Laurie L. Hill,et al.  The Orange Book , 2005, Nature Reviews Drug Discovery.

[33]  Miriam Leeser,et al.  Toward a Super Duper Hardware Tactic , 1993, HUG.

[34]  Levente Buttyán,et al.  Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks , 2005, ESAS.

[35]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[36]  Carl A. Gunter,et al.  Formal verification of standards for distance vector routing protocols , 2002, JACM.

[37]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[38]  Antonio Alfredo Ferreira Loureiro,et al.  Methodology for Formal Verification of Routing Protocols for Ad Hoc Wireless Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.