Time-efficient randomized multiple-message broadcast in radio networks

Majid Khabbazian, Dariusz R. Kowalski

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

Abstract

Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network communication. In short, there are k packets distributed across the network, each of them has to be delivered to all other nodes. We consider this task in the model of multi-hop radio network, in which n nodes interact by transmitting and receiving messages. A message transmitted at a round reaches all neighbors of the transmitter at the end of the same round, but may not be successfully received by some, or even all, of these neighbors. More specifically, a node receives a message at a round if this is the only message that has reached this node in this round. Due to this specific interference-prone nature of radio networks, many communication tasks become more challenging and more costly than in other types of networks, especially in ad-hoc setting in which each node knows only its own id and linear estimates on the basic network parameters, such as the number of nodes n, diameter D and maximum node degree Δ. We design a new randomized k-broadcast algorithm combining the bestof two worlds: efficient randomized transmission schedules and network coding. We show that our algorithm accomplishes multi-broadcast in O(log Δ) amortized number of communication rounds per packet, with high probability. This improves over the best previous solution of Bar-Yehuda, Israeli and Itai, which guarantees only O(log Δ log n) of amortized number of rounds per packet, with high probability.

Original languageEnglish (US)
Title of host publicationPODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
Pages373-379
Number of pages7
DOIs
StatePublished - Jul 7 2011
Externally publishedYes
Event30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC - San Jose, CA, United States
Duration: Jun 6 2011Jun 8 2011

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC
CountryUnited States
CitySan Jose, CA
Period6/6/116/8/11

Fingerprint

Network coding
Communication
Telecommunication networks
Transmitters

Keywords

  • multiple-message broadcast
  • radio networks
  • randomized algorithm

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Khabbazian, M., & Kowalski, D. R. (2011). Time-efficient randomized multiple-message broadcast in radio networks. In PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing (pp. 373-379). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1993806.1993884

Time-efficient randomized multiple-message broadcast in radio networks. / Khabbazian, Majid; Kowalski, Dariusz R.

PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. 2011. p. 373-379 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

Khabbazian, M & Kowalski, DR 2011, Time-efficient randomized multiple-message broadcast in radio networks. in PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 373-379, 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC, San Jose, CA, United States, 6/6/11. https://doi.org/10.1145/1993806.1993884
Khabbazian M, Kowalski DR. Time-efficient randomized multiple-message broadcast in radio networks. In PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. 2011. p. 373-379. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1993806.1993884
Khabbazian, Majid ; Kowalski, Dariusz R. / Time-efficient randomized multiple-message broadcast in radio networks. PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. 2011. pp. 373-379 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
@inproceedings{5a38a1c477a6403693b1f39bc577e5e8,
title = "Time-efficient randomized multiple-message broadcast in radio networks",
abstract = "Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network communication. In short, there are k packets distributed across the network, each of them has to be delivered to all other nodes. We consider this task in the model of multi-hop radio network, in which n nodes interact by transmitting and receiving messages. A message transmitted at a round reaches all neighbors of the transmitter at the end of the same round, but may not be successfully received by some, or even all, of these neighbors. More specifically, a node receives a message at a round if this is the only message that has reached this node in this round. Due to this specific interference-prone nature of radio networks, many communication tasks become more challenging and more costly than in other types of networks, especially in ad-hoc setting in which each node knows only its own id and linear estimates on the basic network parameters, such as the number of nodes n, diameter D and maximum node degree Δ. We design a new randomized k-broadcast algorithm combining the bestof two worlds: efficient randomized transmission schedules and network coding. We show that our algorithm accomplishes multi-broadcast in O(log Δ) amortized number of communication rounds per packet, with high probability. This improves over the best previous solution of Bar-Yehuda, Israeli and Itai, which guarantees only O(log Δ log n) of amortized number of rounds per packet, with high probability.",
keywords = "multiple-message broadcast, radio networks, randomized algorithm",
author = "Majid Khabbazian and Kowalski, {Dariusz R.}",
year = "2011",
month = "7",
day = "7",
doi = "10.1145/1993806.1993884",
language = "English (US)",
isbn = "9781450307192",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "373--379",
booktitle = "PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing",

}

TY - GEN

T1 - Time-efficient randomized multiple-message broadcast in radio networks

AU - Khabbazian, Majid

AU - Kowalski, Dariusz R.

PY - 2011/7/7

Y1 - 2011/7/7

N2 - Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network communication. In short, there are k packets distributed across the network, each of them has to be delivered to all other nodes. We consider this task in the model of multi-hop radio network, in which n nodes interact by transmitting and receiving messages. A message transmitted at a round reaches all neighbors of the transmitter at the end of the same round, but may not be successfully received by some, or even all, of these neighbors. More specifically, a node receives a message at a round if this is the only message that has reached this node in this round. Due to this specific interference-prone nature of radio networks, many communication tasks become more challenging and more costly than in other types of networks, especially in ad-hoc setting in which each node knows only its own id and linear estimates on the basic network parameters, such as the number of nodes n, diameter D and maximum node degree Δ. We design a new randomized k-broadcast algorithm combining the bestof two worlds: efficient randomized transmission schedules and network coding. We show that our algorithm accomplishes multi-broadcast in O(log Δ) amortized number of communication rounds per packet, with high probability. This improves over the best previous solution of Bar-Yehuda, Israeli and Itai, which guarantees only O(log Δ log n) of amortized number of rounds per packet, with high probability.

AB - Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network communication. In short, there are k packets distributed across the network, each of them has to be delivered to all other nodes. We consider this task in the model of multi-hop radio network, in which n nodes interact by transmitting and receiving messages. A message transmitted at a round reaches all neighbors of the transmitter at the end of the same round, but may not be successfully received by some, or even all, of these neighbors. More specifically, a node receives a message at a round if this is the only message that has reached this node in this round. Due to this specific interference-prone nature of radio networks, many communication tasks become more challenging and more costly than in other types of networks, especially in ad-hoc setting in which each node knows only its own id and linear estimates on the basic network parameters, such as the number of nodes n, diameter D and maximum node degree Δ. We design a new randomized k-broadcast algorithm combining the bestof two worlds: efficient randomized transmission schedules and network coding. We show that our algorithm accomplishes multi-broadcast in O(log Δ) amortized number of communication rounds per packet, with high probability. This improves over the best previous solution of Bar-Yehuda, Israeli and Itai, which guarantees only O(log Δ log n) of amortized number of rounds per packet, with high probability.

KW - multiple-message broadcast

KW - radio networks

KW - randomized algorithm

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

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

U2 - 10.1145/1993806.1993884

DO - 10.1145/1993806.1993884

M3 - Conference contribution

AN - SCOPUS:79959906177

SN - 9781450307192

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 373

EP - 379

BT - PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing

ER -