Quasi-optimal energy-efficient leader election algorithms in radio networks
From MaRDI portal
Publication:879595
DOI10.1016/J.IC.2006.10.001zbMATH Open1115.68165OpenAlexW4301383268MaRDI QIDQ879595FDOQ879595
Authors: Christian Lavault, Jean-François Marckert, Vlady Ravelomanana
Publication date: 14 May 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.10.001
Recommendations
Cites Work
- Title not available (Why is that?)
- The collision channel without feedback
- Mellin transforms and asymptotics: Harmonic sums
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Multiple Communication in Multihop Radio Networks
- On the distribution for the duration of a randomized leader election algorithm
- Analysis of an asymmetric leader election algorithm
- How to select a loser
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Title not available (Why is that?)
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks
- Monitoring churn in wireless networks
- Title not available (Why is that?)
- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
- Adversary immune leader election in ad hoc radio networks
- Design patterns in beeping algorithms: examples, emulation, and analysis
- The energy complexity of diameter and minimum cut computation in bounded-genus networks
- Efficient algorithms for leader election in radio networks
This page was built for publication: Quasi-optimal energy-efficient leader election algorithms in radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879595)