摘要
针对机场噪声监测无线传感网络中的最小连通覆盖集问题,设计了一种基于目标区域Voronoi划分的集中式近似算法,用于分析完全覆盖目标区域所需的最低要求的节点集;为了更好地调整噪声监测节点的感知半径Rs与通信半径Rc的比值关系,在通信半径小于两倍感知半径时,提出了一种基于最小生成树的连通算法用以确保CVT算法构造的覆盖集连通所需的辅助节点。理论分析与仿真实验表明,与现有常用的集中式贪婪算法和DVC算法相比,CVT(+MST)算法的性能在时间复杂性和连通覆盖集大小等两方面都较优。
Target at minimal connected cover set problem of wireless sensor networks in airport noise monitoring, a centralized Voronoi tessellation based approximate algorithm is proposed to construct a near optimal cover set of active sen- sors required to cover the target region completely. In order to better adjust the relationship between sensing radius and com- munication radius to noise monitoring node, a minimum spanning tree based connection algorithm is proposed to ensure the communication connectivity of the cover set. Compared with existing algorithms, the performance of CVT( + MST) algo- rithm is better in terms of the runtime and the size of the constructed connected cover set through theoretical analysis as well as extensive numerical experiments.
出处
《计算机与数字工程》
2014年第5期747-750,770,共5页
Computer & Digital Engineering
基金
国家自然基金重点课题(编号:61139002)
中国民用航空局科研项目(编号:MHRD201101)资助
关键词
噪声监测
无线传感网络
最小连通覆盖
VORONOI划分
最小生成树
noise monitoring, wireless sensor network, minimal connected cover set, voronoi tessellation, minimum spanning tree