TY - GEN

T1 - Leader election in ad hoc radio networks

T2 - 36th International Colloquium on Automata, Languages and Programming, ICALP 2009

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2009

Y1 - 2009

N2 - We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. Nodes are stations having distinct integer labels, and each node knows only its own label and a polynomial upper bound on all labels. A signal from a transmitting node reaches all neighbors. What distinguishes radio networks from message-passing networks is that 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, none of the messages is heard by the receiving node. In this case we say that a collision occurred at this node. An important capability of nodes of a radio network is collision detection: the ability of nodes to distinguish a collision from the background noise occurring when no neighbor transmits. (This ability is the "keen ear" of the nodes.) Can collision detection speed up leader election in arbitrary radio networks? We give a positive answer to this question. More precisely, 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 Ω(n logn), even for complete networks, if there is no collision detection. This is the first computational task whose execution for arbitrary radio networks is shown to be faster with collision detection than without it.

AB - We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. Nodes are stations having distinct integer labels, and each node knows only its own label and a polynomial upper bound on all labels. A signal from a transmitting node reaches all neighbors. What distinguishes radio networks from message-passing networks is that 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, none of the messages is heard by the receiving node. In this case we say that a collision occurred at this node. An important capability of nodes of a radio network is collision detection: the ability of nodes to distinguish a collision from the background noise occurring when no neighbor transmits. (This ability is the "keen ear" of the nodes.) Can collision detection speed up leader election in arbitrary radio networks? We give a positive answer to this question. More precisely, 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 Ω(n logn), even for complete networks, if there is no collision detection. This is the first computational task whose execution for arbitrary radio networks is shown to be faster with collision detection than without it.

UR - http://www.scopus.com/inward/record.url?scp=70449113277&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449113277&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02930-1_43

DO - 10.1007/978-3-642-02930-1_43

M3 - Conference contribution

AN - SCOPUS:70449113277

SN - 3642029299

SN - 9783642029295

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 521

EP - 533

BT - Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings

Y2 - 5 July 2009 through 12 July 2009

ER -