Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

Abstract

Abstract. Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work, the concept of self-stabilization is applied to WSNs. The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity. This paper proposes problem-independent transformations for algorithms that stabilize under the central daemon scheduler such that they meet the demands of a WSN. The transformed algorithms use randomization and are probabilistically self-stabilizing. This work allows to utilize many known self-stabilizing algorithms in WSNs. The proposed transformations are evaluated using simulations and a real WSN.

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

“…Self-stabilizing algorithms for these two problems based on the central scheduler making at most 2n (resp., (2n + 1)n) moves have been proposed by various authors [6,8]. To make use of these algorithms with a distributed scheduler two transformation techniques are available: randomization [9] and local mutual exclusion [2]. In the first case the algorithms are only probabilistically self-stabilizing and in the second case unique process identifiers are required.…”

Self-Stabilization and Byzantine Tolerance for Maximal Independent Set

“…For instance, in wireless networks, the maximum independent sets can be used as a black box to perform communication (to collect or to broadcast information) (see [21,10] for example). In selfstabilizing distributed algorithms, this problem is also a fundamental tool to transform an algorithm from one model to another [14,29].…”

“…Self-stabilizing algorithms for maximal independent set have been designed in various models (anonymous network [25,29,28] or not [13,17]). Up to our knowledge, Shukla et al [25] present the first algorithm designed for finding a MIS in a graph using self-stabilization paradigm for anonymous networks.…”

Self-stabilizing TDMA algorithms for wireless ad-hoc networks without external reference

“…The proposal in [9] considers shared variable emulation. Several selfstabilizing algorithms adopt this abstraction, e.g., a generalized version of the dining philosophers problem for wireless networks in [6], topology discovery in anonymous networks [19], random distance-k vertex coloring [20], deterministic distance-2 vertex coloring [3], two-hop conflict resolution [25], a transformation from central demon models to distributed scheduler ones [27], to name a few. The aforementioned algorithms assume that if a node transmits infinitely many messages, all of its communication neighbors will receive infinitely many of them.…”