Quasi-optimal energy-efficient leader election algorithms in radio networks

DOI10.1016/j.ic.2006.10.001zbMath1115.68165OpenAlexW4301383268MaRDI QIDQ879595

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

zbMATH Keywords

distributed systemsenergy-efficientradio networkselection

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items

Design patterns in beeping algorithms: examples, emulation, and analysis, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• How to select a loser
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• Multiple Communication in Multihop Radio Networks
• The collision channel without feedback
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks