A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

Abstract 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 [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Journal of Computer Networks 38 (2002) 393–422], [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67]) 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 [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67]. This protocol is very simple to implement in sensor devices, uses only local information 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 simulation findings validating the analytical results.

[1]  Mohammad Ilyas,et al.  Smart Dust , 2006 .

[2]  Paul G. Spirakis,et al.  Smart dust protocols for local detection and propagation , 2002, POMC '02.

[3]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[4]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[5]  Ioannis Chatzigiannakis,et al.  Energy efficient protocols for sensing multiple events in Smart Dust networks , 2004, 37th Annual Simulation Symposium, 2004. Proceedings..

[6]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[7]  José D. P. Rolim,et al.  Energy balanced data propagation in wireless sensor networks , 2006, Wirel. Networks.

[8]  Paul G. Spirakis,et al.  A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks , 2003, Euro-Par.

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Mohsen Guizani,et al.  Wireless Communications Systems and Networks , 2006 .

[11]  Azzedine Boukerche,et al.  A new energy efficient and fault-tolerant protocol for data propagation in Smart Dust networks using varying transmission range , 2004, 37th Annual Simulation Symposium, 2004. Proceedings..

[12]  H. T. Kung,et al.  Geographic routing for wireless networks , 2000 .

[13]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

[14]  Maria J. Serna,et al.  Evaluation of Basic Protocols for Optical Smart Dust Networks , 2003, WEA.

[15]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[16]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[17]  Paul G. Spirakis,et al.  Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk) , 2004, ALGOSENSORS.

[18]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[19]  Tassos Dimitriou,et al.  Efficient Delivery of Information in Sensor Networks Using Smart Antennas , 2004, ALGOSENSORS.

[20]  Azzedine Boukerche,et al.  Energy-Efficient Algorithms in Wireless Sensor Networks , 2008, Algorithms and Protocols for Wireless Sensor Networks.

[21]  Azzedine Boukerche,et al.  Protocols for data propagation in wireless sensor networks: A survey , 2004 .

[22]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[23]  Ioannis Chatzigiannakis,et al.  A sleep-awake protocol for information propagation in smart dust networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[24]  A Probabilistic Forwarding Protocol for Efficient Data Propagation in Sensor Networks December 12 , 2002 , 2002 .

[25]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.