A Distributed and Dynamic Data Gathering Protocol for Sensor Networks

In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor nodes are not in direct communication range of each other and data aggregation is used while routing. Proposed algorithm is based on local minimum spanning tree (LMST) structure, which nodes can construct from the position of their 1-hop neighbors. Reporting tree is constructed from the sink by allowing only edges of LMST to join the tree, plus possibly some direct links to the sink. Each node selects as parent the LMST neighbor so that the total energy cost of route to the sink is minimal. We also describe route maintenance protocols to respond to predicted sensor failures and addition of new sensors. Our simulation results show that our algorithm prolongs the network lifetime significantly compared to some alternative schemes.

[1]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[2]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[3]  Chai-Keong Toh.  Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks , 2001 .

[4]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[5]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[6]  Julio Solano-González,et al.  Finding minimum transmission radii for preserving connectivity and constructing minimal spanning trees in ad hoc and sensor networks , 2005, J. Parallel Distributed Comput..

[7]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[8]  Ibrahim Korpeoglu,et al.  Power efficient data gathering and aggregation in wireless sensor networks , 2003, SGMD.

[9]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Christos G. Cassandras,et al.  On maximum lifetime routing in Wireless Sensor Networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

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

[13]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

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

[15]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[16]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.