Message and time efficient multi-broadcast schemes

Liron Levin, Dariusz R. Kowalski, Michael Segal

Research output: Contribution to journalArticle

1 Scopus citations

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

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Message and time efficient multi-broadcast schemes'. Together they form a unique fingerprint.

  • Cite this