Issue No. 10 - October (2006 vol. 55)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2006.157
Hong Luo , IEEE
Jun Luo , IEEE
Yonghe Liu , IEEE
Sajal K. Das , IEEE
While in-network data fusion can reduce data redundancy and, hence, curtail network load, the fusion process itself may introduce significant energy consumption for emerging wireless sensor networks with vectorial data and/or security requirements. Therefore, fusion-driven routing protocols for sensor networks cannot optimize over communication cost only—fusion cost must also be accounted for. In our prior work , while a randomized algorithm termed MFST is devised toward this end, it assumes that fusion shall be performed at any intersection node whenever data streams encounter. In this paper, we design a novel routing algorithm, called Adaptive Fusion Steiner Tree (AFST), for energy efficient data gathering. Not only does AFST jointly optimize over the costs for both data transmission and fusion, but also AFST evaluates the benefit and cost of data fusion along information routes and adaptively adjusts whether fusion shall be performed at a particular node. Analytically and experimentally, we show that AFST achieves better performance than existing algorithms, including SLT, SPT, and MFST.
Sensor networks, data gathering, data fusion, routing.
H. Luo, S. K. Das, Y. Liu and J. Luo, "Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks," in IEEE Transactions on Computers, vol. 55, no. , pp. 1286-1299, 2006.