Message and time efficient multi-broadcast schemes

Liron Levin, Dariusz R. Kowalski, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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
Title of host publicationProceedings Ninth International Workshop on Foundations of Mobile Computing, FOMC 2013, Jerusalem, Israel, October 17-18, 2013
EditorsKeren Censor-Hillel, Valerie King
Pages21-37
Number of pages17
Volume132
DOIs
StatePublished - 2013

Publication series

NameEPTCS

Fingerprint

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

Cite this