Random and Periodic Sleep Schedules for Target Detection in Sensor Networks

We study random andperiodic sleep schedules from the point of view of delay in detectingthe target. We consider sleep schedules in which a sensor in"inactive" mode wakes up either randomly or periodically to detectpresence of the target within its vicinity resulting into two sleepschedules: (a) random wake-up schedule, and (b) periodic wake-upschedule respectively. Specifically, we analyse and obtain for therandom wake-up schedule the expected delay in detection, and thedelay, such that with probability P, the delay is less than thecomputed value. For the periodic wake-up schedule we show that thereexists an upper bound on the delay. Further we compute the averagevalue of delay. We have shown that the theoretically computedaverages and the upper bounds on the delay match with the simulationresults for the random wake-up and periodic wake-up schedules.