Tailoring a broadcast algorithm to particular network conditions

Carl Ellis, Hugo Miranda, and François Taïani

Tailoring a broadcast algorithm to particular network conditions

Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications (MiNEMA'08), Glasgow, Scotland, pp. 18-20, ISBN 978-1-60558-122-4, ACM, 2008 (3p.)

Abstract
The broadcast of a message in Mobile Ad Hoc Networks requires its retransmission by multiple devices, consuming both bandwidth and power. The goal of broadcast algorithms is to select the most adequate nodes to retransmit so that the cost of the operation is reduced. Pampa is a broadcast algo- rithm that has been shown to perform well when the node distribution is uniform. This position paper identifies and discusses some cases where the performance of Pampa can be improved and presents the research directions that will be pursued to address them.

ACM Copyright Notice: © ACM, 2008. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 6th Workshop on Middleware For Network Eccentric and Mobile Applications (Glasgow, Scotland, April 01 - 01, 2008). MiNEMA '08. ACM, New York, NY, 18-20..

complete document

doi: http://doi.org/10.1145/1435467.1435472 (publisher's link)

bibtex

Back to Home

Last generated on 8 Dec 2019 francois.taiani@irisa.fr