完全覆盖热点区域的多重覆盖算法  

Multi-covering algorithm for covering hot spots completely

作　　者：付海涛[1] 柴乔林[1] 李涛[1] 

机构地区：[1]山东大学计算机科学与技术学院,济南250101

出　　处：《计算机工程与应用》2010年第35期69-71,89,共4页Computer Engineering and Applications

摘　　要：针对传感器网络中节点的部署和覆盖问题,提出了一种完全覆盖热点区域的多重覆盖算法。该算法根据网络覆盖质量计算出覆盖某一指定区域所需要的移动节点和静止节点数目。移动节点在虚拟力的作用下到达合适的位置,使得该区域中的热点区域能被完全覆盖,整个区域的节点分布相对比较均匀。仿真实验表明,该算法具有良好的性能,达到了预期的目标。To implement the deployment and coverage problem of sensor nodes in wireless sensor networks,a multi-covering algorithm for covering hot spots completely is proposed.The algorithm can calculate the number of mobile nodes and static nodes that can cover a designated area.Then the mobile nodes reach the right place under the virtual force.As a result,hot spots in the area can be completely covered,and node distribution in the area is relatively uniform.Simulation results show that the algorithm has good performance,and it achieves the desired objectives.

关 键 词：热点区域 节点部署 多重覆盖 混合网络 虚拟力 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]