Self-Stabilizing Graph Protocols

13 years 4 months ago

Download www.cs.clemson.edu

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.

Wayne Goddard, Stephen T. Hedetniemi, David Pokras

Real-time Traffic

Dominating Set | Maximal Matching | PPL 2008 | Self-stabilizing Algorithms |

claim paper

» SelfStabilizing Anonymous Leader Election in a Tree

» Distributed SelfStabilizing Placement of Replicated Resources in Emerging Networks

» Selfoptimizing DHTs Using Request Profiling

» Memory Space Requirements for SelfStabilizing Leader Election Protocols

» Resource Bounds for Self Stabilizing Message Driven Protocols

» Fast and Lean SelfStabilizing Asynchronous Protocols

» A Fully Dynamic and SelfStabilizing TDMA Scheme for Wireless Adhoc Networks

» EnergyAware SelfStabilization in Mobile Ad Hoc Networks A Multicasting Case Study

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	PPL
Authors	Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu

Comments (0)

Sciweavers

Self-Stabilizing Graph Protocols

Dominating Set | Maximal Matching | PPL 2008 | Self-stabilizing Algorithms |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers