摘要
为了优化随机部署的传感器网络的覆盖率,提出了基于最小覆盖重叠(MCO,Minimum Coverage Overlap)的分布式移动部署算法。算法执行时,每个节点根据获得的邻居节点位置信息,计算节点覆盖圆周上覆盖重叠的分布情况,并沿着最大程度减小覆盖重叠的方向移动。通过算法的迭代运行,使网络覆盖重叠程度尽量减小,从而最大限度的优化了网络的覆盖率。仿真结果表明,与基于Voronoi图的算法相比,MCO算法在覆盖率、移动效率、移动距离和部署时间等方面具有更高的性能。
In order to improve coverage of randomly deployed wireless sensor networks, a deployment algorithm based on Minimum Coverage Overlap （MCO） is proposed. In this algorithm, each node acquires the distribution of coverage overlaps （CO） on the coverage circle based on its neighbors＇ positions and moves at the direction in which the coverage overlap will be the mostly decreased. With the algorithm iterating, the coverage overlap of all nodes will be decreased and the total coverage is obviously increased. Simulation results show that MCO has advantages over algorithms based on Voronoi diagram in terms of coverage, moving efficiency, moving distance, and deploying time.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2008年第13期3604-3609,共6页
Journal of System Simulation
基金
综合业务网理论与关键技术国家重点实验室基金资助项目(00JS63.2.1.DZ01)
关键词
无线传感器网络
覆盖
部署
移动传感器
wireless sensor networks
coverage
deployment
movement-assisted sensor
