Self-Stabilizing Graph Protocols

13 years 5 months ago
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.
Wayne Goddard, Stephen T. Hedetniemi, David Pokras
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)