Tailoring a broadcast algorithm to particular network conditions

Authors:
Carl Ellis;Hugo Miranda;François Taïani
Affiliations:
Lancaster University, UK;University of Lisbon, Portugal;Lancaster University, UK
Venue:
Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications
Year:
2008

Citing 6
Cited 0

DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Experimental evaluation of wireless simulation assumptions

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Radio propagation patterns in wireless sensor networks: new experimental results

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Quantified Score

Hi-index	0.01

Visualization

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 algorithm 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.