TY - JOUR
T1 - Leader election in ad hoc radio networks
T2 - A keen ear helps
AU - Kowalski, Dariusz R.
AU - Pelc, Andrzej
N1 - Funding Information:
A preliminary version of this paper appeared in the Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Part II, in: Lecture Notes in Comput. Sci., vol. 5556, 2009, pp. 521–533. The work of D. Kowalski was supported by the Engineering and Physical Sciences Research Council [grant number EP/G023018/1 ]. The work of A. Pelc was partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais .
PY - 2013/11
Y1 - 2013/11
N2 - We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. A signal from a transmitting node reaches all neighbors but a message is received successfully by a node, if and only if exactly one of its neighbors transmits in this round. If two neighbors of a node transmit simultaneously in a given round, we say that a collision occurred at this node. Collision detection is the ability of nodes to distinguish a collision from silence. We show that collision detection speeds up leader election in arbitrary radio networks. Our main result is a deterministic leader election algorithm working in time O(n) in all n-node networks, if collision detection is available, while it is known that deterministic leader election requires time Ω(nlogn), even for complete networks, if there is no collision detection.
AB - We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. A signal from a transmitting node reaches all neighbors but a message is received successfully by a node, if and only if exactly one of its neighbors transmits in this round. If two neighbors of a node transmit simultaneously in a given round, we say that a collision occurred at this node. Collision detection is the ability of nodes to distinguish a collision from silence. We show that collision detection speeds up leader election in arbitrary radio networks. Our main result is a deterministic leader election algorithm working in time O(n) in all n-node networks, if collision detection is available, while it is known that deterministic leader election requires time Ω(nlogn), even for complete networks, if there is no collision detection.
KW - Collision detection
KW - Deterministic algorithms
KW - Distributed algorithms
KW - Leader election
KW - Radio networks
UR - http://www.scopus.com/inward/record.url?scp=84878513336&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84878513336&partnerID=8YFLogxK
U2 - 10.1016/j.jcss.2013.04.003
DO - 10.1016/j.jcss.2013.04.003
M3 - Article
AN - SCOPUS:84878513336
SN - 0022-0000
VL - 79
SP - 1164
EP - 1180
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 7
ER -