Research On Node Scheduling Scheme For Target Tracking Sensor Networks

Target tracking is an important application of wireless sensor networks, such as vehicle tracking in military surveillance and wild animal tracking in habitat monitoring. In these applications, tracking quality and network lifetime are two conflicting requirements due to the limited battery power of the sensor nodes.Most works recently in target tracking application focus on the deployment phase of wireless sensor networks, static optimization of network parameters, such as the deployment scheme of sensor nodes. How to schedule sensors dynamically and timely by taking into account of both the energy consumption and tracking quality is still a challenge during the target's movement.The goal is to find the optimal subset of sensors which will be waked up in next tracking period, in order to not only maximize the lifetime of the network but also provide certain tracking quality guarantee. A probabilistic-based dynamic non-complete k-coverage method,α-k-coverage, is proposed, which can guarantee that target moving area is covered by at least k sensors under at leastαprobability. Then, propose a novel energy-efficient sensor scheduling scheme to balancing tracking quality and network lifetime under ?α-k-coverage condition. An anycast-based tracking handoff scheme is proposed, in order to wake up these sensors of the optimal subset and finish scheduling handoff, and optimize information query.A simulator to simulate the moving target tracking environment has been developed. The proposed sensor scheduling scheme has been evaluated. This study is a combination of theoretical analysis and simulated evaluations, the correctness and effectiveness of the proposed scheduling scheme are validated through theoretical proofs and extensive simulation experiments.