Election in a complete network with a sense of direction
Information Processing Letters
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
Towards optimal distributed election on chordal rings
Information Processing Letters
Time and message bounds for election in synchronous and asynchronous complete networks
SIAM Journal on Computing
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
Information Sciences—Informatics and Computer Science: An International Journal
Proceedings of the 3rd International Workshop on Distributed Algorithms
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Distributed Computing
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
This paper presents a protocol for leader election in complete networks with a sense of direction. Sense of direction provides nodes the capability of distinguishing between their incident links according to a global scheme. We propose a protocol for leader election which requires O(N) messages and O(log N) time. The protocol is message optimal and the time complexity is a significant improvement over currently known protocols for this problem.