Leader election in ad hoc radio networks: a keen ear helps

DOI10.1016/j.jcss.2013.04.003zbMath1311.68028OpenAlexW2003002196MaRDI QIDQ394338

Dariusz R. Kowalski, Andrzej Pelc

Publication date: 27 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.04.003

zbMATH Keywords

deterministic algorithmsdistributed algorithmscollision detectionleader electionradio networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (10)

Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Leader election in well-connected graphs ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Impact of knowledge on election time in anonymous networks ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ Leader election in multi-hop radio networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasting in geometric radio networks
• Families of finite sets in which no set is covered by the union of \(r\) others
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Distributed broadcast in radio networks of unknown topology.
• Centralized asynchronous broadcast in radio networks
• Tree algorithms for packet broadcast channels
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Deterministic broadcasting in ad hoc radio networks
• Efficient algorithms for leader election in radio networks
• Loss-less condensers, unbalanced expanders, and extractors
• Nonrandom binary superimposed codes
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Leader election in ad hoc radio networks: a keen ear helps