Data Aggregation with Multiple Spanning Trees in Wireless Sensor Networks

In wireless sensor networks, the data aggregation is an essential paradigm for routing, through which the multiple data from different sensors can be aggregated into a single data at intermedial nodes enroute, in order to eliminate data redundancy and achieve the goal of saving energy. Some existed medium access protocols and algorithms can effectively prolong the lifetime of the sensor network by determining when each sensor should transmit its data, and when it should sleep. In this paper, we focus on applying multiple spanning trees to organize the data aggregation, which is different from these existed single spanning tree methods. At first, the problem of constructing multiple spanning trees is transformed into a linear programming problem of the data flow network. Based on the solved optimal rate between the two adjacent sensors, the two constructing algorithms of the spanning tree are presented. Experimental results indicate that the method of multiple spanning trees can be of benefit to energy saving for wireless sensor networks, and the corresponding appropriate constructing algorithm can prolong the lifetime of the sensor network.

[1]  Deborah Estrin,et al.  Building efficient wireless sensor networks with low-level naming , 2001, SOSP.

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

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

[4]  Mitali Singh,et al.  Decentralized Utility-based Sensor Network Design , 2006, Mob. Networks Appl..

[5]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

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

[7]  F. Y. Wu.  Number of spanning trees on a lattice , 1977 .

[8]  Konstantinos Kalpakis,et al.  Improving the lifetime of sensor net-works via intelligent selection of data aggregation trees , 2003 .

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

[10]  Viktor K. Prasanna,et al.  Maximum Data Gathering in Networked Sensor Systems , 2005, Int. J. Distributed Sens. Networks.

[11]  Ramesh Govindan,et al.  The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.

[12]  Robin Wilson,et al.  Graphs and Applications_ An Introductory Approach , 2001 .

[13]  Tarek F. Abdelzaher,et al.  AIDA: Adaptive application-independent data aggregation in wireless sensor networks , 2004, TECS.

[14]  F. Y. Wu,et al.  Spanning trees on graphs and lattices in d dimensions , 2000, cond-mat/0004341.

[15]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[16]  P. Venkataraman,et al.  Applied Optimization with MATLAB Programming , 2001 .

[17]  Robin Wilson,et al.  Graphs and Applications , 2000 .

[18]  Baltasar Beferull-Lozano,et al.  On network correlated data gathering , 2004, IEEE INFOCOM 2004.

[19]  Jan M. Rabaey,et al.  Data funneling: routing with aggregation and compression for wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[20]  Deborah Estrin,et al.  Impact of network density on data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[21]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.