Abstract—In order to optimize the total energy consumption of data collection for wireless sensor networks, we study how to route data for improving data aggregation efficiency and propose a dynamic routing algorithm for data-aggregation optimization in event-driven wireless sensor networks. It clusters nodes within event areas in a distributed manner with low control overhead and establishes an approximate Steiner tree based on events aided by the sum of Euclidean distances from nodes to cluster heads. The algorithm does not only improve the data aggregation ratio but also decreases the control overhead for building and maintaining routing structure, achieving energy-efficient data routing and collection and promoting network performance eventually. Algorithm analysis and experiments show that the algorithm can effectively decrease the amount of transmissions for both data and control packet, prolonging network lifetime.

Index Terms—wireless sensor networks, cluster, data aggregation, paths overlapping

Cite: Yalin Nie, Sanyang Liu, Zhibin Chen, and Xiaogang Qi, "A Dynamic Routing Algorithm for Data-Aggregation Optimization in Event-Driven Wireless Sensor Networks" Journal of Communications, vol. 8, no. 8, pp. 521-528, 2013. doi: 10.12720/jcm.8.8.521-528