Approximation algorithm for constructing data aggregation trees for wireless sensor networks

Frontiers of Computer Science in China

Volumn 3, Issue 4, 2009, Pages 524-534

  Li, Deying ^a   Cao, Jiannong ^b   Zhu, Qinghua ^a  

^a Renmin University of China   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Approximation algorithm; Data aggregationtree; Distributed algorithm; WSNs

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; PARALLEL ALGORITHMS; SENSOR NODES;

DATA AGGREGATIONTREE; DEGREE OF SCALABILITY; EXTENSIVE SIMULATIONS; GREEDY ALGORITHMS; PERFORMANCE RATIO; SOURCE NODES; WIRELESS SENSOR NETWORK (WSNS); WSNS;

TREES (MATHEMATICS);

EID: 78650686126     PISSN: 16737350     EISSN: 16737466     Source Type: Journal    
DOI: 10.1007/s11704-009-0039-x     Document Type: Article

References (22)

1. Culler D, Estrin D, Srivastava M. Overview of sensor networks. Computer, 2004, 37(8): 41-49
2. Chong C-Y, Kumar S P. Sensor networks: evolution, opportunities, and challenges. In: Proceedings of the IEEE, 2003, 91(8): 1247-1256
3. th ACM-SIAM Symposium on Discrete Algorithms. 2003,499-505
4. Karl H, Lobbers M, Neberg T. A data aggregation framework for wireless sensor networks. Technical report TKN-03-016, Telecommunication Network Group, Technical University Berlin, Sept. 2003
5. Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'00). Boston, MA, 2000, 56-67
6. Yu Y, Krishnamachari B, Prasanna V K. Energy-latency tradeoffs for data gathering in wireless sensor networks. In: Proceedings of the 23rd Conference of IEEE Communication Society (INFOCOM'04). Hong Kong, 2004, 255-266
7. Schurgers C, Aberhorne O, Srivastava M B. Modulation scaling for energy-aware communication systems. In: Proceedings of International Symposium on Low Power Electronics and Design (ISLPED'01). Huntington Beach, CA, 2001, 96-99
8. Prabhakar B, Uysal-Biyikoglu E, Gamal A E. Energy-efficient transmission over a wireless link via lazy packet scheduling. In: Proceedings of the 20th Conference of IEEE Communication Society (INFO-COM'01). 2001, 386-394
9. Intanagonwiwat C, Estrin D, Govindan R, et al. Impact of network density on data aggregation in wireless sensor networks, In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02). Austria, 2002, 457-458
10. Kalpakis K, Dasgupta K, Namjoshi P. Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. The International Journal of Computer and Telecommunications Networking, 2003, 42(6): 697-716
11. Wu Y, Fahmy S, Shroff N. On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm. In: Proceedings of the 26rd Conference of IEEE Communication Society (INFOCOM'08). 2008, 356-360
12. Ding M, Cheng X, Xue G. Aggregation tree construction in sensor networks. In: Proceedings of IEEE VTC'03. 2003, 2168- 2172
13. Du H, Hu H, Jia X, Energy efficient routing and scheduling for real time data aggregation in wireless sensor networks. Computer Communications, 2006, 29(17): 3527-3535
14. Luo H, Liu Y, Das K. Routing correlated data with fusion cost in wireless sensor networks. IEEE Trans. on Mobile Computing, 2006, 5(11): 1620-1632
15. Li D, Liu Q, Jia X, et al. Energy efficient multicast routing in ad hoc networks. Computer Commuinations, 2007, 30: 3746-3756
16. Chen X, Hu X, Zhu J. Minimum data aggregation time problem in wireless sensor networks. In: Proceedings of 1st int'l Conferenve on Mobile Ad-hoc and Sensor Networks-MSN05. 2005, 133-142
17. Huang S, Wan P-J, Vu C T, et al. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings of the 26rd Conference of IEEE Communication Society (INFO-COM'07). 2007, 366-372
18. Li D, Cao J, Liu M, et al. Construction of optimal data aggregation trees for wireless sensor networks. In: Proceedings of ICCCN06. 2006,475-480
19. Garey M, Johnson D. The rectilinear steiner tree is NP-complete. SIAM Journal on Applied Mathematics, 1997, 32(4): 826-834
20. Chen D, Du D, Hu X, et al. Approximateins for steiner trees with minimum number of steiner points. Theoretical Computer Science, 2001,262: 83-99
21. Mandoiu I, Zelikovsky A. A note on the MST heuristic for bounded edge-length steiner trees with minimum number of steiner points. Information Processing Letters, 2000, 75(4):165-167
22. Awerbuch B. Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems. In: Proceedings of 19th ACM Symp. on Theory of Computing, ACM, New York. 1987, 230-240