This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
November 2006 (vol. 5 no. 11)
pp. 1620-1632
ASCII Text
x 
 
Hong Luo, Yonghe Liu, Sajal K. Das, "Routing Correlated Data with Fusion Cost in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 11, pp. 1620-1632, November, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2006.171,
author = {Hong Luo and Yonghe Liu and Sajal K. Das},
title = {Routing Correlated Data with Fusion Cost in Wireless Sensor Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {5},
number = {11},
issn = {1536-1233},
year = {2006},
pages = {1620-1632},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.171},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IS - 11
SN - 1536-1233
SP1620
EP1632
EPD - 1620-1632
A1 - Hong Luo,
A1 - Yonghe Liu,
A1 - Sajal K. Das,
PY - 2006
KW - Wireless sensor networks
KW - data fusion
KW - routing
KW - randomized algorithm
KW - approximation.
VL - 5
JA - IEEE Transactions on Mobile Computing
ER -
 
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.

[1] C. Chong and S. Kumar, “Sensor Networks: Evolution, Opportunities, and Challenges,” Proc. IEEE, vol. 91, no. 8, pp. 1247-1256, Aug. 2003.
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[3] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocol for Information Dissemination in Wireless Sensor Networks,” Proc. ACM MobiCom, pp. 174-185, Aug. 1999.
[4] A.A. Ahmed, H. Shi, and Y. Shang, “A Survey on Network Protocols for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Information Technology: Research and Education, Aug. 2003.
[5] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. 33rd Ann. Hawaii Int'l Conf. System Sciences, Jan. 2000.
[6] B. Krishnamachari, D. Estrin, and S. Wicker, “Impact of Data Aggregation in Wireless Sensor Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems, pp. 575-578, July 2002.
[7] A. Scaglione and S.D. Servetto, “On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks,” Proc. ACM MobiCom, Sept. 2002.
[8] S. Pattem, B. Krishnamachari, and R. Govindan, “The Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks, Apr. 2004.
[9] F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, “A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks,” Proc. ACM MobiCom, pp. 148-159, Sept. 2002.
[10] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, “Impact of Network Density on Data Aggregation in Wireless Sensor Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems, July 2002.
[11] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 2-16, Feb. 2003.
[12] A. Goel and D. Estrin, “Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk,” Proc. ACM-SIAM Symp. Discrete Algorithms, Jan. 2003.
[13] W. Zhang and G. Cao, “Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[14] W. Zhang and G. Cao, “DCTC: Dynamic Convoy Tree-Based Collaboration for Target Tracking in Sensor Networks,” IEEE Trans. Wireless Comm., vol. 3, no. 5, pp. 1689-1701, July 2004.
[15] R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “On Network Correlated Data Gathering,” Proc. IEEE INFOCOM, Mar. 2004.
[16] P.V. Rickenbach and R. Wattenhofer, “Gathering Correlated Data in Sensor Networks,” Proc. ACM Workshop Foundations of Mobile Computing, Oct. 2004.
[17] Y. Yu, B. Krishnamachari, and V. Prasanna, “Energy-Latency Tradeoff for Data Gathering in Wireless Sensor Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[18] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., Mar. 2002.
[19] A. Wang, W.B. Heinzelman, A. Sinha, and A.P. Chandrakasan, “Energy-Scalable Protocols for Battery-Operated Microsensor Networks,” J. VLSI Signal Processing, vol. 29, no. 3, pp. 223-237, Nov. 2001.
[20] H. Luo, J. Luo, S.K. Das, and Y. Liu, Energy Efficient Routing with Adaptive Data Fusion in Sensor Networks, technical report, Computer Science and Eng. Dept., Univ. of Texas at Arlington, Mar. 2005.
[21] S.S. Pradhan and K. Ramchandran, “Distributed Source Coding Using Syndromes (DISCUS): Design and Construction,” IEEE Trans. Information Theory, vol. 49, no. 3, pp. 626-643, Mar. 2003.
[22] A. Goel and K. Munagala, “Balancing Steiner Trees and Shortest Path Trees Online,” Proc. 11th ACM-SIAM Symp. Discrete Algorithms, Jan. 2000.
[23] B. Raghavachari, S. Khuller, and N. Young, “Balancing Minimum Spanning and Shortest Path Trees,” Proc. Fourth ACM-SIAM Symp. Discrete Algorithms, Jan. 1993.
[24] A. Meyerson, K. Munagala, and S. Plotkin, “Cost-Distance: Two Metric Network Design,” Proc. 41st Ann. Symp. Foundations of Computer Science, Nov. 2000.
[25] C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, pp. 247-266, 1998.
[26] R. Motwani and P. Raghavan, Randomized Algorithms, pp. 148-159, 1995.

Index Terms:
Wireless sensor networks, data fusion, routing, randomized algorithm, approximation.
Citation:
Hong Luo, Yonghe Liu, Sajal K. Das, "Routing Correlated Data with Fusion Cost in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 11, pp. 1620-1632, Nov. 2006, doi:10.1109/TMC.2006.171
Usage of this product signifies your acceptance of the Terms of Use.