TY - GEN

T1 - Distributed randomized broadcasting in wireless networks under the SINR model

AU - Jurdzinski, Tomasz

AU - Kowalski, Dariusz R.

AU - Rozanski, Michal

AU - Stachowiak, Grzegorz

PY - 2013

Y1 - 2013

N2 - In the advent of large-scale multi-hop wireless technologies, such as MANET, VANET, iThings, it is of utmost importance to devise efficient distributed protocols to maintain network architecture and provide basic communication tools. One of such fundamental communication tasks is broadcast, also known as a 1-to-all communication. We present a randomized algorithm that accomplishes broadcast in O (D +log(1/δ)) rounds with probability at least 1 - δ on any uniform-power network of n nodes and diameter D, when each station is equipped with its coordinates and local estimate of network density. Next, we develop algorithms for the model where no estimate of local density is available, except of the value n of the size of a given network. First, we provide a simple and almost oblivious algorithm which accomplishes broadcast in O (D log n(log n + log(1/δ))) rounds with probability at least 1 - δ . We further enhance this algorithm with more adaptive leader election routine and show that the resulting protocol achieves better time performance O ((D + log(1/δ)) log n) with probability at least 1 - δ. Our algorithms are the first provably efficient and well-scalable randomized distributed solutions for the (global) broadcast task in the ad hoc setting with coordinates. This could be also contrasted with the complexity of broadcast by weak devices, for which such scalable algorithms (with respect to D and log n) cannot be obtained [11].

AB - In the advent of large-scale multi-hop wireless technologies, such as MANET, VANET, iThings, it is of utmost importance to devise efficient distributed protocols to maintain network architecture and provide basic communication tools. One of such fundamental communication tasks is broadcast, also known as a 1-to-all communication. We present a randomized algorithm that accomplishes broadcast in O (D +log(1/δ)) rounds with probability at least 1 - δ on any uniform-power network of n nodes and diameter D, when each station is equipped with its coordinates and local estimate of network density. Next, we develop algorithms for the model where no estimate of local density is available, except of the value n of the size of a given network. First, we provide a simple and almost oblivious algorithm which accomplishes broadcast in O (D log n(log n + log(1/δ))) rounds with probability at least 1 - δ . We further enhance this algorithm with more adaptive leader election routine and show that the resulting protocol achieves better time performance O ((D + log(1/δ)) log n) with probability at least 1 - δ. Our algorithms are the first provably efficient and well-scalable randomized distributed solutions for the (global) broadcast task in the ad hoc setting with coordinates. This could be also contrasted with the complexity of broadcast by weak devices, for which such scalable algorithms (with respect to D and log n) cannot be obtained [11].

KW - Ad hoc wireless networks

KW - Broadcast

KW - Distributed algorithms

KW - Signal-to-Interference-and-Noise-Ratio (SINR) model

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

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

U2 - 10.1007/978-3-642-41527-2_26

DO - 10.1007/978-3-642-41527-2_26

M3 - Conference contribution

AN - SCOPUS:84890061448

SN - 9783642415265

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

SP - 373

EP - 387

BT - Distributed Computing - 27th International Symposium, DISC 2013, Proceedings

T2 - 27th International Symposium on Distributed Computing, DISC 2013

Y2 - 14 October 2013 through 18 October 2013

ER -