[1] |
唐勇, 周明天, 张欣 . 无线传感器网络路由协议研究进展[J]. 软件学报, 2006,17(3): 410-421. TANG Y , ZHOU M T , ZHANG X . Overview of routing protocols in wireless sensor networks[J]. Journal of Software, 2006,17(3): 410-421.
|
[2] |
GAREY M R , JOHNSON D S . Computers and Intractability:A Guide to the Theory of NP-Completeness[M]. New York: W H Freeman &CoPress, 1979.
|
[3] |
DAS B , BHARGHAVAN V . Routing in ad-hoc networks using minimum connected dominating sets[A]. Proceedings of the I E International Conference on Communications[C]. Montreal,Canada, 1997. 376-380.
|
[4] |
DAI F , WU J . An extended localized algorithm for connected dominating set formation in ad hoc wireless networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2004,15(10): 908-920.
|
[5] |
VAHID G , SEYED N , MOJTABA M . Connected dominating set construction using an efficient pruning method in ad hoc networks[A]. Wireless Internet Conference (IEEE WICON) The 5th Annual ICST[C]. Singapore, 2010. 1-8.
|
[6] |
RAJIV M , CHITTARANJAN M . Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2010,21(3): 292-302.
|
[7] |
BO H . Zone-based virtual backbone formation in wireless ad hoc networks[J]. Ad Hoc Networks, 2009,7: 183-200.
|
[8] |
TORKESTANI J A , MEYBODI M R . An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata[J]. Computer Networks, 2010,54: 826-843.
|
[9] |
KIM D Y , ZHANG Z , LI X Y ,et al. Better approximation algorithm for computing connected dominating sets in unit ball graphs[J]. IEEE Transactions on Mobile Computing, 2010,9(8): 1108-1118.
|
[10] |
DING L , GAO X F , WU W L ,et al. Distributed construction of connected dominating sets with minimum routing cost in wireless networks[A]. Distributed Computing Systems (IEEE ICDCS)[C]. Genoa,Italy, 2010. 448-457.
|
[11] |
WANG Y M , ZHAO D S . A serial MIS based CDS constructing algorithm for wireless networks[A]. Green Computing and Communications(GreenCom)IEEE/ACM Int'l Conference on & Int'l Conference on Cyber Physical and Social Computing (CPSCom)[C]. Hangzhou,China, 2010,466-469.
|
[12] |
DING L , WU W L , WILLSON J ,et al. Efficient algorithms for topology control problem with routing cost constraints in wireless networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2011,22(10): 1061-1069.
|
[13] |
ZHENG C , SUN S X , HUANG T Y . Constructing distributed connected dominating sets in wireless ad hoc and sensor networks[J]. Journal of Software, 2011,22(5): 1053-1066.
|
[14] |
YINA B , SHI H C , SHANG Y . An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks[J]. Journal of Parallel and Distributed Computing, 2011,77: 27-39.
|
[15] |
ZOU F , WANG Y X , XU X H ,et al. New approximations for mini-mumweighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs[J]. Theoretical Computer Scie , 2011,412: 198-208.
|
[16] |
ARIYAM D , CHITTARANJAN M , CHRIS R . An improved greedy construction of CDS in MANET[A]. Wireless Communications and Networking Conference (IEEE WCNC)[C]. Cancun,Mexico, 2011. 790-795.
|