Random and Periodic Sleep Schedules for Target Detection in Sensor Networks
- 39 Downloads
We study random and periodic sleep schedules from the point of view of delay in detecting the target. We consider sleep schedules in which a sensor in “inactive” mode wakes up either randomly or periodically to detect presence of the target within its vicinity resulting into two sleep schedules: (a) random wake-up schedule, and (b) periodic wake-up schedule respectively. Specifically, we analyse and obtain for the random wake-up schedule the expected delay in detection, and the delay, such that with probability P, the delay is less than the computed value. For the periodic wake-up schedule we show that there exists an upper bound on the delay. Further we compute the average value of delay. We have shown that the theoretically computed averages and the upper bounds on the delay match with the simulation results for the random wake-up and periodic wake-up schedules.
Keywordssleep schedule energy conservation target detection
Unable to display preview. Download preview PDF.
- 1.David Culler, Deborah Estrin, Mani Srivastava. Overview of sensor networks. IEEE Computer Magazine, August, 2004, 37(8): 41–49.Google Scholar
- 2.Deborah Estrin, Lewis Girod, Greg Pottie, Mani Srivastava. Instrumenting the world with wireless sensor networks. In Proc. International Conference on Acoustics, Speech and Signal Processing (ICASSP 2001), Salt Lake City, Utah, May 2001, pp.1–4.Google Scholar
- 3.Crossbow: Wireless Sensor Networks. http://www.xbow.com/Products/.
- 4.Wei Ye, John Heidemann, Deborah Estrin. An energy-efficient MAC protocol for wireless sensor networks. In Proc. 21st International Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), New York, NY, USA, 2002, pp.171–180.Google Scholar
- 5.Sha Liu, Kai-Wei Fan, Prasun Sinha. Dynamic sleep scheduling using online experimentation for wireless sensor networks. In Proc. Third International Workshop on Measurement, Modeling, and Performance Analysis of Wireless Sensor Networks, SenMetrics 2005, San Diego, CA, USA, 2005.Google Scholar
- 6.Huan Li, Prashant Shenoy, Krithi Ramamritham. Scheduling communication in real-time sensor applications. In Proc. IEEE RTAS 2004, May 2004, pp.10–18.Google Scholar
- 7.Barbara Hohlt, Lance Doherty, Eric Brewer. Flexible power scheduling for sensor networks. In Proc. IEEE and ACM Third International Symposium on Information Processing in Sensor Networks, IPSN, Berkeley, USA, 2004, pp.205–214.Google Scholar
- 8.Di Tian, Nicolas D Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA, 2002, pp.32–41.Google Scholar
- 9.Xu Y, Heidemann J, Estrin D. Geography, informed energy conservation for ad hoc routing. In Proc. ACM MobiCom, Rome, Italy, 2001, pp.70–84.Google Scholar
- 10.Ye F, Zhong G, Cheng J, Lu S W, Zhang L X. PEAS: A robust energy conserving protocol for long-lived sensor networks. In Proc. IEEE International Conference on Distributed Computing Systems, 2003, pp.28–37.Google Scholar
- 11.Chao Gui, Prasant Mohapatra. Power conservation and quality of surveillance in target tracking sensor networks. In Proc. ACM MobiCom 2004, Philadelphia, Pennsylvania, USA, 2004, pp.129–143.Google Scholar
- 12.Chih Hsin, Mingyan Liu. Network coverage using low dutycycled sensors: Random and coordinated sleep algorithms. In Proc IPSN 2004, Berkeley, California, USA, 2004, pp.433–442.Google Scholar
- 13.Qing Cao, Tarek F Abdelzaher, Tian He, John A Stankovic. Towards optimal sleep scheduling in sensor networks for rare event detection. In Proc. The Fourth International Conference on Information Processing in Sensor Networks, Los Angeles, USA, 2005.Google Scholar
- 14.Sheldon M Ross. Wald's Equation. Introduction to Probability Models, Elsevier, 2003, pp.651–652.Google Scholar