摘要
机场噪声检测是近些年来一直困扰我们的一个难题,其中一个关键点是如何解决最小连通覆盖集问题,目前国外解决该问题新的方法有集中式近似算法、令牌驱动、圆周覆盖等,国内有DVC算法、重构Voronoi划分等.研究了在同时满足网络的覆盖性与连通性的前提下,如何选择最少数目工作节点的问题,为得到已知机场区域的最小连通覆盖集,在集中式近似算法的基础上,提出一种改进的最小生成树算法,用来确保该覆盖集连通所需的辅助节点,最后通过实验对设计的算法性能进行评估.
In recent years,airport noise detection has been a difficult problem troubling us,how to solve minimal connected cover set is a key point.Presently,to solve this problem,new methods adopted at abroad include centralized Voronoi tessellation(CVT),token drive and perimeter coverage,while at home DVC algorithm and reconstruction of Voronoi division are applied.This paper conducts a research on the problem of how to select the least number of worknodes on the basis of satisfying the coverage and connectivity of the network.Meanwhile,in order to gain the minimal connected cover set in a given airport area,an improved minimal spanning tree algorithm is proposed based on centralized Voronoi tessellation to ensure the secondary nodes needed for the connectivity of the cover set.Finally,the algorithm performance designed in this paper is assessed through experiments.
作者
马发民
王锦彪
张林
张洁
MA Famin;WANG Jinbiao;ZHANG Lin;ZHANG Jie(Institute of Mathematics and Computer Application,Shangluo University,Shangluo 726000,Shaanxi China;College of Computer Science and Technology,Civil Aviation University of China,Tianjin 300000,China)
出处
《河南科学》
2017年第4期541-547,共7页
Henan Science
基金
国家自然科学基金项目(60472121)
商洛学院自然科学研究项目(15SKY007)
关键词
机场噪声检测
集中式近似算法
DVC算法
改进的最小生成树算法
airport noise detection
centralized Voronoi tessellation(CVT)
DVC algorithm
improved minimal spanning tree algorithm
