Automatized Verification of Ad Hoc Routing Protocols

Wibling, Oskar; Parrow, Joachim; Pears, Arnold

doi:10.1007/978-3-540-30232-2_22

Cited by 45 publications

(38 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The simplifications are similar to those in the SPIN model by Wibling et al [32], although we do not model timeouts. Their model [31] is ca 250 lines of SPIN code (excluding comments) while ours is approximately 30 lines.…”

Section: Resultsmentioning

confidence: 99%

Broadcast Psi-calculi with an Application to Wireless Protocols

Borgström

Huang

Johansson

et al. 2011

Software Engineering and Formal Methods

Self Cite

View full text Add to dashboard Cite

Psi-calculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication in order to model wireless protocols. The additions preserve the purity of the psi-calculi semantics, and we formally prove the standard congruence and structural properties of bisimilarity. We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.

show abstract

Section: Resultsmentioning

confidence: 99%

Broadcast Psi-calculi with an Application to Wireless Protocols

Borgström

Huang

Johansson

et al. 2011

Software Engineering and Formal Methods

Self Cite

View full text Add to dashboard Cite

show abstract

“…MANET protocols have been studied either using existing formalisms such as SPIN [5,26,1] and UPPAAL [26,27,15,8], or introducing specific frameworks mainly with an algebraic approach [20,21,18,13,17,23,14,7]. Important modeling challenges in MANETs are local broadcast, underlying topology and mobility.…”

Section: Related Workmentioning

confidence: 99%

“…The correct operation of MANET routing protocols is defined as follows [26]: If from some point in time on there exists a path between two nodes, then the protocol must be able to find some path between the nodes. Furthermore, when a path has been found, and for the time it stays valid, it must be possible to send packets along the path from the source node to the destination node.…”

Section: Protocol Analysis With Cactlmentioning

confidence: 99%

Model Checking MANETs with Arbitrary Mobility

Ghassemi

Ahmadi

Fokkink³

et al. 2013

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multihop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing power for CLTSs as our logical framework.

show abstract

“…The authors were able to achieve 98% of correctness for the 5-node model of WARP. Wibling et al (2004) have evaluated two model checking tools SPIN and UPPAAL on Lightweight Underlay Network Ad hoc Routing Protocol (LUNAR) to verify the properties specified in the ad hoc protocol. The authors verified for the absence of deadlock, data and control flow message requirements using SPIN model checker and the timing constraints were verified using UPPAAL tool.…”

Section: Related Workmentioning

confidence: 99%

Formal Verification of Safety Message Dissemination Protocol for Vanets

Berlin

Anand

2013

Journal of Computer Science

View full text Add to dashboard Cite

This paper presents a formal verification of a safety message dissemination protocol used in vehicular adhoc networks. It is proposed to use Road Side Units to broadcast road hazard information to vehicles travelling on highways. Quick dissemination of road hazard information, like road blocks, slippery roads and other obstacles can help to prevent road accidents and improve passenger safety. Formal verification is a mathematical approach that helps developers to validate the protocol and correct design errors. The well known model checker, SPIN has been used to model the possible behavior of the protocol and provide formal verification of the correctness of the protocol.

show abstract

Automatized Verification of Ad Hoc Routing Protocols

Cited by 45 publications

References 15 publications

Broadcast Psi-calculi with an Application to Wireless Protocols

Broadcast Psi-calculi with an Application to Wireless Protocols

Model Checking MANETs with Arbitrary Mobility

Formal Verification of Safety Message Dissemination Protocol for Vanets

Contact Info

Product

Resources

About