Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks

This paper considers the problem of constructing data gathering trees in a wireless sensor network for a group of sensor nodes to send collected information to a single sink node. Sensors form application-directed groups and the sink node communicates with the group members, called source nodes, to gather the desired data using a multicast tree rooted at the sink node. The data gathering tree contains the sink node, all the source nodes, and some other non-source nodes. Our goal of constructing such a data gathering tree is to minimize the number of non-source nodes to be included in the tree so as to save energies of as many non-source nodes as possible. It can be shown that the optimization problem is NP-hard. We first propose an approximation algorithm with a performance ratio of four, and then give a distributed algorithm corresponding to the approximation algorithm. Extensive simulations are performed to study the performance of the proposed algorithm. The results show that the proposed algorithm can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

[1]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[2]  Mark G. Terwilliger,et al.  Overview of Sensor Networks , 2004 .

[3]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[4]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[5]  Deborah Estrin,et al.  Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.

[6]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

[7]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

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

[9]  Elif Uysal-Biyikoglu,et al.  Energy-efficient transmission over a wireless link via lazy packet scheduling , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

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

[12]  Holger Karl,et al.  A Data Aggregation Framework for Wireless Sensor Network , 2003 .

[13]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[14]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[15]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[16]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[17]  Mani B. Srivastava,et al.  Modulation scaling for Energy Aware Communication Systems , 2001, ISLPED '01.