On the accuracy of MANET simulators
Proceedings of the second ACM international workshop on Principles of mobile computing
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Modeling the performance of flooding in wireless multi-hop Ad hoc networks
Computer Communications
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Analysis of a gossip protocol in PRISM
ACM SIGMETRICS Performance Evaluation Review
Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols
Methods, Models and Tools for Fault Tolerance
Formally verified authenticated query dissemination in sensor networks
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
ACM Computing Surveys (CSUR)
Semantic analysis of gossip protocols for wireless sensor networks
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Analysing robot swarm behaviour via probabilistic model checking
Robotics and Autonomous Systems
A state-based model of sensor protocols
Theoretical Computer Science
Probabilistic graph transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
LTL model checking of interval markov chains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Tulip: model checking probabilistic systems using expectation maximisation algorithm
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
This paper describes formal probabilistic models of flooding and gossiping protocols, and explores the influence of different modeling choices and assumptions on the results of performance analysis. We use Prism, a model checker for probabilistic systems, for the formal analysis of protocols and small network topologies, and use in addition Monte-Carlo simulation, implemented in Matlab, to establish if the results and effects found during formal analysis extend to larger networks. This combination of approaches has several advantages. The formal model has well defined synchronisation primitives with clear semantics for modeling synchronous and asynchronous communication between nodes. Model checking of the probabilistic model determines exact probabilities and performance bounds, even if the model is non-deterministic; results that cannot be obtained by simulation. However, Monte-Carlo simulation can then be used in addition to study effects that only emerge in larger networks, such as phase transition.