论文部分内容阅读
为了优化随机部署的传感器网络的覆盖率,提出了基于最小覆盖重叠(MCO,Minimum Coverage Overlap)的分布式移动部署算法。算法执行时,每个节点根据获得的邻居节点位置信息,计算节点覆盖圆周上覆盖重叠的分布情况,并沿着最大程度减小覆盖重叠的方向移动。通过算法的迭代运行,使网络覆盖重叠程度尽量减小,从而最大限度的优化了网络的覆盖率。仿真结果表明,与基于Voronoi图的算法相比,MCO算法在覆盖率、移动效率、移动距离和部署时间等方面具有更高的性能。
In order to optimize the coverage of sensor networks deployed randomly, a distributed mobile deployment algorithm based on Minimum Coverage Overlap (MCO) is proposed. When the algorithm is executed, each node calculates the distribution of overlaying overlaps on the coverage circle of the nodes according to the obtained location information of the neighboring nodes and moves along the direction of minimizing the overlaps. Through iterative operation of the algorithm, the coverage of the network coverage is minimized, so as to optimize network coverage to the maximum. Simulation results show that compared with the Voronoi graph-based algorithm, the MCO algorithm has higher performance in terms of coverage, mobility, moving distance and deployment time.