Support path with time constraint in wireless sensor networks

Target traversing has been an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The support path is to find a path among sensors so that the target's support from the sensors is minimized, where support of the target from a sensor is defined as the inversely proportional to the distance of the target from the sensor. Most existing algorithms ensure the target to stay as close as possible from sensors or deploy sensors to enhance the coverage to the target. In this paper, we take into account the situation where the target must trave the sensor networks within time constraint. We propose some algorithms for the target to not only stay as close as possible from sensors, but also traverse the sensing field within time constraint. Simulations show that the proposed algorithms can solve the traversal path in wireless sensor networks.