Coverage could reflect sensing ability of sensor networks. Most existing coverage enhancing algorithms give only emphasis on 1-coverage degree, but many applications need multi-coverage degree to monitor the region of interest By setting priority in neighbor sensors based on partial greedy principle and making the largest virtual force sensor move first, a distributed k-coverage-enhancing based on greedy algorithm (KCEGA) was proposed. Based on k-coverage decision algorithm (KCDA) ,a sensor's perimeter coverage and virtual force were calculated, and the greedy principle was applied to improve sensor's move efficiency and decrease the number of algorithm iterations. The simulated results showed that, compared with the random deployment wireless sensor networks,the algorithm enormously increase k-coverage degree. Furthermore, KCEGA outperformed KCEA in terras of convergence velocity and network energy with the same simulation conditions.%覆盖问题反映传感器网络的感知能力.许多应用场合需要对感兴趣区域进行多覆盖,然而目前大部分的算法仅解决了一重覆盖增强问题.提出了一种给邻域内的节点设置优先级并且依据局部贪心原则使得受虚拟力最大的节点率先移动的k重覆盖增强算法(KCEGA).利用k重覆盖判定算法(KCDA),计算节点自身周界覆盖度以及节点所受的虚拟力大小,并利用贪心原则提高节点移动效率,减少算法迭代次数.仿真结果表明:该方法较随机部署的传感器网络k重覆盖度有了大幅提升,且KCEGA比KCEA具有更快的收敛速度,节约了网络能量.
展开▼
