Skip to main content
SpringerLink
Log in

A decentralized K-barriers construction approach based on nearest neighbors rule for two-dimensional rectangular region

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Barrier coverage is a fundamental problem in wireless sensor networks, which can be applied to detect intruders that attempt to cross the boundaries of the region we are supervising. Among a number of issues related to barrier coverage, the most critical one is how to deploy sensors to construct barriers. Many barrier-building approaches have been proposed in previous papers by other scholars, while few papers adopt distributed strategies which allow sensors to move autonomously based on local information and are more practical in some unreachable areas. In this paper, we study a decentralized approach based on the nearest neighbor rule (NNR) to realize the self-deployment of wireless sensor networks to build K strong barriers, while considering network connectivity. This approach can be divided into three stages which correspond to the three times of using the NNR respectively. The sensor can autonomously choose the closest barrier to belonging to, which ensures the total migration distance is relatively smallest. Moreover, we test the availability and performance of our approach with simulations.

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

Similar content being viewed by others

References

  1. Meguerdichian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. B. (2001). Coverage problems in wireless ad-hoc sensor networks. In IEEE INFOCOM (pp. 1380–1387).

  2. Huang, C.-F., & Tseng, Y.-C. (2003). The coverage problem in a wireless sensor network. In Proceedings of the 2nd ACM international conference on wireless sensor networks and applications (WSNA) (pp. 115–121).

  3. Wang, Y. C., & Tseng, Y. C. (2008). Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage. IEEE Transactions on Parallel and Distributed Systems, 19(9), 1280–1294.

    Article  Google Scholar 

  4. Tao, D., Tang, S., Zhang, H., Mao, X., & Ma, H. (2012). Strong barrier coverage in directional sensor networks. Computer Communications, 35(8), 895–905.

    Article  Google Scholar 

  5. Chen, A., Kumar, S., & Lai, T. H. (2007). Designing localized algorithms for barrier coverage. In Proceedings of ACM Mobicom07, Canada.

  6. Saipulla, A., Westphal, C., Liu, B., & Wang, J. (2009). Barrier coverage of line-based deployed wireless sensor networks. In Proceedings of IEEE INFOCOM.

  7. Yang, G., & Qiao, D. (2009). Barrier information coverage with wireless sensors. In Proceedings of IEEE INFOCOM.

  8. Zorbas, D., & Douligeris, C. (2011). Connected coverage in WSNs based on critical targets. Computer Networks, 55(6), 1412–1425.

    Article  Google Scholar 

  9. Kumar, S., Lai, T. H., & Arora, A. (2005). Barrier coverage with wireless sensors. In Proceedings of the annual ACM international conference on mobile computing and networking (MobiCom) (pp. 284–298).

  10. Liu, B., Dousse, O., Wang, J., & Saipulla, A. (2008). Strong barrier coverage of wireless sensor networks. In Proceedings of ACM MobiHoc08.

  11. Saipulla, A., Liu, B., Xing, G., Fu, X., & Wang, J. (2010). Barrier coverage with sensors of limited mobility. In Proceedings of ACM MobiHoc 2010, Canada, September 20–24.

  12. Cheng, C.-F., Ting-Ying, W., & Liao, H.-C. (2014). A density-barrier construction algorithm with minimum total movement in mobile WSNs. Computer Networks, 62(7), 208–220.

    Article  Google Scholar 

  13. Wang, G., Cao, G., et al. (2006). Movement-assisted sensor deployment. IEEE Transactions on Mobile Computing, 5, 640–652.

    Article  Google Scholar 

  14. 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, 978–991.

    Article  Google Scholar 

  15. Ammari, H. M., & Das, S. K. (2010). A study of k-coverage and measures of connectivity in 3D wireless sensor networks. IEEE Transactions on Computers, 59(2), 243–257.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. Cheng, T. M., & Savkin, A. V. (2009). A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks. IEEE Communications Letters, 12, 877–879.

    Article  Google Scholar 

  18. Bettstetter, C., & Hartmann, C. (2005). Connection of wireless multihop networks in a shadow fading environment. Wireless Networks, 11, 571–579.

    Article  Google Scholar 

  19. Alla, S. B., & Ezzati, A. (2012). Coverage and connectivity preserving routing protocol for heterogeneous wireless sensor networks. In Next generation networks and services (Vol. 2012, pp. 141–148).

  20. Vicsek, T., Czirok, A., Jacob, E. B., Cohen, I., & Schochet, O. (1995). Novel type of phase transitions in a system of self-driven particles. Physical Review Letters, 75, 1226–1229.

    Article  MathSciNet  Google Scholar 

  21. Jadbabaie, A., Lin, J., & Morse, A. S. (2003). Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48, 988–1001.

    Article  MathSciNet  MATH  Google Scholar 

  22. Savkin, A. V. (2004). Coordinated collective motion of groups of autonomous mobile robots: Analysis of Vicseks model. IEEE Transactions on Automatic Control, 49, 981–983.

    Article  MathSciNet  MATH  Google Scholar 

  23. Ren, W., & Beard, R. W. (2010). Distributed consensus in multi-vehicle cooperative control. IEEE Control Systems, 30(3), 85–86.

    Article  Google Scholar 

  24. Saber, R. O., & Murray, R. M. (2004). Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(09), 1520–1533.

    Article  MathSciNet  MATH  Google Scholar 

  25. Cheng, T. M., & Savkin, A. V. (2011). Decentralized control of multi-agent systems for swarming with a given geometric pattern. Computers & Mathematics with Applications, 61(4), 731–744.

    Article  MathSciNet  MATH  Google Scholar 

  26. Egerstedt, M., & Hu, X. (2001). Formation constrained multi-agent control. IEEE Transactions on Robotics and Automation, 17, 947–951.

    Article  Google Scholar 

  27. Saipulla, A., Westphal, C., Liu, B., & Wang, J. (2013). Barrier coverage with linebased deployed mobile sensors. Ad Hoc Networks, 11(4), 1381–1391.

    Article  Google Scholar 

  28. Liu, X. Y., Wu, K. L., Zhu, Y., et al. (2013). Mobility increases the surface coverage of distributed sensor networks. Computer Networks, 57(11), 2348–2363.

    Article  Google Scholar 

  29. Kong, L., Zhao, M., Liu, X. Y., et al. (2014). Surface coverage in sensor networks. IEEE Transactions on Parallel and Distributed Systems, 25(1), 234–243.

    Article  Google Scholar 

  30. He, S., Chen, J., Li, X., et al. (2014). Mobility and intruder prior information improving the barrier coverage of sparse sensor networks. IEEE Transactions on Mobile Computing, 13(6), 1268–1282.

    Article  Google Scholar 

  31. Wang, Z., Liao, J., Cao, Q., et al. (2014). Achieving k-barrier coverage in hybrid directional sensor networks. IEEE Transactions on Mobile Computing, 13(7), 1443–1455.

    Article  Google Scholar 

  32. Tao, D., & Wu, T. Y. (2015). A survey on barrier coverage problem in directional sensor networks. IEEE Sensors Journal, 15(2), 876–885.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Overseas Academic Training Funds, University of Electronic Science and Technology of China (OATF, UESTC) (Grant No. 201506075013), and the Program for Science and Technology support in Sichuan Province (Grant Nos. 2014GZ0100 and 2016GZ0088).

Author’s contributions

JHL and QW proposed the algorithm and carried out the simulations. JHL and SHZ analyzed the experimental results. JHL gave the critical revision and final approval. All authors read and approved the final manuscript.

Author information

Author notes

    Authors and Affiliations

    1. School of Electronic Engineering, University of Electronic Science and Technology of China, No. 2006, Xiyuan Ave, West Hi-Tech Zone, Chengdu, 611731, China

      Junhai Luo, Xiao Ren & Shihua Zou

    2. Department of Electrical Engineering and Computer Science, The University of Tennessee Knoxville, Knoxville, TN, 37919, USA

      Junhai Luo

    Authors
    1. Junhai Luo
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Xiao Ren
      View author publications

      You can also search for this author in PubMed Google Scholar

    3. Shihua Zou
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding author

    Correspondence to Junhai Luo.

    Ethics declarations

    Conflict of interest

    The authors declare that they have no competing interests.

    Additional information

    Junhai Luo is equally contributed to this work.

    Rights and permissions

    Reprints and permissions

    About this article

    Check for updates. Verify currency and authenticity via CrossMark

    Cite this article

    Luo, J., Ren, X. & Zou, S. A decentralized K-barriers construction approach based on nearest neighbors rule for two-dimensional rectangular region. Wireless Netw 24, 969–979 (2018). https://doi.org/10.1007/s11276-016-1425-6

    Download citation

    • Published:

    • Issue Date:

    • DOI: https://doi.org/10.1007/s11276-016-1425-6

    Keywords

    Search

    Navigation