Message and time efficient multi-broadcast schemes

Liron Levin
(Communication Systems Engineering Department, Ben-Gurion University of the Negev, Israel)
Dariusz R. Kowalski
(Department of Computer Science, University of Liverpool, UK)
Michael Segal
(Communication Systems Engineering Department, Ben-Gurion University of the Negev, Israel)

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.

In Keren Censor-Hillel and Valerie King: Proceedings Ninth International Workshop on Foundations of Mobile Computing (FOMC 2013), Jerusalem, Israel, October 17-18, 2013, Electronic Proceedings in Theoretical Computer Science 132, pp. 21–37.
Published: 17th October 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.132.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org