SpringerLink
Log in

Sleep scheduling with expected common coverage in wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, processing, and communication units) independently. The paper also provides a probabilistic method to estimate how much the sensing area of a node is covered by other active nodes in its neighborhood. The method is utilized by the proposed scheduling and routing scheme to reduce the control message overhead while deciding the next modes (full-active, semi-active, inactive/slee**) of sensor nodes. We evaluated our estimation method and scheduling scheme via simulation experiments and compared our scheme also with another scheme. The results validate our probabilistic method for coverage estimation and show that our sleep scheduling and routing scheme can significantly increase the network lifetime while kee** the message complexity low and preserving both connectivity and coverage.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Notes

  1. In this analysis, we assumed that the links between the nodes are mostly reliable and there are no frequent link failures which may affect the data acquisition significantly. However, we can reflect the failure-prone nature of sensor node connections to this formula by multiplying n by λ (the probability that a connection between two connections may fail). Moreover, we can also include non-uniform node distribution in the network by updating the density function f X (x).

  2. We consider the links between nodes individually. If other neighbors of node j can receive Hello message from j (that link may not fail) even though node i can not receive it, they continue with the regular procedure and consider node j’s status while deciding their own status.

References

  1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks.

  2. Younis, M., Youssef, K., & Arisha M. (2002). Energy-aware routing in cluster-based sensor networks. IEEE/ACM MASCOTS.

  3. Wang, L., & **ao, Y. (2006). A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Network Applications, 11(5), 723–740.

    Article  Google Scholar 

  4. Cardei, M., & Wu, J. (2005). Energy-efficient coverage problems in wireless ad hoc sensor networks, Computer Communications, special issue on Sensor Networks, Florida Atlantic University.

  5. Slijepcevic, S., & Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. IEEE International Conference on Communications (ICC), 472–476. Los Angeles, California, USA.

  6. Cardei, M., MacCallum, D., & Cheng, X. (2002). Wireless sensor networks with energy efficient organization. Journal of Interconnection Networks, 3–4(3).

  7. Megerian, S., & Potkonjak, M. (2003). Low power 0/1 coverage and scheduling techniques in sensor networks, UCLA Technical Report.

  8. Yardibi, T., & Karasan, E. (2008). A distributed activity scheduling algorithm for wireless sensor networks with partial coverage. Wireless Networks Journal.

  9. Gupta, H., Das, S. R. & Gu, Q. (2003). Connected sensor cover: Self-organization of sensor networks for efficient query execution. In Proceedings of MobiHoc’03. USA.

  10. Bulut, E., & Korpeoglu, I. (2007). DSSP: A dynamic sleep scheduling protocol for prolonging the lifetime of wireless sensor networks. In Proceedings of IEEE Conference AINA.

  11. Xu, Y., Heidemann, J. S., & Estrin, D. (2001). Geography-informed energy conservation for Ad Hoc routing. International Conference on Mobile Computing and Networking.

  12. Ye, F., Zhong, G., Lu, S., & Zhang, L. (2003). PEAS: A robust energy conserving protocol for long-lived sensor networks. In The 23rd international conference on distributed computing systems.

  13. Ye, F., Lu, S., & Zhang L. (2001). Gradient broadcast: A robust, long-lived large sensor network, Technical Report, http://www.irl.cs.ucla.edu/papers/grab-tech-report.p.

  14. Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2002). Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless Networks, 8, 481–494.

    Google Scholar 

  15. Tian, D., & Georganas, N. (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of international workshop on wireless sensor networks and applications. USA.

  16. Zhang, H., & Hou, J. C. (2005). Maintaining sensing coverage and connectivity in large sensor networks. Wireless Ad Hoc and Sensor Networks Journal, 1(12), 89–123.

    Google Scholar 

  17. Wang, X., **ng, G., Zhang, Y., Lu, C., Pless, R., & Gill, C. (2003). Integrated coverage and connectivity configuration in wireless sensor networks. In Proceedings of Sensys 03 (pp. 28–39).

  18. Crossbow Technology Inc. http://www.xbow.com, available Sept. 07.

  19. Dust Inc. Products, http://www.dust-inc.com/products, available Sept. 07.

  20. Ray, S., Lei, W., & Paschalidis, I. (2006). Statistical location detection with sensor networks. IEEE/ACM Transactions on Networking, 14(SI), 2670–2683.

    Google Scholar 

  21. Niculescu, D., & Badrinath, B. R. (2003). Ad hoc positioning system (APS) using AOA. In Proceedings of INFOCOM.

  22. Bulut, E., Zheng, J., Wang, Z. & Szymanski B. (2008). Balancing the cost-quality tradeoff in cooperative ad hoc and sensor networks. In Proceedings of IEEE MILCOM. CA: San Diego Convention Center.

  23. Huang, C., & Tseng, Y. (2003). The coverage problem in a wireless sensor network. In WSNA 03: Proceedings of the 2nd ACM international conference on wireless sensor networks and applications. USA.

  24. Babbit, T., Morrell, C., & Szymanski, B. K. (2009). Self-selecting reliable path routing in diverse wireless sensor network environments. In Proceedings of IEEE International Symposium on Computers and Communication, ISCC 09 (pp. 1–7). Sousse, Tunisia.

  25. Al-Fares, M. S., Sun, Z., & Cruickshank, H. (2009). High survivable routing protocol in self organizing wireless sensor network. IAENG International Journal of Computer Science, 36, 2.

    Google Scholar 

  26. Jia, Y., Dong, T., & Shi, J. (2005). Analysis on energy cost for wireless sensor networks. In ICESS’05: Proceedings of the second international conference on embedded software and systems.

  27. Heinzelman, W., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocols for wireless microsensor Networks. International Conference on System Sciences.

  28. Kasten, O. Energy consumption, http://www.inf.ethz.ch/kasten/research/bathtub/energy/consumption.html.

  29. Jung, E., & Vaidya, N. (2002). An energy efficient MAC protocol for wireless LANs. INFOCOM.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA

    Eyuphan Bulut

  2. Department of Computer Engineering, Bilkent University, 06800, Ankara, Turkey

    Ibrahim Korpeoglu

Authors
  1. Eyuphan Bulut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ibrahim Korpeoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ibrahim Korpeoglu.

Additional information

This work is supported in part by European Union FP7 Framework Program FIRESENSE Project 244088.

This work has been done while the first author (Eyuphan Bulut) was an M.S. student in the Department of Computer Engineering of Bilkent University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bulut, E., Korpeoglu, I. Sleep scheduling with expected common coverage in wireless sensor networks. Wireless Netw 17, 19–40 (2011). https://doi.org/10.1007/s11276-010-0262-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0262-2

Keywords

Search

Navigation