Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Prioritized gossip in vehicular networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Regional consecutive leader election in mobile ad-hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Optimal regional consecutive leader election in mobile ad-hoc networks
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Trivial solution for a non-trivial problem in MANETs
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Prioritized gossip in vehicular networks
Ad Hoc Networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
Reprint of "Prioritized gossip in vehicular networks"
Ad Hoc Networks
| Hi-index | 0.00 |
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.