Skip to main content
SpringerLink
Log in

Enhanced algorithms for deploying the minimum sensors to construct a wireless sensor network having full coverage of critical square grids

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

With the rapid technological development of sensors, many applications have been designed to use wireless sensor networks to monitor a certain area and provide quality-of-service guarantees. Therefore, the coverage problem had an important issue for constructing wireless sensor networks. Recently, a coverage problem of constructing a minimum size wireless sensor network to fully cover critical squares in a sensor field, termed CRITICAL-SQUARE-GRID COVERAGE, has received much attention. CRITICAL-SQUARE-GRID COVERAGE is shown to be NP-Complete, and an approximation algorithm, termed Steiner-tree-based critical grid covering algorithm (STBCGCA), is proposed accordingly. In STBCGCA, a sensor is selected to cover critical squares only if at least one of the critical squares is fully covered by the sensor. However, a critical square grid can be cooperatively covered by two or more sensors; that is, one sensor covers one part of the critical square, and the other sensors cover the other part of the critical square. This motivates us to propose two efficient algorithms based on STBCGCA, termed critical-grid-partitioned (CGP-STBCGCA) and reference-point-covered (RPC-STBCGCA), that select sensors that can cooperatively cover critical squares in an attempt to minimize the size of the wireless sensor network. The theoretical analysis shows that sensors deployed by CGP-STBCGCA and RPC-STBCGCA can form a connected wireless sensor network that fully covers all critical grids. In addition, a performance guarantee for CGP-STBCGCA is provided. Simulation results show that the ratio of the average number of deployed sensors in STBCGCA to that in CGP-STBCGCA and RPC-STBCGCA in about 90 % of the cases was between 1.08 and 2.52 for CRITICAL-SQUARE-GRID COVERAGE.

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

References

  1. Bai, X., Kumar, S., Yun, Z., Xuan, D., & Lai, T. H. (2006). Deploying wireless sensors to achieve both coverage and connectivity. In Procedings of ACM MobiHoc. Florence, Italy.

  2. Cardei, M., & Du, D. Z. (2005). Improving wireless sensor network lifetime through power aware organization. ACM/Springer Journal of Wireless Networks, 11(3), 333–340.

    Article  Google Scholar 

  3. Cardei, M., Thai, M. T., Li, Y., & Wu, W. (2005). Energy-efficient target coverage in wireless sensor networks. In Proceedings of IEEE INFOCOM. Miami, FL.

  4. Chakrabarty, K., Iyengar, S. S., Qi, H., & Cho, E. (2002). Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers, 51(12), 1448–1453.

    Article  MathSciNet  Google Scholar 

  5. Chang, C. Y., Chang, C. T., Chen, Y. C., & Chang, H. R. (2009). Obstacle-resistant deployment algorithms for wireless sensor networks. IEEE Transactions on Vehicular Technology, 58(6), 2925–2941.

    Article  Google Scholar 

  6. Chang, X. S., Cheng, W. F., Liao, X. K., & Peng, S. L. (2008). Barrier coverage with mobile sensors. In Proceedings of IEEE ISPAN. Sydney, Australia.

  7. Chen, A., Kumar, S., & Lai, T. H. (2010). Local barrier coverage in wireless sensor networks. IEEE Transactions on Mobile Computing, 9(4), 491–504.

    Article  Google Scholar 

  8. Chen, J., Jiang, A., Kanj, I. A., Xia, G., & Zhang, F. (2007). Separability and topology control of quasi unit disk graphs. In Proceedings of IEEE INFOCOM. Alaska, USA.

  9. Chow, C. Y., Mokbel, M. F., & He, T. (2011). A privacy-preserving location monitoring system for wireless sensor networks. IEEE Transactions on Mobile Computing, 10(1), 94–107.

    Article  Google Scholar 

  10. Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990). Unit disk graphs. Discrete Mathematics, 86(1–3):165–177.

    Article  MATH  MathSciNet  Google Scholar 

  11. Gallais, A., Carle, J., Simplot-ryl, D., & Stojmenovic, I. (2008). Localized sensor area coverage with low communication overhead. IEEE Transactions on Mobile Computing, 7(5), 661–672.

    Article  Google Scholar 

  12. Han, X., Cao, X., Lloyd, E. L., & Shen, C. C. (2008). Deploying directional sensor networks with guaranteed connectivity and coverage. In Proceedings of IEEE SECON. California, USA.

  13. He, J., & Shi, H. (2010). A distributed algorithm for finding maximum barrier coverage in wireless sensor networks. In Proceedings of IEEE GLOBECOM. Florida, USA.

  14. Heo, N., & Varshney, P. K. (2005). Energy-efficient deployment of intelligent mobile sensor networks. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 35(1):78–92.

    Article  Google Scholar 

  15. Ke, W. C., Liu, B. H., & Tsai, M. J. (2011). The critical-square-grid coverage problem in wireless sensor networks is NP-Complete. Computer Networks, 55(9), 2209–2220.

    Article  Google Scholar 

  16. Ke, W. C., Liu, B. H., & Tsai, M. J. (2011). Efficient algorithm for constructing minimum size wireless sensor networks to fully cover critical square grids. IEEE Transactions on Wireless Communications, 10(4), 1154–1164.

    Article  Google Scholar 

  17. Klein, P. N., & Ravi, R. (1995). A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms, 19(1), 104–115.

    Article  MATH  MathSciNet  Google Scholar 

  18. Kumar, S., Lai, T. H., Arora, A. (2005). Barrier coverage with wireless sensors. In Proceedings of ACM MobiCom. Cologne, Germany.

  19. Lin, F. Y. S., & Chiu, P. L. (2005). A simulated annealing algorithm for energy-efficient sensor network design. In Proceedings of ICST WiOpt. Trentino, Italy.

  20. Ma, H., Meng, Y., Li, D., Hong, Y., & Chen, W. (2012). Minimum camera barrier coverage in camera wireless sensor networks. In Proceedings of IEEE INFOCOM. Orlando, USA.

  21. Mclachlan, J. S., Hellmann, J. J., & Schwartz, M. W. (2007). A framework for debate of assisted migration in an era of climate change. Conservation Biology, 21(2), 297–302.

    Article  Google Scholar 

  22. Slijepcevic, S., & Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. In Proceedings of IEEE ICC. Helsinki, Finland.

  23. Xiong, S., Yu, L., Haiying, S., Chen, W., & Wei, L. (2012). Efficient algorithms for sensor deployment and routing in sensor networks for network-structured environment monitoring. In Proceedings of IEEE INFOCOM. Orlando, USA.

  24. Yener, B., Magdon-Ismail, M., & Sivrikaya, F. (2007). Joint problem of power optimal connectivity and coverage in wireless sensor networks. ACM/Springer Journal of Wireless Networks, 13(4), 537–550.

    Article  Google Scholar 

  25. Zhou, Z., Das, S. R., & Gupta, H. (2009). Variable radii connected sensor cover in sensor networks. ACM Transactions on Sensor Networks, 5(1), 1–36.

    Article  Google Scholar 

  26. Zou, Y., & Chakrabarty, K. (2005). A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers, 54(8), 978–991.

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Science Council under Grants NSC 101-2221-E-151-001 and NSC 102-2221-E-151-002.

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, 415, Chien Kung Rd., Kaohsiung, 80778, Taiwan, ROC

    Bing-Hong Liu & Kuo-Wen Su

Authors
  1. Bing-Hong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kuo-Wen Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bing-Hong Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, BH., Su, KW. Enhanced algorithms for deploying the minimum sensors to construct a wireless sensor network having full coverage of critical square grids. Wireless Netw 20, 331–343 (2014). https://doi.org/10.1007/s11276-013-0662-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-013-0662-1

Keywords

Search

Navigation