Energy efficient correlated data aggregation for wireless sensor networks

International Journal of Distributed Sensor Networks

Volumn 4, Issue 1, 2008, Pages 13-27

  Park, Seung Jong ^a,b   Sivakumar, Raghupathy ^a,c  

^a IEEE

^b Louisiana State University   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Reliable Transport Protocols; Wireless Sensor Networks

Indexed keywords

BANDWIDTH; CORRELATION METHODS; DATA REDUCTION; PROBLEM SOLVING;

DATA AGGREGATION; MINIMUM SPANNING TREE (MST); RELIABLE TRANSPORT PROTOCOLS;

WIRELESS SENSOR NETWORKS;

EID: 38749118624     PISSN: 15501329     EISSN: 15501477     Source Type: Journal    
DOI: 10.1080/15501320701774592     Document Type: Conference Paper

References (21)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Computer Networks Journal, vol. 38, no. 4, pp. 393-422, March 2002.
2. Seung-Jong Park, R. Vedantham, R. Sivakumar, and I.F. Akyildiz, "A scalable approach for reliable downstream data delivery in wireless sensor networks," in ACM MOBIHOC, Tokyo, Japan, May 2004, pp. 78-89.
3. Chalermek Intanagonwiwat, Ramesh Govindan, and Deborah Estrin, "Directed diffusion: a scalable and robust communication paradigm for sensor networks," in MOBICOM, Boston, USA, Aug. 2000, pp. 56-67.
4. B. Karp and H.T. Kung, "Greedy perimeter stateless routing for wireless networks," in MOBICOM, Boston, USA, Aug. 2000, pp. 243-254.
5. O. B. Akan and I. F. Akyildiz, "Event-to-sink reliable transport in wireless sensor networks," IEEE/ACM Transactions on Networking, vol. 13, no. 5, pp. 1003-1017, October 2005.
6. Alexander Zelikovsky, "Better approximation bounds for the network and Euclidean Steiner Tree problems," in Tech. Rep. CS-96-06, University of Virginia, Charlottesville, VA, USA, 1996.
7. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "On network correlated data gathering," in INFOCOM, Hong Kong, Mar. 2004.
8. R. M. Karp, Reducability Among Combinatorial Problems, Complexity of Computer Computations, R. E. Miller and. J. W. Thatcher, Plenum. Press, New York, 1972.
9. David R. Karger and Maria Minkoff, "Building Steiner Trees with incomplete global knowledge," in Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, 2000.
10. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Japonica 24, vol. 24, no. 1, pp. 573-577, Jan. 1980.
11. E. N. Gilbert and H. O. Pollak, "Steiner Minimal Trees," in SIAM J. Applied Math, 1968, vol. 16, pp. 1-20.
12. Ning-Yang B. Wang and Reui-Chuan Chang, "An upper bound for the average length of the Euclidean Minimum Spanning Tree," in J. Computer Math, 1989, vol. 30, pp. 1-12.
13. W. Yuan, S. V. Krishnamurthy, and S. K. Tripathi, "Synchronization of Multiple Levels of Data Fusion in Wireless Sensor Networks," 2003.
14. Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, and Lixia Zhang, "TTDD - A Two-Tier Data Dissemination for Large-scale Sensor Networks," in MOBICOM, 2002.
15. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "GHT-A geographic hash-table for datacentric storage," in In First ACM International Workshop on Wireless Sensor Networks and their Applications, 2002.
16. R. Cristescu and M. Vetterli, "Power efficient gathering of correlated data: Optimization,NP-completeness and heuristics," in The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2003.
17. A. Goel and D. Estrin, "Simultaneous optimization for concave cost: Single sink aggregation or single source buy-at-bulk," in ACM-SIAM Symposium on Discrete Algorithm, 2003.
18. R. M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, no. 1, pp. 85-103, May 1972.
19. F. K Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem, North-Holland, 1992.
20. N. Alon and J.H. Spencer, The Probabilistic Method, J. Wiley and Sons, 1992.
21. B. Karp and H. T. Kung, "Gpsr: Greedy perimeter state routing for wireless networks," in MOBICOM, Boston, USA, Aug. 2000, pp. 243-254.