Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
A Timed Verification of the IEEE 1394 Leader Election Protocol
Formal Methods in System Design
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model checking the HAVi leader election protocol
Model checking the HAVi leader election protocol
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Analysis of a gossip protocol in PRISM
ACM SIGMETRICS Performance Evaluation Review
The Ins and Outs of the Probabilistic Model Checker MRMC
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC
Electronic Notes in Theoretical Computer Science (ENTCS)
Randomized leader election protocols in noisy radio networks with a single transceiver
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Leader election has been studied intensively in recent years. In this paper, we present an analysis of a randomized leader election using probabilistic model checking with PRISM. We first investigate the quantitative properties of the original protocol such as the expected number of election rounds. Then we modify the protocol so that it consumes less energy and processes with larger energy have higher chance to be elected. The modified protocol is modeled as Markov Decision Process, which allow us to compute minimum and maximum values, interpreting the best- and worst-case performance of the protocol under any scenario.