Greedy Sensor Scheduling with Energy Constraint

In this paper, we propose a greedy algorithm to solve a sensor scheduling problem under energy constraints. Our goal is to reduce the total energy consumption, while maintain a predetermined threshold of estimation accuracy at each time slot. Meanwhile, the energy limitation of each sensor has to be satisfied. A greedy algorithm based on a truncate function is employed to tackle this problem. Furthermore, we adopt a group greedy strategy to enhance the performance of the proposed algorithm. The simulation experiments prove that the proposed strategy can effectively adress the problem and show superior performance.