Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

DOI10.1007/978-3-642-02930-1_43zbMath1248.68065OpenAlexW1766082731MaRDI QIDQ5321682

Andrzej Pelc, Dariusz R. Kowalski

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_43

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (8)

Leader election using loneliness detection ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ How much memory is needed for leader election ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Monitoring churn in wireless networks ⋮ Topology recognition and leader election in colored networks ⋮ Leader Election Using Loneliness Detection

This page was built for publication: Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps