Leader election using loneliness detection

DOI10.1007/s00446-012-0172-xzbMath1257.68035OpenAlexW2062993367MaRDI QIDQ1938387

Mohsen Ghaffari, Srikanth Sastry, Nancy A. Lynch

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1721.1/121484

zbMATH Keywords

leader electiondeterministic leader electionloneliness detectionprobabilistic leader electionsingle-hop radio networksstrong collision detectionweak collision detection

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14)

Related Items (5)

Transmitting once to elect a leader on wireless networks ⋮ Approximate Neighbor Counting in Radio Networks ⋮ Leader Election Using Loneliness Detection ⋮ Leader election in multi-hop radio networks ⋮ Noisy beeping networks

Cites Work

• Unnamed Item
• Distributed broadcast in radio networks of unknown topology.
• The Theory of Timed I/O Automata, Second Edition
• Tree algorithms for packet broadcast channels
• What Is the Use of Collision Detection (in Wireless Networks)?
• The Abstract MAC Layer
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Leader election using loneliness detection