Skip to main content
Log in

A Novel Area Coverage Technique for Maximizing the Wireless Sensor Network Lifetime

  • Research Article-Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

This paper presents a mathematical model to geometrically optimize the density of active sensor nodes in a wireless sensor network (WSN) using concentric hexagonal tessellations and the concept of coverage contribution area for randomly deployed nodes in the field of interest (FOI). Some of the WSN applications, such as environmental monitoring, security, surveillance and health care require the target area to be covered a number of times. This number is denoted by a variable \(k\) and is known as the ‘degree of coverage.’ The problem of achieving required degree of coverage is formulated as \(k\)-coverage problem. An algorithm has been proposed to generate maximum number of disjoint-independent subsets of sensor nodes as an optimized solution to the \(k\)-coverage problem, along with maximizing the WSN lifetime. Superiority and efficacy of the technique have been verified by mathematical analysis as well as simulations carried out using MATLAB.

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
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Chao, Y.; Tuan, C.: K-hop coverage and connectivity aware clustering in different sensor deployment models for wireless sensor and actuator networks. Wirel. Pers. Netw. 85(4), 2565–2579 (2015). https://doi.org/10.1007/s11277-015-2920-2

    Article  Google Scholar 

  2. Debnath, S.; Hossain, A.: Network coverage in interference limited wireless sensor network. Wirel. Pers. Commun. 109, 139–151 (2019). https://doi.org/10.1007/s11277-019-06555-z

    Article  Google Scholar 

  3. Choudhari, M.; Das, R.: Efficient area coverage in wireless sensor networks using optimal scheduling. Wirel. Pers. Commun. 107(2), 1187–1198 (2019). https://doi.org/10.1007/s11277-019-06331-z

    Article  Google Scholar 

  4. Elhabyan, R.; Shi, W.; St-Hilaire, M.: Coverage protocols for wireless sensor networks: review and future directions. J. Commun. Netw. 21(1), 45–60 (2019). https://doi.org/10.1109/JCN.2019.000005

    Article  Google Scholar 

  5. Liu, C.; Cao, G.: Spatial-temporal coverage optimization in wireless sensor networks. IEEE Trans. Mobile Comput. 10(4), 465–478 (2011). https://doi.org/10.1109/TMC.2010.172

    Article  Google Scholar 

  6. Yu, J.; Wan, S.; Cheng, X.; Yu, D.: Coverage contribution area based k-coverage for wireless sensor networks. IEEE Trans. Veh. Technol. 66(9), 8510–8523 (2017). https://doi.org/10.1109/TVT.2017.2681692

    Article  Google Scholar 

  7. Pino, T.; Choudhury, S.; Al-Turjman, F.: Dominating set algorithms for wireless sensor networks survivability. IEEE Access 6, 17527–17532 (2018)

    Article  Google Scholar 

  8. Yang, Z.; Li, P.; Bao, Y.; Huang, X.: A multi-dominating-subtree-based minimum connected dominating set construction algorithm. In: IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference, pp. 1077–1082 (2019)

  9. Song, L.; Liu, C.; Huang, H.; Du, H.; Jia, X.: Minimum connected dominating set under routing cost constraint in wireless sensor networks with different transmission ranges. IEEE/ACM Trans. Netw. 27(2), 546–559 (2019)

    Article  Google Scholar 

  10. Sharma, A.; Chauhan, S.: A distributed reinforcement learning based sensor node scheduling algorithm for coverage and connectivity maintenance in wireless sensor network. Wirel. Netw. 26, 4411–4429 (2020)

    Article  Google Scholar 

  11. Hanh, N.T.; Binh, H.; Hoai, N.; Palaniswami, M.S.: An efficient genetic algorithm for maximizing area coverage in wireless sensor networks. Inf. Sci. 488, 58–75 (2019). https://doi.org/10.1016/j.ins.2019.02.059

    Article  MathSciNet  MATH  Google Scholar 

  12. Yang, C.; Chin, K.W.: On nodes placement in energy harvesting wireless sensor networks for coverage and connectivity. IEEE Trans. Ind. Inform. 13(1), 27–36 (2017). https://doi.org/10.1109/TII.2016.2603845

    Article  Google Scholar 

  13. Jamal, N.K.; Gawanmeh, A.: The optimal deployment, coverage, and connectivity problems in wireless sensor networks. IEEE Access 5, 18051–18065 (2017). https://doi.org/10.1109/ACCESS.2017.2740382

    Article  Google Scholar 

  14. Huang, M.; Liu, A.; Zhao, M.; Wang, T.: Multi-working sets alternate covering scheme for continuous partial coverage in wireless sensor networks. Peer-to-Peer Netw. Appl. 12, 553–567 (2019). https://doi.org/10.1007/s12083-018-0647-z

    Article  Google Scholar 

  15. Katti: Target coverage in random wireless sensor networks using coversets. J. King Saud Univ. Comput. Inf. Sci. 1–13 (2019). https://doi.org/10.1016/j.jksuci.2019.05.006

  16. Huang, C.F.; Tseng, Y.C.: The coverage problem in a wireless sensor network. Mobile Netw. Appl. 10(4), 519–528 (2005). https://doi.org/10.1007/s11036-005-1564-y

    Article  Google Scholar 

  17. Li, Q.; Liu, N.: Monitoring area coverage optimization algorithm based on nodes perceptual mathematical model in wireless sensor networks. Computer Communications 155, 227–234 (2020). https://doi.org/10.1016/j.comcom.2019.12.040

    Article  Google Scholar 

  18. Ammari, H.M.; Das, S.K.: Integrated coverage and connectivity in wireless sensor networks: a dimensional percolation problem. IEEE Trans. Comput. 57(10), 1423–1434 (2008). https://doi.org/10.1109/TC.2008.68

    Article  MathSciNet  MATH  Google Scholar 

  19. Nezhad, S.E.; Kamali, H.J.; Moghaddam, M.E.: Solving k-coverage problem in wireless sensor networks using improved harmony search. In: Proceedings of International Conference on Broadband, Wireless Computing, Communication and Applications, pp 49–55. https://doi.org/10.1109/BWCCA.2010.47 (2010)

  20. Ashouri, M.; Zali, Z.; Mousavi, S.R.; Hashemi, M.R.: New optimal solution to disjoint set k-coverage for lifetime extension in wireless sensor networks. IET Wirel. Sensor Syst. 2(1), 31–39 (2012). https://doi.org/10.1049/iet-wss.2011.0085

    Article  Google Scholar 

  21. Ammari, H.M.; Das, S.K.: Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Trans. Comput. 61(1), 1–12 (2012). https://doi.org/10.1109/TC.2011.82

    Article  MathSciNet  MATH  Google Scholar 

  22. Ma, C.; He, J.; Chen, H.H.; Tang, Z.: Coverage overlapping problems in applications of IEEE 802.15.4 wireless sensor networks. In: In the Proceedings of IEEE Wireless Communications and Networking Conference, pp 4364–4369. https://doi.org/10.1109/WCNC.2013.6555280 (2012)

  23. Abbas, W.; Koutsoukos, X.: Efficient complete coverage through heterogeneous sensing nodes. IEEE Wirel. Commun. Lett. 4(1), 34–52 (2015). https://doi.org/10.1109/LWC.2014.2358631

    Article  Google Scholar 

  24. Sakai, K.; Sun, M.T.; Lai, T.H.; Vasilakos, A.V.; Ku, W.S.: A framework for the optimal k-coverage deployment patterns of wireless sensors. IEEE Sensors J. 15(12), 7273–7283 (2015). https://doi.org/10.1109/JSEN.2015.2474711

    Article  Google Scholar 

  25. Zhang, Z.; Willson, J.; Lu, Z.; Wu, W.; Zhu, X.; Ding, Z.D.: Approximating maximum lifetime k-coverage through minimizing weighted k-cover in homogeneous wireless sensor networks. IEEE/ACM Trans. Netw. 24(6), 3620–3632 (2016). https://doi.org/10.1109/TNET.2016.2531688

    Article  Google Scholar 

  26. Elhoseny, M.; Tharwat, A.; Farouk, A.; Hassanien, A.E.: K-coverage model based on genetic algorithm to extend WSN lifetime. IEEE Sensors Lett. 1(4), 1–4 (2017). https://doi.org/10.1109/LSENS.2017.2724846

    Article  Google Scholar 

  27. Huang, M.; Liu, A.; Zhao, M.; Wang, T.: Multi working sets alternate covering scheme for continuous partial coverage in WSNs. Peer-to-Peer Netw. Appl. 12(3), 553–567 (2018). https://doi.org/10.1007/s12083-018-0647-z

    Article  Google Scholar 

  28. Chang, A.; Jain, R.; Peng, L.; Heidelberg: advances in intelligent systems and applications. In: In the Proceedings of the International Computer Symposium ICS, pp. 157–166 (2012)

  29. Xing, G.; Wang, X.; Zhang, Y.; Lu, C.; Pless, R.; Gill, C.: Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sensor Netw. 1, 36–72 (2005)

    Article  Google Scholar 

  30. Youssef, M.A.; Younis, M.F.; Arisha, K.A.: A constrained shortest-path energy-aware routing algorithm for wireless sensor networks. In: IEEE Wireless Communications and Networking Conference Record, pp. 794–799 (2002)

Download references

Funding

The financial assistance received by the authors from MHRD, Govt. of India, New Delhi is duly acknowledged.

Author information

Authors and Affiliations

Authors

Contributions

Nilanshi Chauhan conceived the presented idea, performed the research and generated the results. Dr. Siddhartha Chauhan verified the results and supervised the research work.

Corresponding author

Correspondence to Nilanshi Chauhan.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Availability of Data and Material

All the data generated and analyzed during this study is included in the article. No other source was used.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chauhan, N., Chauhan, S. A Novel Area Coverage Technique for Maximizing the Wireless Sensor Network Lifetime. Arab J Sci Eng 46, 3329–3343 (2021). https://doi.org/10.1007/s13369-020-05182-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-020-05182-2

Keywords

Navigation