A distributed routing algorithm for data aggregation in wireless sensor networks

Abstract

Considering the impact of aggregation cost on the performance of aggregation routes in wireless sensor networks, an aggregation-decision-based distributed routing algorithm for data aggregation is proposed. When source nodes arrive or leave, the algorithm can calculate the aggregation benefit according to data correlation, aggregation cost and transmission cost. Then the algorithm will adaptively make aggregation and routing decisions based on aggregation benefit. Therefore, it can jointly optimize the aggregation and transmission costs and reduce the energy consumption for data gathering. This distributed algorithm makes all the decisions only relying on the local information. Hence, the routing maintenance cost is limited. Simulation results show that the energy consumption difference between this distributed online algorithm and the previous offline one is within 17% under any network conditions.

References

1. Krishnamachari B Estrin D Wicker S The impact of data aggregation in wireless sensor networksIEEE ICDCS'022002575578
2. Liu L F Zou S H Zhang L et al.A density control algorithm based on probabilitycoverage model in wireless sensor networksJournal of Beijing Universities of Posts and Telecommunications 2005 28(4)1417 (in Chinese)
3. Cristescu R Beferull-Lozano B Vetterli M On network correlated data gatheringIEEE Infocom'04 2004 425712582
4. Goel A Estrin D Simultaneous optimization forconcave costs: single sink aggregation or single source buy-at-bulkACM SODA'032003499505
5. Liu Y Y Ji H Yue G X Routing protocol with optimal location of aggregation pointin wireless sensor networksThe Journalof China Universities of Posts and Telecommunications 2006 13(1)15
6. Luo H Liu Y H Das S K Energy efficient routing with adaptive data fusion in sensornetworksACM DIALM-POMC'0520058089