Transmitting once to elect a leader on wireless networks

DOI10.1007/s00453-023-01095-2OpenAlexW4323317281MaRDI QIDQ6077889

Vlady Ravelomanana, Ny Aina Andriambolamalala

Publication date: 27 September 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-023-01095-2

zbMATH Keywords

distributed computingleader electionenergy complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design patterns in beeping algorithms: examples, emulation, and analysis
• Leader election using loneliness detection
• Beeping a maximal independent set
• Tree algorithms for packet broadcast channels
• Multiple Communication in Multihop Radio Networks
• Deploying Wireless Networks with Beeps
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• 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
• Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
• Exponential Separations in the Energy Complexity of Leader Election
• Efficient algorithms for leader election in radio networks
• Contention resolution with log-logstar channel accesses
• Towards a complexity theory for local distributed computing
• On the Complexity of Universal Leader Election
• Near Optimal Leader Election in Multi-Hop Radio Networks
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Transmitting once to elect a leader on wireless networks