Propagation and leader election in a multihop broadcast environment

Israel Cidon, Osnat Mokryn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.

Original languageEnglish
Title of host publicationDistributed Computing - 12th International Symposium, DISC 1998, Proceedings
EditorsShay Kutten, Shay Kutten
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540650660, 9783540650669
StatePublished - 1998
Externally publishedYes
Event12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece
Duration: 24 Sep 199826 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Symposium on Distributed Computing, DISC 1998

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


  • Broadcast networks
  • Distributed
  • Leader election

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Propagation and leader election in a multihop broadcast environment'. Together they form a unique fingerprint.

Cite this