Moving Targets Tracking and Observing in a Distributed Mobile Sensor Network

Tracking and observing multiple dynamic targets is an important task in mobile sensor networks. This paper presents a novel approach to the problem of sensor splitting/merging for a mobile sensor network to track and observe multiple targets in a dynamic fashion. In this approach, a seed growing graph partition (SGGP) algorithm is proposed to solve the splitting/merging problem. Furthermore, during the process of tracking, collision avoidance and velocity matching among mobile sensors are guaranteed. To demonstrate the benefit of the SGGP algorithm in term of the total energy and time consumption when sensors split, we compare the SGGP with a random selection (RS) algorithm. Numerical experimental tests validate our theoretical results.