research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:ichatz
TitleA Probabilistic Algorithm for Efficient and Robust Data Propagation in Smart Dust Networks
Bibtex cite IDRACTI-RU1-2004-21
Booktitle 5th European Wireless Conference on Mobile and Wireless Systems beyond 3G (EW)
Year published 2004
Month February
Pages 344-350
Location Barchelona, Spain
Keywords Wireless Sensor Networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The distributed co-operation of such nodes may lead to the accomplishment of large sensing tasks, having useful applications in practice. We present a new protocol for data propagation towards a control center (``sink") that avoids flooding by probabilistically favoring certain (``close to optimal") data transmissions. This protocol is very simple to implement in sensor devices and operates under total absence of co-ordination between sensors. We consider a network model of randomly deployed sensors of sufficient density. As shown by a geometry analysis, the protocol is correct, since it always propagates data to the sink, under ideal network conditions (no failures). Using stochastic processes, we show that the protocol is very energy efficient. Also, when part of the network is inoperative, the protocol manages to propagate data very close to the sink, thus in this sense it is robust. We finally present and discuss large-scale experimental findings validating the analytical results.
Chatzigiannakis, Ioannis
Dimitriou, Tassos
Nikoletseas, Sotiris
Spirakis, Paul
ew04ichatz.pdf (main file)
Publication ID248