DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding

Authors:
Stefan Pleisch;Thomas Clouser;Mikhail Nesterenko;Andre Schiper
Affiliations:
EPFL, Faculte IC, 1015 Lausanne, Switzerland;Kent State University, Kent, OH;Kent State University, Kent, OH;EPFL, Faculté IC, 1015 Lausanne, Switzerland
Venue:
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
Year:
2006

Citing 0
Cited 1

Gossiping: adaptive and reliable broadcasting in MANETs

LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.