Skip to main content

Advertisement

SpringerLink
Log in

Coverage-Aware Sensor Deployment and Scheduling in Target-Based Wireless Sensor Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Wireless sensor networks (WSNs) is a large network of small-sized sensor nodes with limited power capacity which monitor specific points (targets) and transmit the collected information wirelessly. Activating every sensor to monitor the targets simultaneously utilizes its limited energy and deteriorates the network’s lifetime faster. Thus, monitoring the entire target and increasing network’s lifetime are crucial and integral problems of WSN for setting up energy-efficient monitoring in the network. A countermeasure of this issue is portioning the sensor nodes into independent sets with the constraint that each set should monitor the entire targets and activating them one after the other helps us to provide energy-efficient monitoring in the network. This process is collectively termed as set \(k\)-cover problem and the independent sensor sets are termed as sensor covers. Thus, identifying maximum number of sensor covers from the considered sensor set is the challenging problem in set \(k\)-cover problem. As Graph theory plays a critical role to solve various problems in WSNs, this paper a vertex coloring based sensor scheduling and deployment algorithm is proposed to determine maximum number of sensor covers and optimal sensor positioning. In order to assess the efficiency of the proposed algorithm, the mathematical upper bound is estimated and the maximum number of covers obtained using the proposed algorithm is compared with it. Also, the proposed algorithm is implemented with existing random algorithm, cuckoo search algorithm and genetic algorithm. In both the estimation, the solution reveals that the proposed algorithm provides energy-efficient monitoring.

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

Access this article

Log in via an institution

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

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

Similar content being viewed by others

Data Availability

Enquiries about data availability should be directed to the authors.

References

  1. Abrams, Z., Goel, A., & Plotkin, S. (2004). Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd international symposium on Information processing in sensor networks, pp. 424–432.

  2. Ai, X., Srinivasan, V., & Tham, C. K. (2008). Optimality and complexity of pure Nash equilibria in the coverage game. IEEE Journal on Selected Areas in Communications, 26(7), 1170–1182.

    Article  Google Scholar 

  3. Arivudainambi, D., Pavithra, R., & Kalyani, P. (2020). Cuckoo search algorithm for target coverage and sensor scheduling with adjustable sensing range in wireless sensor network. Journal of Discrete Mathematical Sciences and Cryptography, 24(4), 975–996.

    Article  MathSciNet  MATH  Google Scholar 

  4. Arivudainambi, D., & Pavithra, R. (2020). Coverage and connectivity-based 3D wireless sensor deployment optimization. Wireless Personal Communications, 112(2), 1–20.

    Article  Google Scholar 

  5. Arivudainambi, D., Balaji, S., & Poorani, T. S. (2017). Sensor deployment for target coverage in underwater wireless sensor network. In: 2017 international conference on performance evaluation and modeling in wired and wireless networks (PEMWN), pp. 1–6.

  6. Arivudainambi, D., Sreekanth, G., & Balaji, S. (2014). Genetic algorithm for sensor scheduling with adjustable sensing range. International Journal of Engineering and Technology, 6(5), 2282–2289.

    Google Scholar 

  7. Cardei, M., & Du, D. Z. (2005). Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11(3), 333–340.

    Article  Google Scholar 

  8. Debroy, S., & Chatterjee, M. (2017). Radio environment maps and its utility in resource management for dynamic spectrum access networks. In: Resource allocation in next-generation broadband wireless access networks, pp. 32–54.

  9. Guo, X., Zhao, C., Yang, X., & Sun, C. (2011). A deterministic sensor node deployment method with target coverage and node connectivity. In: International conference on artificial intelligence and computational intelligence, pp. 201–207.

  10. Gupta, G. P., & Jha, S. (2019). Biogeography-based optimization scheme for solving the coverage and connected node placement problem for wireless sensor networks. Wireless Networks, 25(6), 3167–3177.

    Article  Google Scholar 

  11. Harizan, S., & Kuila, P. (2019). Coverage and connectivity aware energy efficient scheduling in target based wireless sensor networks: An improved genetic algorithm based approach. Wireless Networks, 25(4), 1995–2011.

    Article  Google Scholar 

  12. Idrees, A. K., & Al-Yaseen, W. L. (2021). Distributed genetic algorithm for lifetime coverage optimisation in wireless sensor networks. International Journal of Advanced Intelligence Paradigms, 18(1), 3–24.

    Article  Google Scholar 

  13. Keskin, M. E., Altınel, İK., Aras, N., & Ersoy, C. (2014). Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Networks, 17, 18–36.

    Article  Google Scholar 

  14. Krishnan, M., Rajagopal, V., & Rathinasamy, S. (2018). Performance evaluation of sensor deployment using optimization techniques and scheduling approach for K-coverage in WSNs. Wireless Networks, 24(3), 683–693.

    Article  Google Scholar 

  15. Kumari, S., & Gupta, G. P. (2018). Cuckoo search optimization based mobile node deployment scheme for target coverage problem in underwater wireless sensor networks. In: International conference on intelligent data communication technologies and Internet of Things, pp. 327–334.

  16. Liao, C. C., & Ting, C. K. (2017). A novel integer-coded memetic algorithm for the set k -cover problem in wireless sensor networks. IEEE Transactions on Cybernetics, 48(8), 2245–2258.

    Article  MathSciNet  Google Scholar 

  17. Lin, C. C., Deng, D. J., Chen, Z. Y., & Chen, K. C. (2016). Key design of driving industry 4.0: Joint energy-efficient deployment and scheduling in group-based industrial wireless sensor networks. IEEE Communications Magazine, 54(10), 46–52.

    Article  Google Scholar 

  18. Matula, D. W., Marble, G., & Isaacson, J. D. (1972). Graph coloring algorithms. In Graph theory and computing, pp. 109–122. Academic Press.

  19. Mini, S., Udgata, S. K., & Sabat, S. L. (2013). Sensor deployment and scheduling for target coverage problem in wireless sensor networks. IEEE Sensors Journal, 14(3), 636–644.

    Article  Google Scholar 

  20. Singh, D. P., & Pant, B. (2017). An approach to solve the target coverage problem by efficient deployment and scheduling of sensor nodes in WSN. International Journal of System Assurance Engineering and Management, 8(2), 493–514.

    Google Scholar 

  21. Singh, D., Chand, S., & Kumar, B. (2018). Genetic algorithm-based heuristic for solving target coverage problem in wireless sensor networks. In: Advanced computing and communication technologies, pp. 257–264.

  22. Slijepcevic, S., & Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. In: ICC 2001, IEEE international conference on communications. Conference record, vol 2, pp. 472–476.

  23. Sun, C. (2017). A time variant log-linear learning approach to the SET K-cover problem in wireless sensor networks. IEEE Transactions on Cybernetics, 48(4), 1316–1325.

    Article  MathSciNet  Google Scholar 

  24. Sun, C., Sun, W., Wang, X., & Zhou, Q. (2019). Potential game theoretic learning for the minimal weighted vertex cover in distributed networking systems. IEEE Transactions on Cybernetics, 49(5), 1968–1978.

    Article  Google Scholar 

  25. Sun, C., Wang, X., Qiu, H., Sun, W., & Zhou, Q. (2021). Toward refined nash equilibria for the SET K-cover problem via a memorial mixed-response algorithm. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52(4), 2313–2323.

    Article  Google Scholar 

  26. Tsai, C. W., Tsai, P. W., Pan, J. S., & Chao, H. C. (2015). Metaheuristics for the deployment problem of WSN: A review. Microprocessors and Microsystems, 39(8), 1305–1317.

    Article  Google Scholar 

  27. Tsiropoulou, E. E., Surya, T. P., & John S. B. (2017). Interest, energy and physical-aware coalition formation and resource allocation in smart IoT applications. In: 51st annual conference on information sciences and systems, IEEE, pp. 1–6.

  28. Wu, P. F., Xiao, F., Sha, C., Huang, H. P., Wang, R. C., & Xiong, N. X. (2017). Node scheduling strategies for achieving full-view area coverage in camera sensor networks. Sensors, 17(6), 1303.

    Article  Google Scholar 

  29. Wu, T., Yang, P., Dai, H., Xu, W., & Xu, M. (2019). Charging oriented sensor placement and flexible scheduling in rechargeable WSNs. IEEE INFOCOM, pp. 73–81.

  30. Yan, W., Cao, M., Wu, Y., & Zhang, J. (2018). Greedy game algorithms for solving SET K-cover problem in HWSNs. IEEE Access, 6, 65604–65619.

    Article  Google Scholar 

  31. Zhang, Z., Willson, J., Lu, Z., Wu, W., Zhu, X., & Du, D. Z. (2016). Approximating maximum lifetime k-coverage through minimizing weighted $ k $-cover in homogeneous wireless sensor networks. IEEE/ACM Transactions on Networking, 24(6), 3620–3633.

    Article  Google Scholar 

  32. Zhao, Q., & Gurusamy, M. (2008). Lifetime maximization for connected target coverage in wireless sensor networks. IEEE/ACM Transactions on Networking, 16(6), 1378–1391.

    Article  Google Scholar 

Download references

Funding

No funding was received for this work.

Author information

Authors and Affiliations

  1. School of Advance Sciences, Mathematics Division, VIT University, Chennai, Tamil Nadu, 600127, India

    R. Pavithra

  2. Department of Mathematics, Anna University, Chennai, Tamil Nadu, 600025, India

    D. Arivudainambi

Authors
  1. R. Pavithra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Arivudainambi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Pavithra.

Ethics declarations

Conflict of interest

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pavithra, R., Arivudainambi, D. Coverage-Aware Sensor Deployment and Scheduling in Target-Based Wireless Sensor Network. Wireless Pers Commun 130, 421–448 (2023). https://doi.org/10.1007/s11277-023-10292-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-023-10292-9

Keywords

Search

Navigation