Quasi-optimal energy-efficient leader election algorithms in radio networks
From MaRDI portal
(Redirected from Publication:879595)
Recommendations
Cites work
- An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
- Analysis of an asymmetric leader election algorithm
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
- How to select a loser
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 2080260 (Why is no real title available?)
- scientific article; zbMATH DE number 1857647 (Why is no real title available?)
- scientific article; zbMATH DE number 2089983 (Why is no real title available?)
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- Mellin transforms and asymptotics: Harmonic sums
- Multiple Communication in Multihop Radio Networks
- On the distribution for the duration of a randomized leader election algorithm
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- The collision channel without feedback
Cited in
(9)- Design patterns in beeping algorithms: examples, emulation, and analysis
- Transmitting once to elect a leader on wireless networks
- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
- scientific article; zbMATH DE number 2080260 (Why is no real title available?)
- Efficient algorithms for leader election in radio networks
- Adversary immune leader election in ad hoc radio networks
- The energy complexity of diameter and minimum cut computation in bounded-genus networks
- The energy complexity of diameter and minimum cut computation in bounded-genus networks
- Monitoring churn in wireless 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)