enter search term and/or author name
Introduction to special issue on stabilization, safety, and security of distributed systems
Ajoy K. Datta
Article No.: 1
Fault tolerance measures for large-scale wireless sensor networks
Habib M. Ammari, Sajal K. Das
Article No.: 2
Connectivity, primarily a graph-theoretic concept, helps define the fault tolerance of wireless sensor networks (WSNs) in the sense that it enables the sensors to communicate with each other so their sensed data can reach the sink....
Wireless sensor network (WSN) testbeds are useful because they provide a way to test applications in an environment that makes it easy to deploy experiments, configure them statically or dynamically, and gather performance information. However,...
Optimal message-driven implementations of omega with mute processes
Martin Biely, Josef Widder
Article No.: 4
We investigate the complexity of algorithms in message-driven models. In such models, events in the computation can only be caused by message receptions, but not by the passage of time. Hutle and Widder [2005a] have shown that there is no...
We concentrate on automatic revision of untimed and real-time programs with respect to UNITY properties. The main focus of this article is to identify instances where addition of UNITY properties can be achieved efficiently (in polynomial time)...
Light enabling snap-stabilization of fundamental protocols
Alain Cournier, Stephane Devismes, Vincent Villain
Article No.: 6
In this article, we show that some fundamental self- and snap-stabilizing wave protocols (e.g., token circulation, PIF, etc.) implicitly assume a very light property that we call BreakingIn. We prove that BreakingIn is...
Self-stabilizing philosophers with generic conflicts
Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil
Article No.: 7
We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive...
On bootstrapping topology knowledge in anonymous networks
Toshimitsu Masuzawa, Sébastien Tixeuil
Article No.: 8
In this article, we quantify the amount of “practical” information (i.e., views obtained from the neighbors, colors attributed to the nodes and links) to obtain “theoretical” information (i.e., the local topology of the...
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
Samia Souissi, Xavier Défago, Masafumi Yamashita
Article No.: 9
Reaching agreement among a set of mobile robots is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize and meet at some location not...