摘要
在节点覆盖约束条件下,以最小化监测站点数目为目标,提出了一种支持多故障定位的监测站点部署方法.该方法以传统k-path算法为基础,使用基于弱连接节点求取独立路径的改进算法来选取监测站点.仿真实验表明:进行故障定位时,该算法所需的监测站点数少于k-path算法,而故障定位能力则强于k-path算法,具有更好的性能.使用该算法在网络中部署监测站点对网络进行主动探测,能以较小的站点部署开销尽早定位网络中的故障.
Under the constraint condition of vertex coverage, a probe station deployment method supporting multiple fault localization was proposed, which aims at minimizing the number of probe stations. This method is based on the traditional k-path algorithm, and uses an improved algorithm, which gets independent paths from weakly connectecl nodes, to select probe stations. Simulation experiments have shown that, compared with k-path algorithm, the method has fewer probe stations while keeping stronger fault localizing capability when used in multiple fault localization. So, the faults in networks can be localized sooner and cost-effectively by using this method to deploy probe sta- tions and implement active probing.
出处
《湖南大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2011年第10期61-67,共7页
Journal of Hunan University:Natural Sciences
基金
国家自然科学基金资助项目(61173168)
国家973计划资助项目(2012CB315801)
东莞市高等院校科技计划资助项目(201010815603)
关键词
故障诊断
主动探测
监测站点部署
独立路径
fault diagnosis
active probing
probe station deployment
independent path
