Election in a complete network with a sense of direction
Information Processing Letters
Making distributed spanning tree algorithms fault-resilient
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Efficiency of Synchronous Versus Asynchronous Distributed Systems
Journal of the ACM (JACM)
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Leader election in the presence of link failures (abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Leader election protocols for radio networks
Handbook of wireless networks and mobile computing
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
| Hi-index | 0.00 |
This paper presents protocols for leader election in complete networks. The protocols are message optimal and their time complexities are a significant improvement over currently known protocols for this problem. For asynchronous complete networks with sense of direction, we propose a protocol which requires O(N) messages and O(log N) time. For asynchronous complete network without sense of direction, we show that &Ohgr;(N/log N) is a lower bound on the time complexity of any message optimal election protocol and we present a family of protocols which requires O(Nk) messages and O(N/k) time, log N ≤ k ≤ N. Our results also improve the time complexity of several other related problems such as spanning tree construction, computing a global function, etc.