Leader election in ad hoc radio networks: A keen ear helps
作者：
Highlights：
• Radio network modeled as an undirected graph, nodes do not know topology.
• Collision detection: capability of distinguishing collision from silence.
• Collision detection speeds up deterministic leader election.
• Deterministic leader election with collision detection in linear time.
• Without collision detection super-linear lower bound.
摘要
•Radio network modeled as an undirected graph, nodes do not know topology.•Collision detection: capability of distinguishing collision from silence.•Collision detection speeds up deterministic leader election.•Deterministic leader election with collision detection in linear time.•Without collision detection super-linear lower bound.
论文关键词：Collision detection,Deterministic algorithms,Distributed algorithms,Leader election,Radio networks
论文评审过程：Received 9 November 2011, Revised 24 March 2013, Accepted 17 April 2013, Available online 6 May 2013.
论文官网地址：https://doi.org/10.1016/j.jcss.2013.04.003
