The Community for Technology Leaders
Green Image
Issue No. 11 - November (2006 vol. 5)
ISSN: 1536-1233
pp: 1620-1632
Hong Luo , IEEE
Yonghe Liu , IEEE
In this paper, we propose a routing algorithm called Minimum Fusion Steiner Tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transmission cost, but also incorporates the cost for data fusion, which can be significant for emerging sensor networks with vectorial data and/or security requirements. By employing a randomized algorithm that allows fusion points to be chosen according to the nodes' data amounts, MFST achieves an approximation ratio of {\frac{5}{4}}\log(k+1), where k denotes the number of source nodes, to the optimal solution for extremely general system setups, provided that fusion cost and data aggregation are nondecreasing against the total input data. Consequently, in contrast to algorithms that only excel in full or nonaggregation scenarios without considering fusion cost, MFST can thrive in a wide range of applications.
Wireless sensor networks, data fusion, routing, randomized algorithm, approximation.

S. K. Das, Y. Liu and H. Luo, "Routing Correlated Data with Fusion Cost in Wireless Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 5, no. , pp. 1620-1632, 2006.
92 ms
(Ver 3.3 (11022016))