An Algorithm for Target Traversing Based on Local Voronoi Diagram
一种基于局部Voronoi图的目标穿越算法

Many sensors nodes are deployed in a region of concern to detect any potential targets. On the contrary, intelligent target looks for the best path to traverse the sensing field for fear of being detected. This paper focuses on how an intelligent target traverses the sensing field. This traversing problem is modeled, and a number of path-finding algorithms are designed, implemented and evaluated. Different from previous works which assume complete information of the sensing field, it is assumed that the target only can detect part of the sensor nodes deployment. This makes the proposed methods more practical and reasonable. Extensive experiments with a target and a sensor network confirm the validity of the approaches.