Distributed randomized broadcasting in wireless networks under the SINR model

Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, Grzegorz Stachowiak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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].

Original languageEnglish (US)
Title of host publicationDistributed Computing - 27th International Symposium, DISC 2013, Proceedings
Pages373-387
Number of pages15
DOIs
StatePublished - Dec 1 2013
Externally publishedYes
Event27th International Symposium on Distributed Computing, DISC 2013 - Jerusalem, Israel
Duration: Oct 14 2013Oct 18 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8205 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Distributed Computing, DISC 2013
CountryIsrael
CityJerusalem
Period10/14/1310/18/13

Fingerprint

Broadcasting
Broadcast
Wireless Networks
Wireless networks
Communication
Leader Election
Distributed Protocol
Vehicular Ad Hoc Networks
Model
Network protocols
Multi-hop
Randomized Algorithms
Network Architecture
Estimate
Network architecture
Vertex of a graph

Keywords

  • Ad hoc wireless networks
  • Broadcast
  • Distributed algorithms
  • Signal-to-Interference-and-Noise-Ratio (SINR) model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2013). Distributed randomized broadcasting in wireless networks under the SINR model. In Distributed Computing - 27th International Symposium, DISC 2013, Proceedings (pp. 373-387). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8205 LNCS). https://doi.org/10.1007/978-3-642-41527-2_26

Distributed randomized broadcasting in wireless networks under the SINR model. / Jurdzinski, Tomasz; Kowalski, Dariusz R.; Rozanski, Michal; Stachowiak, Grzegorz.

Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. 2013. p. 373-387 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8205 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jurdzinski, T, Kowalski, DR, Rozanski, M & Stachowiak, G 2013, Distributed randomized broadcasting in wireless networks under the SINR model. in Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8205 LNCS, pp. 373-387, 27th International Symposium on Distributed Computing, DISC 2013, Jerusalem, Israel, 10/14/13. https://doi.org/10.1007/978-3-642-41527-2_26
Jurdzinski T, Kowalski DR, Rozanski M, Stachowiak G. Distributed randomized broadcasting in wireless networks under the SINR model. In Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. 2013. p. 373-387. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-41527-2_26
Jurdzinski, Tomasz ; Kowalski, Dariusz R. ; Rozanski, Michal ; Stachowiak, Grzegorz. / Distributed randomized broadcasting in wireless networks under the SINR model. Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. 2013. pp. 373-387 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{37e0d6334ae341fa8cc6bbf6d8c1c8f1,
title = "Distributed randomized broadcasting in wireless networks under the SINR model",
abstract = "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].",
keywords = "Ad hoc wireless networks, Broadcast, Distributed algorithms, Signal-to-Interference-and-Noise-Ratio (SINR) model",
author = "Tomasz Jurdzinski and Kowalski, {Dariusz R.} and Michal Rozanski and Grzegorz Stachowiak",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-642-41527-2_26",
language = "English (US)",
isbn = "9783642415265",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "373--387",
booktitle = "Distributed Computing - 27th International Symposium, DISC 2013, Proceedings",

}

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/12/1

Y1 - 2013/12/1

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

ER -