Heuristic algorithms for real-time data aggregation in wireless sensor networks
暂无分享,去创建一个
[1] Ernst Althaus,et al. Approximating k-hop minimum-spanning trees , 2005, Oper. Res. Lett..
[2] Christos H. Papadimitriou,et al. On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.
[3] Deborah Estrin,et al. The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.
[4] Clyde L. Monma,et al. Transitions in geometric minimum spanning trees (extended abstract) , 1991, SCG '91.
[5] Samir Khuller,et al. Low-Degree Spanning Trees of Small Weight , 1996, SIAM J. Comput..
[6] R. Ravi,et al. Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.
[7] D. Leang,et al. Smart SensorDVB: sensor network development boards with smart antennas , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).
[8] Laurent Alfandari,et al. Approximating minimum spanning tree of depth 2 , 1999 .
[9] Clyde L. Monma,et al. Transitions in geometric minimum spanning trees , 1991, SCG '91.
[10] Wendi Heinzelman,et al. Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.
[11] Jan M. Rabaey,et al. Data funneling: routing with aggregation and compression for wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..