有向传感器网络覆盖增强问题的贪婪迭代算法  

A Greedy Iterative Algorithm of Coverage Enhancing Problem in Directional Sensor Networks

作　　者：陆克中[1,2] 冯禹洪[1,2] 毛睿[1,2] 罗秋明[1,2] 刘刚 

机构地区：[1]深圳大学计算机与软件学院,广东深圳518060 [2]国家高性能计算中心深圳分中心,广东深圳518060

出　　处：《电子学报》2012年第4期688-694,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61003272;No.61170076;No.61103001)

摘　　要：在有向传感器网络中,可以通过调整节点的感知方向来增强目标区域的覆盖率.提出了有向传感器网络覆盖增强问题的一种贪婪迭代算法,在每次迭代中,调整那些使得覆盖率增加最大的节点的感知方向,重复此迭代过程直至通过调整任一节点的感知方向已不能再增加覆盖率.此外,还提出了一种通过计算几何求解该算法中区域计算问题的方法,以提高计算精度和减少计算时间.大量的仿真实验结果表明,该算法的执行时间较短,收敛速度较快,能够获得比现有算法更高的目标区域覆盖率.In directional sensor networks,the coverage of the target region can be enhanced by adjusting the sensing directions of nodes.A greedy iterative algorithm of coverage enhancing problem in directional sensor network is proposed.In each iteration,the sensing directions of those nodes that can most increase the coverage are adjusted.This iteration process is repeated until the coverage cannot be increased by adjusting the sensing direction of any node.Moreover,a computational geometry method for region calculations in this algorithm is proposed to improve the computational accuracy and reduce the computing time.Extensive simulation results have shown that this algorithm has fast convergence speed and short execution time.And it outperforms existing algorithms with respect to the coverage of the target region.

关 键 词：无线传感器网络 有向传感器节点 覆盖增强 贪婪算法 迭代算法 

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