摘要
由于在任意连通网络中搜索最小连通支配集(minimum connected domination set,简称MCDS)是NP完全问题,提出了一种拓扑感知的MCDS启发式算法--TACDS(topology-aware connected domination set),并证明了其正确性.通过利用节点的拓扑特性,减小了支配节点选择的盲目性.该算法能够根据2跳内的局部拓扑信息构造出较小的CDS(connected domination set),从而得到基于该支配集的虚拟骨干网.仿真结果表明,该算法优于其他分布式CDS算法,可以更好地近似MCDS.
Because finding a minimum connected domination set (MCDS) for a general connected network is NP-complete,a topology-aware heuristic algorithm is proposed in this paper whose correctness is proved.By taking advantage of the topology characteristic of nodes,the algorithm can reduce the blindness in the process of selecting dominating nodes,and form a smaller CDS (connected domination set) based on 2-hop local information,consequently obtain a virtue backbone network with the CDS.The simulation results show that the algorithm is superior to other distributed CDS algorithms,and closer to minimum CDS.
出处
《软件学报》
EI
CSCD
北大核心
2010年第6期1416-1425,共10页
Journal of Software
关键词
无线网络
虚拟骨干网
连通支配集
分布式算法
拓扑特性
wireless network
virtue backbone network
connected dominating set
distributed algorithm
topology characteristic