期刊
PARALLEL PROCESSING LETTERS
卷 18, 期 1, 页码 189-199出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0129626408003314
关键词
Self-stabilizing protocol; distributed daemon; fault; tolerance; graph algorithms
资金
- NSF [ANI-0218495]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
