A probabilistic algorithm for efficient and robust data propagation in 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. Motivated by certain applications (see [1, 15]) and also as a starting point for a rigorous analysis, we study here lattice-shaped sensor networks. We however show that this lattice shape emerges even in randomly deployed sensor networks of sufficient sensor density. Our work is inspired and builds upon the directed diffusion paradigm of [15]. This protocol is very simple to implement in sensor devices, uses only local information and operates under total absence of co-ordination bet...

• Type: Journal
• Year: 2006
• Where: ADHOC
• Authors: Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis
• Keywords: ADHOC 2006, Data Propagation, Sensor Networks, Sensors