Semantic Analysis of Gossip Protocols for Wireless Sensor Networks

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols in the context of wireless sensor networks. We introduce a simple probabilistic timed process calculus for modelling wireless sensor networks. A simulation theory is developed to compare probabilistic protocols that have similar behaviour up to a certain probability. This theory is used to prove a number of algebraic laws which revealed to be very effective to evaluate the performances of gossip networks with and without communication collisions.

[1]  Lei Song,et al.  Probabilistic Mobility Models for Mobile and Wireless Networks , 2010, IFIP TCS.

[2]  Nancy A. Lynch,et al.  Proving Approximate Implementations for , 2006 .

[3]  Mario Bravetti,et al.  A Process Algebraic Approach for the Analysis of Probabilistic Non-interference , 2011 .

[4]  Wang Yi,et al.  Testing and Refinement for Nondeterministic and Probabilistic Processes , 1994, FTRTFT.

[5]  Nancy A. Lynch,et al.  Proving Approximate Implementations for Probabilistic I/O Automata , 2007, PDPAR/PaUL@FLoC.

[6]  Boudewijn R. Haverkort,et al.  Formal analysis techniques for gossiping protocols , 2007, OPSR.

[7]  Peng Gao,et al.  Formal Verification and Simulation for Performance Analysis for Probabilistic Broadcast Protocols , 2006, ADHOC-NOW.

[8]  Massimo Merro,et al.  A Calculus for the Analysis of Wireless Network Security Protocols , 2010, Formal Aspects in Security and Trust.

[9]  Roberto Segala,et al.  Approximated Computationally Bounded Simulation Relations for Probabilistic Automata , 2007, 20th IEEE Computer Security Foundations Symposium (CSF'07).

[10]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[11]  Anne-Marie Kermarrec,et al.  Gossiping in distributed systems , 2007, OPSR.

[12]  Boudewijn R. Haverkort,et al.  Mean-Field Analysis for the Evaluation of Gossip Protocols , 2009, QEST.

[13]  Maria Grazia Vigliotti,et al.  Probabilistic Mobile Ambients , 2009, Theoretical Computer Science.

[14]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, REX Workshop.

[15]  Marta Z. Kwiatkowska,et al.  Analysis of a gossip protocol in PRISM , 2008, PERV.

[16]  Carroll Morgan,et al.  Characterising Testing Preorders for Finite Probabilistic Processes , 2007, LICS.

[17]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[18]  Jan Jürjens,et al.  Verifying Cryptographic Code in C: Some Experience and the Csec Challenge , 2011, Formal Aspects in Security and Trust.