References
- [1] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks,” in Proc. ACM MobiCom, Aug. 1999, pp. 174-185.10.1145/313451.313529
- [2] R. C. Prim, “Shortest connection networks and some generalization,” Bell System Technical, vol. 36, no. 6, pp. 1389-1401, 1957.
- [3] A. Goel and K. Munagala, “Balancing steiner trees and shortest path trees online,” in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2000, pp. 562-563.
- [4] R.Cristescu, B. Beferull-Lozano, and M. Vetterli, “On network correlated data gathering,” in Proc. IEEE INFOCOM, vol. 4, Mar. 2004, pp. 2571-2582.
- [5] M. R. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. W. H. Freeman, 1979.
- [6] J. Kennedy and R. C. Eberhart, “Particle Swarm Optimization,” in the IEEE Conf. on Neural Networks, IV, 1995, pp. 1942-1948.
- [7] H. Xia, H. L. Bertoni, and L. R. Maciel, “Radio propagation characteristics for line-of-sight microcellular and personal communications,” Antenna and Propagation, vol. 41, no. 10, pp. 1439-1447, Oct. 1993.
- [8] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed., Springer-Verlag, 1996.10.1007/978-3-662-03315-9
- [9] J. E. Baker, “Adaptive selection methods for genetic algorithms,” in Proc. the 1st International Conference on Genetic Algorithms, 1985, pp. 101-111.
- [10] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” Wireless Communications, vol. 1, no. 4, pp. 660-670, October 2002.10.1109/TWC.2002.804190