CAJ | 학술논문

由于在任意连通网络中搜索最小连通支配集(minimum connected domination set,简称MCDS)是NP完全问题,提出了一种拓扑感知的MCDS启发式算法--TACDS(topology-aware connected domination set),并证明了其正确性.通过利用节点的拓扑特性,减小了支配节点选择的盲目性.该算法能够根据2跳内的局部拓扑信息构造出较小的CDS(connected domination set),从而得到基于该支配集的虚拟骨干网.仿真结果表明,该算法优于其他分布式CDS算法,可以更好地近似MCDS.
유우재임의련통망락중수색최소련통지배집(minimum connected domination set,간칭MCDS)시NP완전문제,제출료일충탁복감지적MCDS계발식산법--TACDS(topology-aware connected domination set),병증명료기정학성.통과이용절점적탁복특성,감소료지배절점선택적맹목성.해산법능구근거2도내적국부탁복신식구조출교소적CDS(connected domination set),종이득도기우해지배집적허의골간망.방진결과표명,해산법우우기타분포식CDS산법,가이경호지근사MCDS.