An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing（2009）
摘要
An algorithm for electing a leader in an asynchronous network with dynamically changing communication topology is presented. The algorithm ensures that, no matter what pattern of topology changes occur, if topology changes cease, then eventually every connected component contains a unique leader. The algorithm combines ideas from the Temporally Ordered Routing Algorithm (TORA) for mobile ad hoc networks [16] with a wave algorithm [21], all within the framework of a height-based mechanism for reversing the logical direction of communication links [6]. It is proved that in certain well-behaved situations, a new leader is not elected unnecessarily.
更多查看译文
关键词
new leader,dynamic network,asynchronous network,communication topology,asynchronous leader election algorithm,certain well-behaved situation,connected component,topology change,temporally ordered routing algorithm,wave algorithm,unique leader,communication link,lead,topology,probability density function,ad hoc networks,distributed computing,mobile ad hoc network,routing,mobile ad hoc networks,data mining,ad hoc network,leader election,mobile communication,wireless sensor networks,network topology
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要