Efficient leader election using sense of direction

Gurdip Singh

doi:10.1007/s004460050033

Efficient leader election using sense of direction

Gurdip Singh

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	159-165
Number of pages	7
Journal	Distributed Computing
Volume	10
Issue number	3
DOIs	https://doi.org/10.1007/s004460050033
State	Published - 1997
Externally published	Yes

Keywords

Complete networks
Distributed algorithm
Leader election
Message complexity

ASJC Scopus subject areas

Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computational Theory and Mathematics

Access to Document

10.1007/s004460050033

Cite this

@article{d91bf39e6b0f4f668af53f74c8e31690,

title = "Efficient leader election using sense of direction",

abstract = "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.",

keywords = "Complete networks, Distributed algorithm, Leader election, Message complexity",

author = "Gurdip Singh",

year = "1997",

doi = "10.1007/s004460050033",

language = "English (US)",

volume = "10",

pages = "159--165",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "3",

}

TY - JOUR

T1 - Efficient leader election using sense of direction

AU - Singh, Gurdip

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Complete networks

KW - Distributed algorithm

KW - Leader election

KW - Message complexity

UR - http://www.scopus.com/inward/record.url?scp=0031117721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031117721&partnerID=8YFLogxK

U2 - 10.1007/s004460050033

DO - 10.1007/s004460050033

M3 - Article

AN - SCOPUS:0031117721

SN - 0178-2770

VL - 10

SP - 159

EP - 165

JO - Distributed Computing

JF - Distributed Computing

IS - 3

ER -

Efficient leader election using sense of direction

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this