Energy-efficient Sensor Scheduling to Accommodate Real-time Surveillance Orders

This paper addresses the minimal energy scheduling problem in sensor networks to accommodate real-time surveillance orders. Assume we are given a set of sensors with adjustable sensing ranges and surveillance orders arrive in real time at a base station. Under the constraints that a sensor can deal with one order and an order only need to be handled by one sensor at a time, the base station schedules sensors to perform the orders such that the energy consumption is minimized. Our solution is optimal and simulation results show that our optimal solution performs better than another heuristic scheduling algorithm in terms of both energy consumption and percentage of scenarios in which all surveillance orders are accepted