ProSe - A Programming Tool for Rapid Prototyping of Sensor Networks

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative

“…Unlike the algorithms in [6,26,30], our algorithm is deterministic, and designed to run under the classical state-sharing communication model (a.k.a. state model), which allows it to be implemented by using actual compilers [4,11,12,31]. Unlike [27], the size of the ring is arbitrary, the ring is not assumed to be oriented, and the scheduler is distributed.…”

“…Indeed, protocols are typically written in the state model, where the state of each node is read by each of its neighbors. (The use of the state model is motivated by the fact that all existing stabilization-preserving compilers [4,11,12,31] are precisely designed for this model).…”

“…Moreover, these algorithms are designed for a communication model that is more powerful than the classical state model used in this paper. (The state model is the model used in most available compilers for actual networks [4,11,12,31]). More specifically, Mayer et al [30] use the message passing model, and Awerbuch and Ostrovsky [6] use the link-register model, where communications between neighboring nodes are carried out through dedicated registers.…”

Compact self-stabilizing leader election for general networks

“…This classical communication model is called the state model or the state-sharing communication model. This model is also used in stabilization-preserving compilers that produce actual code [6,17,19,38].…”