4Estrin D, Govindan R, Heidemann J, Kumar S. Next century challenges: Scalable coordinate in sensor network[C]. In: Proceedings of the 5th ACM/IEEE International Conference on Mobile Computing and Networking. Seattle: IEEE Computer Society, 1999,263-270.
5Garey M L, Johnson D S. Computers and Intractability; A Guide to the Theory of NP-Completeness[M]. San Francisico; W H Freeman, 1979.
6Guha S and Khuller S. Approximation Algorithms for Connected Dominating Sets[J]. Algorithmica, 1998, 20(4): 374-387.
7Ravi Prakash. A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links[J].Wireless Networks,2001,7: 617-625.
8Wu Jie, Li Hai-Lan. On calculating connected dominating set for efficient routing in ad-hoc wireless network[C]. In: Proc third International Workshop on Discrete Algorthims and Methods for Mobile Computing and Communications (DIAL M'99), Seattle, 1999.
9Alzoubi K M, Wan P J, and Frieder O. New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks[A]. Proc. 35th Hawaii Int'l Conf[C]. System Sciences, 2002. 3881-3887.
10Das B, Bharghavan V. Routing in ad-hoc networks using minimum connected dominating sets[C]. In: Proc IEEE International Conference on Communications(ICC'97), Los Vegas, Nevada, 1997. 1-20.
