The Minimal Exposure Path in Mobile Wireless Sensor Network

Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target´s moving paths. The minimal exposure path problem is to find a path among sensors so that the target´s total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this paper, we take into account the situation where there are moving sensors as well. We propose an effective algorithm based on tangent to not only stay as far as possible from static sensors, but also avoid mobile sensors. Simulations show that the proposed algorithms can solve the traversal path with mobile sensors´ patrolling in wireless sensor networks.