loading...
DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding
Leeds, United Kingdom October 02-October 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SRDS.2006.1825th IEEE Symposium on Reliable Distr ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stefan Pleisch, EPFL, Faculte IC, 1015 Lausanne, Switzerland
Thomas Clouser, Kent State University, Kent, OH
Mikhail Nesterenko, Kent State University, Kent, OH
Andre Schiper, EPFL, Facult?e IC, 1015 Lausanne, Switzerland
We present DRIFT - a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding - a way of using unrelated message streams to propagate message causality information in order to accelerate message delivery. We describe DRIFT in detail. We evaluate its performance in a simulator and in a wireless sensor network. In both cases our results demonstrate that the performance of DRIFT exceeds that of the simple total order multicast algorithm designed for wired networks, on which it is based. In simulation at scale, for certain experiment settings, DRIFT achieved speedup of several orders of magnitude.
Citation:
Stefan Pleisch, Thomas Clouser, Mikhail Nesterenko, Andre Schiper, "DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding," srds, pp.119-131, 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.