Optimizing Many-to-Many Data Aggregation in Wireless Sensor Networks

Authors:
Shuguang Xiong;Jianzhong Li
Affiliations:
Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
Venue:
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Year:
2009

Citing 10
Cited 0

Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

IEEE Transactions on Mobile Computing
Energy-efficient monitoring of extreme values in sensor networks

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A fast distributed approximation algorithm for minimum spanning trees

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Data-aggregation techniques in sensor networks: a survey

IEEE Communications Surveys & Tutorials
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks have enormous potential to aid data collection in a number of areas, such as environmental and wildlife research. In this paper, we study the problem of how to generate energy efficient aggregation plans to optimize many-to-many aggregation in sensor networks, which involve a many-to-many relationship between the nodes providing data and the nodes requiring data. We show that the problem is NP-Complete considering both routing and aggregation choices, and we present three approximation algorithms for two special cases and the general case of the problem. By utilizing the approximation algorithms for the minimal Steiner tree, we provide approximation ratios on the energy cost of the generated plan against optimal plans.