Self-Stabilizing Graph Protocols

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.

• Type: Journal
• Year: 2008
• Where: PPL
• Authors: Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
• Keywords: Dominating Set, Maximal Matching, PPL 2008, Self-stabilizing Algorithms