Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Consensus and collision detectors in radio networks
 
Loading...
Thumbnail Image
research article

Consensus and collision detectors in radio networks

Chockler, Gregory
•
Demirbas, Murat
•
Gilbert, Seth
Show more
2008
Distributed Computing

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of each other. In a novel break from existing work, we introduce a collision-prone communication model in which each node may lose an arbitrary subset of the messages sent by its neighbors during each round. This model is motivated by behavior observed in empirical studies of these networks. To cope with this communication unreliability we augment nodes with receiver-side collision detectors and present a new classification of these detectors in terms of accuracy and completeness. This classification is motivated by practical realities and allows us to determine, roughly speaking, how much collision detection capability is enough to solve the consensus problem efficiently in this setting. We consider nine different combinations of completeness and accuracy properties in total, determining for each whether consensus is solvable, and, if it is, a lower bound on the number of rounds required. Furthermore, we distinguish anonymous and non-anonymous protocols-where "anonymous" implies that devices do not have unique identifiers-determining what effect (if any) this extra information has on the complexity of the problem. In all relevant cases, we provide matching upper bounds.

  • Details
  • Metrics
Type
research article
DOI
10.1007/s00446-008-0056-2
Web of Science ID

WOS:000256080200004

Author(s)
Chockler, Gregory
•
Demirbas, Murat
•
Gilbert, Seth
•
Lynch, Nancy
•
Newport, Calvin
•
Nolte, Tina
Date Issued

2008

Published in
Distributed Computing
Volume

21

Start page

55

End page

84

Subjects

wireless ad hoc networks

•

consensus

•

collision detectors

•

fault-tolerance

•

Contention Resolution

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
IC  
Available on Infoscience
November 30, 2010
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/61381
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés