Distance-k Information in Self-stabilizing Algorithms

  title={Distance-k Information in Self-stabilizing Algorithms},
  author={Wayne Goddard and Stephen T. Hedetniemi and David Pokrass Jacobs and Vilmar Trevisan},
Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general polynomial transformation for constructing self-stabilizing algorithms which utilize distance-shape k knowledge, with a slowdown of nO(log k). Our main application is a polynomial-time self-stabilizing algorithm for finding maximal irredundant sets, a… 

Distance- k knowledge in self-stabilizing algorithms

A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing

This paper presents a self-stabilizing algorithm for computing a maximal k-packing in a general graph that improves the memory requirement compared to the previous most memory efficient algorithm which used k variables per node.

The South Zone: Distributed Algorithms for Alliances

Novel results on and efficient deterministic as well as randomized synchronous message-passing distributed algorithms for generalized graph alliances, a new concept incorporating and expanding previous ones, interested in finding minimal alliances of generalized type.

On self-stabilization of multi point relays for connected dominating set in adhoc networks

  • R. Misra
  • Computer Science
    TENCON 2009 - 2009 IEEE Region 10 Conference
  • 2009
This work introduces a reverse selection heuristics and provided self-stabilization(SS) to MPR-based CDS algorithm and provides tolerance to SS-MPR-CDS based virtual backbone from transient changes in topology.

Self-stabilizing philosophers with generic conflicts

This work presents a self-stabilizing deterministic algorithm—GDP that solves the classic dining philosophers problem and extends the algorithm to handle a similarly generalized drinking philosophers and the committee coordination problem.

Conflict Managers for Self-stabilization without Fairness Assumption

It is argued that conflict managers are a useful mechanism to transform a large class of self-stabilizing algorithms that operate in an essentially sequential model, into self-Stabilizing algorithm that operation in a completely asynchronous distributed model.

Self-stabilizing wavelets and ϱ-hops coordination

  • C. BoulinierF. Petit
  • Computer Science
    2008 IEEE International Symposium on Parallel and Distributed Processing
  • 2008
This paper proposes a self-stabilizing sigma-barrier synchronization protocol based on the wavelet scheme and shows that the protocol provides an efficient device in the design of local coordination problems at distance sigma, such as the s Sigma-local resource allocation (LRA).

Location Updates of Mobile Node in Wireless Sensor Networks

  • R. MisraC. Mandal
  • Computer Science
    2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
  • 2009
The simulation shows that the weighted CDS method for mobile-nodes achieve 40\% reduction in location maintenance using to shortest-hop path in CDS.



Distance-two information in self-stabilizing algorithms

A general mechanism that allows a node to act only on correct distance-two knowledge, provided there are IDs is introduced, and an algorithm for maximal 2-packing which is guaranteed to stabilize in polynomial moves under a central daemon is obtained.

A Self-stabilizing Algorithm for Maximal 2-packing

This paper presents an ID-based, self-stabilizing algorithm for finding a maximal 2-packing, a non-local property, in an arbitrary graph, and shows how to use Markov analysis to analyse the behaviour of the non-ID-based version of the algorithm.

Self-stabilizing Algorithms for f k g-domination

This paper presents self-stabilizing algorithms for nding a minimal fkg-dominating function in an arbitrary graph and proposes a linear time self-Stabilizing algorithm for the case that k = 2.

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs†

This work provides self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set, a maximal k-packing, and a maximal strong matching.

A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph

This work proposes a new self-stabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph and shows how the basic ideas behind the proposed protocol can be generalized to solve other related problems.

Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler

A self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology is proposed and it is proved that this solution needs in average only one trial per processor.

Maximal Matching Stabilizes in Quadratic Time

  • G. Tel
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1994

Uniform Dynamic Self-Stabilizing Leader Election

This work introduces self-stabilizing protocols for synchronization that are used as building blocks by the leader-election algorithm and presents a simple, uniform, self-Stabilizing ranking protocol.

Maximal matching stabilizes in time O(m)