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
 · 
39 Views
  • 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
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An abstract is not available.
    01/2010;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A new paradigm for the design of self-stabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in defining a local condition based on the state of a processor and its immediate neighborhood such that the system is in a globally legal state if and only if the local condition is satisfied at all the nodes. In this work we also extend the model of self-stabilizing networks traditionally assuming memory failure to include the model of dynamic networks (assuming edge failures and recoveries). We apply the paradigm to the extended model which we call “dynamic self-stabilizing networks”. Without loss of generality, we present the results in the least restrictive shared memory model of read/write atomicity, to which end we construct basic information transfer primitives.Using local detection, we develop deterministic and randomized self-stabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically. The deterministic algorithm assumes unique identities while the randomized assumes an anonymous network. The algorithms use a constant number of memory words per edge in each node; and both the size of memory words and of messages is the number of bits necessary to represent a node identity (typically O(log n) bits where n is the size of the network). These algorithms provide for the easy construction of self-stabilizing protocols for numerous tasks: reset, routing, topology-update and self-stabilization transformers that automatically self-stabilize existing protocols for which local detection conditions can be defined.
    Theoretical Computer Science 06/2001; · 0.49 Impact Factor

Full-text

View
0 Downloads