Skip to main content

Advertisement

Log in

A Coverage-Based Scheduling Algorithm for WSNs

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

Node scheduling in wireless sensor networks (WSNs) plays a vital role in conserving energy and lengthening the lifetime of networks, which are considered as prime design challenges. In large-scaled WSNs, especially where sensor nodes are deployed randomly, 100 % coverage is not possible all the times. Additionally, several types of applications of WSNs do not require 100 % coverage. Following these facts, in this paper, we propose a coverage based node scheduling algorithm. The algorithm shows that by sacrificing a little amount of coverage, a huge amount of energy can be saved. This, in turns, helps to increase the lifetime of the network. We provide mathematical analysis, which verifies the correctness of the proposed algorithm. The proposed algorithm ensures balanced energy consumption over the sensor networks. Moreover, simulation results demonstrate that the proposed algorithm almost doubles the lifetime of a wireless sensor network by sacrificing only 5–8 % of coverage.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Zairi, S., Zouari, B., Niel, E., Dumitrescu, E.,(2012, March). Nodes self-scheduling approach for maximising wireless sensor network lifetime based on remaining energy. Wireless Sensor Systems, IET, vol.2, no.1, 52–62.

  2. Liu, C., K. Wu, Y. Xiao, and B. Sun (2006, June). Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 17(6), 562–575.

    Google Scholar 

  3. Wu, K., Y. Gao, F. Li, and Y. Xiao (2005, December). Lightweight deployment-aware scheduling for wireless sensor networks. Mobile Networks and Application 10(6), 837–852.

    Google Scholar 

  4. Buddha Singh, D. K. Lobiyal (2013). Traffic-Aware Density-Based Sleep Scheduling and Energy Modeling for Two Dimensional Gaussian Distributed Wireless Sensor Network. Wireless Personal Communications, 70(4), 1373–1396

  5. Xiao, Y., H. Li, Y. Pan, K. Wu, and J. Li (2004, November). On optimizing energy consumption for mobile handsets. IEEE Transactions on Vehicular Technology 53(6), 1927–1941.

    Google Scholar 

  6. Wang, L. and Y. Xiao (2006). A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Networks and Application 11(5), 723–740.

    Google Scholar 

  7. Bachir, A., D. Barthel, M. Heusse, and A. Duda (2006, January). A synthetic function for energy-delay mapping in energy efficient routing. In Third Annual Conference on Wireless On-demand Network Systems and Services, (WONS 2006), pp. 170–178.

  8. Feeney, L. and M. Nilsson (2001). Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In 20th Annual Joint Conference of the IEEE Computer and Communications Societies, (INFOCOM 2001), Volume 3, pp. 1548–1557.

  9. Boaventura, AlírioSoares and Carvalho, NunoBorges (2013). A Low-Power Wakeup Radio for Application in WSN-Based Indoor Location Systems. International Journal of Wireless Information Networks 20(1), 67–73

    Google Scholar 

  10. Shih, E., S. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan (2001, July). Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In 7th ACM Annual International Conference on Mobile Computing and Networking, (MobiCom 2001), pp. 272–287.

  11. Kuo, J. C.,W. Liao, and T. C. Hou (2009, October). Impact of node density on throughput and delay scaling in multi-hop wireless networks. IEEE Transactions on Wireless Communications 8(10), 5103–5111.

  12. Tian, D. and N. D. Georganas (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks. In The 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 32–41.

  13. Ye, F., G. Zhong, S. Lu, and L. Zhang (2003, May). PEAS: A robust energy conserving algorithm for long-lived sensor networks. In IEEE 23rd International Conference on Distributed Computing Systems, (ICDCS 2003), pp. 28–37.

  14. Shazly, M., Elmallah, E.S., Harms, J., AboElFotoh, H.M.F., (2011, October). On area coverage reliability of wireless sensor networks, IEEE 36th Conference on Local Computer Networks (LCN), 580–588.

  15. Wang, L. and S. Kulkarni (2006). Sacrificing a little coverage can substantially increase network lifetime. In Third Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, (IEEE SECON 2006), pp. 326–335.

  16. Megerian, B., F. Koushanfar, M. Potkonjak, and M. Srivastava (2005, February). Worst and best-case coverage in sensor networks. IEEE Transactions on Mobile Computing 4(1), 84–9.

    Google Scholar 

  17. Xu, X., S. Sahni, and N. Rao (2008, July). Minimum-cost sensor coverage of planar regions. In 11th International Conference on Information Fusion, pp. 1–8.

  18. Zhang, H. and J. Hou (2005). Maintaining sensing coverage and connectivity in large sensor networks. An International Journal on Wireless Ad Hoc and Sensor Networks 1(2), 89–124.

    Google Scholar 

  19. Mamun, Q., S. Ramakrishnan, and B. Srinivasan (2010 l). Selecting member nodes in a chain oriented WSN. In IEEE Wireless Communications and Networking Conference, (WCNC 2010), pp. 1 –6.

  20. Mostafaei, Habib and Meybodi, MohammadReza (2013). A Low-Power Wakeup Radio for Application in WSN-Based Indoor Location Systems, International Journal of Wireless Information Networks 20(1), 67–73.

    Google Scholar 

  21. Gui, C. and P. Mohapatra (2004). Power conservation and quality of surveillance in target tracking sensor networks. In ACM Mobicom 2004, pp. 129–143.

  22. Shu, H., Q. Liang, and J. Gao (2008, April). Wireless sensor network lifetime analysis using interval type-2 fuzzy logic systems. IEEE Transactions on Fuzzy Systems 16(2), 416–427.

    Google Scholar 

  23. Cheng, Z., M. Perillo, and W. Heinzelman (2008, April). General network lifetime and cost models for evaluating sensor network deployment strategies. IEEE Transactions on Mobile Computing 7(4), 484–497.

    Google Scholar 

  24. Zhao, S. and D. Raychaudhuri (2009, October). Scalability and performance evaluation of hierarchical hybrid wireless networks. IEEE/ACM Transactions on Networking 17(5), 1536–1549.

    Google Scholar 

  25. Tabassum, N., Q. Mamun, and Y. Urano (2006). COSEN: A chain oriented sensor network for efficient data collection. In Third International Conference on Information Technology: New Generations, (ITNG 2006), pp. 262–267.

  26. Mamun, Q (2013). Design Issues in Constructing Chain Oriented Logical Topology for Wireless Sensor Networks and a Solution. Journal of Sensors and Actuator Networks. 2, 354–387.

    Google Scholar 

  27. Wang, D., B. Xie, and D. Agrawal (2008, December). Coverage and lifetime optimization of wireless sensor networks with gaussian distribution. IEEE Transactions on Mobile Computing 7(12), 1444–1458.

    Google Scholar 

  28. Xiao, Y., H. Chen, K. Wu, B. Sun, Y. Zhang, X. Sun, and C. Liu (2010, April). Coverage and detection of a randomized scheduling algorithm in wireless sensor networks. IEEE Transactions on Computers 59(4), 507–521.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Quazi Mamun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mamun, Q. A Coverage-Based Scheduling Algorithm for WSNs. Int J Wireless Inf Networks 21, 48–57 (2014). https://doi.org/10.1007/s10776-013-0231-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-013-0231-7

Keywords

Navigation