Efficient Sleep Scheduling Algorithm for Target Tracking in Double-Storage Energy Harvesting Sensor Networks

Authors:
Open Access
Publisher website
Google Scholar
Abstract
Target tracking is a typical application in wireless sensor networks. Both energy efficiency and tracking performance are important issues that need to be considered. They are a pair of contradictions most of the time. Saving energy often sacrifices tracking performance, while enhancing tracking performance needs to consume more energy. In this paper, an efficient sleep scheduling algorithm is put forward to tackle the above problem in energy harvesting sensor networks. At first, we modify the probability-based prediction and sleep scheduling (PPSS) algorithm to track the target and further use another sleep scheduling algorithm we proposed to wake tracking nodes when the target is likely to be missed (i.e., it is unsuccessful to wake next-moment tracking nodes). Secondly, a double-storage energy harvesting architecture is employed to increase residual energy of sensor nodes and to extend network lifetime. Simulation results reveal that the proposed sleep scheduling algorithm can improve tracking performance and prolong network lifetime compared with the PPSS algorithm and the proposed algorithm without energy harvesting.
Funding Information
  • National Natural Science Foundation of China (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)
  • National Natural Science Foundation of China (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)
  • National Natural Science Foundation of China (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)
  • Natural Science Foundation of Guangxi Province (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)
  • Natural Science Foundation of Guangxi Province (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)
  • Guilin University of Technology (61162008, 61172055, 61471135, 2013GXNSFGA019004, 2015GXNSFBB139007, 2013ZR02)

This publication has 36 references indexed in Scilit: