Summary.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 1995 / Accepted December 1996
Rights and permissions
About this article
Cite this article
Singh, G. Efficient leader election using sense of direction. Distrib Comput 10, 159–165 (1997). https://doi.org/10.1007/s004460050033
Issue Date:
DOI: https://doi.org/10.1007/s004460050033