Leader election in ad hoc radio networks: a keen ear helps
From MaRDI portal
Publication:394338
DOI10.1016/J.JCSS.2013.04.003zbMATH Open1311.68028OpenAlexW2003002196MaRDI QIDQ394338FDOQ394338
Authors: 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
Recommendations
- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
- Leader election in multi-hop radio networks
- Leader election in unreliable radio networks
- Near optimal leader election in multi-hop radio networks
- Brief announcement: Optimal leader election in multi-hop radio networks
- Efficient algorithms for leader election in radio networks
- Adversary immune leader election in ad hoc radio networks
- Leader election in shared spectrum radio networks
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- A lower bound for radio broadcast
- Title not available (Why is that?)
- Broadcasting in undirected ad hoc radio networks
- Families of finite sets in which no set is covered by the union of \(r\) others
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Tree algorithms for packet broadcast channels
- 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
- Title not available (Why is that?)
- Distributed broadcast in radio networks of unknown topology.
- Centralized asynchronous broadcast in radio networks
- Deterministic broadcasting in ad hoc radio networks
- Efficient algorithms for leader election in radio networks
- Loss-less condensers, unbalanced expanders, and extractors
- Broadcasting in geometric radio networks
Cited In (23)
- Leader election using loneliness detection
- Leader election in well-connected graphs
- What is the use of collision detection (in wireless networks)?
- Impact of knowledge on election time in anonymous networks
- Brief announcement: Leader election in SINR model with arbitrary power control
- Consensus and collision detectors in radio networks
- Deterministic size discovery and topology recognition in radio networks with short labels
- Title not available (Why is that?)
- Quasi-optimal energy-efficient leader election algorithms in radio networks
- Adversary immune leader election in ad hoc radio networks
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Brief announcement: Optimal leader election in multi-hop radio networks
- Leader election in unreliable radio networks
- Near optimal leader election in multi-hop radio networks
- Deterministic Leader Election in Anonymous Radio Networks
- Leader election in multi-hop radio networks
- Four shades of deterministic leader election in anonymous networks
- Finding the size and the diameter of a radio network using short labels
- Leader election for anonymous asynchronous agents in arbitrary networks
- Leader election in shared spectrum radio networks
- Leader election using loneliness detection
- Leader election in SINR model with arbitrary power control
- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
This page was built for publication: Leader election in ad hoc radio networks: a keen ear helps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394338)
