Message and time efficient multi-broadcast schemes

Liron Levin, Dariusz R. Kowalski, Michael Segal

Research output: Contribution to journalArticle

Abstract

We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.

Original languageEnglish (US)
Pages (from-to)13-23
Number of pages11
JournalTheoretical Computer Science
Volume569
Issue numberC
DOIs
StatePublished - Jan 1 2015
Externally publishedYes

Fingerprint

Broadcasting
Broadcast
Wireless ad hoc networks
Approximation algorithms
Collision Detection
Wireless Ad Hoc Networks
Vertex of a graph
Approximation Algorithms
Subset
Approximation

Keywords

  • Ad-hoc networks
  • Broadcast and multi-broadcast
  • Distributed algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Message and time efficient multi-broadcast schemes. / Levin, Liron; Kowalski, Dariusz R.; Segal, Michael.

In: Theoretical Computer Science, Vol. 569, No. C, 01.01.2015, p. 13-23.

Research output: Contribution to journalArticle

Levin, Liron ; Kowalski, Dariusz R. ; Segal, Michael. / Message and time efficient multi-broadcast schemes. In: Theoretical Computer Science. 2015 ; Vol. 569, No. C. pp. 13-23.
@article{ff42571eb14c4adc929787b48cb50cfb,
title = "Message and time efficient multi-broadcast schemes",
abstract = "We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.",
keywords = "Ad-hoc networks, Broadcast and multi-broadcast, Distributed algorithms",
author = "Liron Levin and Kowalski, {Dariusz R.} and Michael Segal",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.tcs.2014.12.006",
language = "English (US)",
volume = "569",
pages = "13--23",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Message and time efficient multi-broadcast schemes

AU - Levin, Liron

AU - Kowalski, Dariusz R.

AU - Segal, Michael

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.

AB - We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.

KW - Ad-hoc networks

KW - Broadcast and multi-broadcast

KW - Distributed algorithms

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

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

U2 - 10.1016/j.tcs.2014.12.006

DO - 10.1016/j.tcs.2014.12.006

M3 - Article

AN - SCOPUS:84926363648

VL - 569

SP - 13

EP - 23

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -