Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
From MaRDI portal
Publication:5321682
DOI10.1007/978-3-642-02930-1_43zbMATH Open1248.68065OpenAlexW1766082731MaRDI QIDQ5321682FDOQ5321682
Authors: Dariusz R. Kowalski, Andrzej Pelc 
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_43
Recommendations
Cited In (19)
- Leader election in ad hoc radio networks: a keen ear helps
- Leader election using loneliness detection
- Coordination Problems in Ad Hoc Radio Networks
- What is the use of collision detection (in wireless networks)?
- How much memory is needed for leader election
- Topology recognition and leader election in colored networks
- Title not available (Why is that?)
- Monitoring churn in wireless networks
- Consensus and collision detectors in radio networks
- Title not available (Why is that?)
- Adversary immune leader election in ad hoc radio networks
- Near optimal leader election in multi-hop radio networks
- Maximum Finding in the Symmetric Radio Networks with Collision Detection
- Deterministic Leader Election in Anonymous Radio Networks
- Leader election in multi-hop radio networks
- Leader election in shared spectrum radio networks
- Leader election using loneliness detection
- Round complexity of leader election and gossiping in bidirectional radio networks
- Efficient algorithms for leader election in radio networks
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 Q5321682)
