Conference Paper

Self-Stabilization by Local Checking and Global Reset (Extended Abstract).

DOI: 10.1007/BFb0020443 Conference: Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings
Source: DBLP

ABSTRACT We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., be come self-stabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any self-stabilizing internal reset protoco l, any locally-checkable protocol can be made self-stabilizing. Our proof is construct ive in the sense that we provide explicit code. The method applies to many practical network problems, including spanning tree construction, topology update, an d virtual circuit setup.

0 Bookmarks
 · 
36 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An abstract is not available.
    01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present fault detectors for transient faults, (i.e., corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks (i.e., the problem to be solved) from failure detectors for implementations (i.e., the algorithm that solves the problem). The aim of our fault detectors is to detect a memory corruption as soon as possible. We study the amount of memory needed by the fault detectors for some specific tasks, and give bounds for each task. The amount of memory is related to the size and the number of views that a processor has to maintain to ensure a quick detection. This work may give the implementation designer hints concerning the techniques and resources that are required for implementing a task.
    Distributed Computing 06/2007; 20(1):39-51. · 0.63 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A commonly desired feature of large-scale, multihop, wireless sensor networks (WSNs) is the ability to reconfigure them after deployment. This reconfiguration could be as simple as changing a single parameter or as complex as replacing the entire application. Several protocols have been proposed to enable reconfiguration in WSNs, most of which use version numbers to distinguish new configurations from old ones. Due to constraints on memory and message sizes, version numbers are bounded and use wraparound arithmetic to handle rollover. While this simple scheme works well in the common case, we identify in this paper, a serious version management problem in existing protocols due to which a reconfiguration operation may never stabilize. We analyze potential causes of this problem and its effects on the quality and lifetime of the network. Through extensive simulations and experiments, we demonstrate the significant likelihood of this problem occurring in real deployments. Finally, we provide a solution to this problem using a novel approach which we call Human-In-The-Loop stabilization. Our stabilizing reconfiguration protocol uses local detectors and correctors that can detect version inconsistencies and prevent their propagation in a timely and efficient manner, while ultimately allowing the human operator to restore the network to the correct configuration. Our simulations and experiments also demonstrate the performance benefits of our solution over previous, nonstabilizing protocols.
    Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006. IEEE International Conference on; 07/2006

Full-text

View
0 Downloads