MOTOR: the MODEST tool environment
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Does clock precision influence ZigBee's energy consumptions?
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Model checking the time to reach agreement
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Analyzing energy consumption in a gossiping MAC protocol
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
Hi-index | 0.00 |
This paper is concerned with the analysis and redesign of a distributed algorithm to monitor the availability of nodes in self-configuring networks. The simple scheme to regularly probe a node 驴 "are you still there?" 驴 may easily lead to over- or underloading. The essence of the algorithm is therefore to automatically adapt the probing frequency. We show that a self-adaptive scheme to control the probe load, originally proposed as an extension to the UPnPTM (Universal Plug and Play) standard, leads to an unfair treatment of nodes: some nodes probe fast while others almost starve. An alternative distributed algorithm is proposed that overcomes this problem and that tolerates highly dynamic network topology changes. The algorithm is very simple and can be implemented on large networks of small computing devices such as mobile phones, PDAs, and so on.