The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The existence of refinement mappings
Theoretical Computer Science
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Self-stabilizing depth-first search
Information Processing Letters
Forward and backward simulations I.: untimed systems
Information and Computation
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Transformations of Self-Stabilizing Algorithms
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A Network-Centric Approach to Embedded Software for Tiny Devices
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
On a Space-Optimal Distributed Traversal Algorithm
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A self-stabilizing quorum-based protocol for maxima computing
Distributed Computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Military communications systems and technologies
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A case study on prototyping power management protocols for sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Algorithms and theory of computation handbook
"Slow is fast" for wireless sensor networks in the presence of message losses
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
A state-based model of sensor protocols
Theoretical Computer Science
Formal approach to guard time optimization for TDMA
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.25 |
Dependable properties such as self-stabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed systems where such self-stabilizing algorithms have been designed. Since these existing algorithms are designed in read/write model (or variations thereof), they cannot be directly applied in sensor networks. For this reason, we consider a new atomicity model, write all with collision (WAC), that captures the computations of sensor networks and focus on transformations from read/write model to WAC model and vice versa. We show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing.