Near Optimal Leader Election in Multi-Hop Radio Networks

We design leader election protocols for multi-hop radio networks that elect a leader in almost the same time, T_BC = Theta(D log(n/D) + log^2 n), that it needed for broadcasting one message/ID. This improves over a 23 year old simulation approach of Bar-Yehuda, Goldreich and Itai with a O(T_BC log n) running time: In 1987 they designed a fast broadcast protocol and subsequently in 1989 they showed how it can be used to simulate one round of a single-hop network with collision detection in T_BC time. The prime application of this simulation was to simulate Willards single-hop leader election protocol, which elects a leader in O(log n) rounds whp. and O(log log n) rounds in expectation. While it was subsequently shown that Willards bounds are tight, it was unclear whether the simulation approach is optimal. We also give an near optimal leader election algorithm for the setting with collision detection improving over a deterministic algorithm that requires Theta(n) rounds independently of D. Our almost optimal leader election protocols are especially important because countless communication protocols in radio networks use leader election as a crucial first step to solve various, seemingly unrelated, communication primitives such as gathering, multiple unicasts or multiple broadcasts. Even though leader election seems easier than these tasks, its best-known O(T_BC log n) running time had become a bottleneck, preventing optimal algorithms. Breaking the simulation barrier for leader election in this paper has subsequently led to the development of near optimal protocols for these communication primitives.