基于 Voronoi 网格传感网络近似最少连通覆盖值算法
On an Approximately Minimum Connection and Coverage Sets Algorithm for Sensor Network Based on Voronoi
-
摘要: 基于并行处理理念使用Voronoi网格可将平面区域划分为几何体集合的性质，提出了传感器网络正六边形剖分的近似连通最少覆盖算法（ACA‐RH）．Sink节点将信息收集区域进行正六边形网格剖分，然后让传感器节点与各个正六边形网格的位置进行比较来决定自己是工作还是睡眠，从而构造近似连通最少覆盖集．经过理论分析与仿真实验表明，ACA‐RH算法时间复杂度和所需要节点的数量少于SCR‐CADS算法、So&Ye算法．Abstract: Based on the feature that Voronoi grid is capable of dividing plane domain into simple geometry gatherings and on the theory of parallel collecting ,this paper puts forward an approximately minimum con‐necting algorithm(ACA‐RH) for wireless sensor network partitioned by regular hexagons (grids) to con‐struct the minimum connecting coverage ,in w hich sink nodes divide information collecting area into regu‐lar hexagons ,and the sensors decide to work or sleep by calculating its distance to the center of the grid it belongs to .Theoretical analysis and simulation show that ACA‐RH has better performance in time com‐plexity ,and it requires less grids ,compared with SCR‐CADS and So&Ye algorithms .
-
-
计量
- 文章访问数: 360
- HTML全文浏览数: 185
- PDF下载数: 0
- 施引文献: 0
下载: