Analysis of DSR Protocol in Event-B - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Analysis of DSR Protocol in Event-B

(1) , (1)
1

Abstract

This paper presents an incremental formal development of the Dynamic Source Routing (DSR) protocol in Event-B. DSR is a reactive routing protocol, which finds a route for a destination on demand, whenever communication is needed. Route discovery is an important task of any routing algorithm and formal specification of it, itself is a challenging problem. The specification is performed in a stepwise manner composing more advanced routing components between the abstract specification and topology. It is verified through a series of refinements. The specification includes safety properties as set of invariants, and liveness properties that characterize when the system reaches stable states. We establish these properties by proof of invariants, event refinement and deadlock freedom. The consequence of this incremental approach helps to achieve a high degree of automatic proof. Our approach can be useful for formalizing and developing other kinds of reactive routing protocols (i.e. AODV etc.).
Not file

Dates and versions

inria-00637768 , version 1 (02-11-2011)

Identifiers

  • HAL Id : inria-00637768 , version 1

Cite

Dominique Méry, Neeraj Kumar Singh. Analysis of DSR Protocol in Event-B. 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), Oct 2011, Grenoble, France. pp.401-415. ⟨inria-00637768⟩
194 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More