Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards

DOI10.1002/cpe.783zbMath1031.68142OpenAlexW1922389895MaRDI QIDQ4432747

Mirosław Kutyłowski, J. Zatopiański, Tomasz Jurdziński

Publication date: 29 October 2003

Published in: Concurrency and Computation: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpe.783

zbMATH Keywords

radio networkleader electioninitializationpower consumption

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Restrained medium access control on adversarial shared channels ⋮ 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 ⋮ Transmitting once to elect a leader on wireless networks

Cites Work

• Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
• Efficient algorithms for leader election in radio networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards