Skip to main content

Interference-Free k-barrier Coverage in Wireless Sensor Networks

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8881))

Abstract

Barrier coverage is a hot issue in wireless sensor networks. Most literatures study barrier coverage under one-hop wireless sensor networks. In this paper, we consider more practical environment: multi-hop wireless sensor networks. We study the problem of how to achieve interference-free k-barrier coverage which has not been discussed before. Firstly, we analyze how k-barrier coverage suffers from interference in multi-hop networks. Then we propose an effective algorithm to solve the problem which is called computing maximal k-connected barriers without interference. In this algorithm, we construct none-crossing k-barrier coverage firstly and then we construct a communication interference graph to compute a maximal k-connected barriers without interference. Simulations show our algorithm can prolong the network lifetime of k-barrier coverage and is more effective than the existing method.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom), August 2005

    Google Scholar 

  2. Wan, P.J., Ma, C., Wang, Z., et al.: Weighted wireless link scheduling without information of positions and interference. In: Proceedings of 2011 INFOCOM, April 2011

    Google Scholar 

  3. Gage, D.W.: Command control for many-robot systems. In: Proceedings of the Nineteenth Annual AUVS Technology Symposium (AUVS-92) (1992)

    Google Scholar 

  4. Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (2008)

    Google Scholar 

  5. Du, H., Pardalos, P.M., Wu, W., Wu, L.: Maximum lifetime connected coverage with two active-phase sensors. J. Glob. Optim. 56(2), 559–568 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  6. Wu, L., Du, H., Wu, W., Li, D., Lv, J., Lee, W.: Approximations for minimum connected sensor cover. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) (2013)

    Google Scholar 

  7. Kumar, S., Lai, T.H., Posner, M.E., Sinha, P.: Maximizing the lifetime of a barrier of wireless sensors. IEEE Trans. Mob. Comput. (TMC) 9(8), 1161–1172 (2010)

    Article  Google Scholar 

  8. Ban, D., Feng, Q., Han, G., Yang, W., Jiang, J., Dou, W.: Distributed scheduling algorithm for barrier coverage in wireless sensor networks. In: Proceedings of the 2011 Third International Conference on Communications and Mobile Computing (CMC), April 2011

    Google Scholar 

  9. Yang, H., Li, D., Zhu, Q., Chen, W., Hong, Y.: Minimum energy cost k-barrier coverage in wireless sensor networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 80–89. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Du, J., Wang, K., Liu, H., et al.: Maximizing the lifetime of k-discrete barrier coverage using mobile sensors. Int’l J. IEEE Sens. (2013)

    Google Scholar 

  11. Felemban, E.: Advanced border intrusion detection and surveillance using wireless sensor network technology. Int’l J. Commun. Netw. Syst. Sci. 6(5) (2013)

    Google Scholar 

  12. Thai, M.T., Wang, F., Jia, X.: Coverage problems in wireless sensor networks: designs and analysis. Int. J. Sens. Netw. 3(3), 191–200 (2008)

    Article  Google Scholar 

  13. Luo, H., Du, H., Huang, H., Ye, Q., Zhang, J.: Barrier coverage in wireless sensor networks with discrete level of sensing and transmission power. In: The 8th China Conference on China Wireless Sensor Networks CWSN 2014 (submitted)

    Google Scholar 

  14. Du, H., Wu, W., Ye, Q., Li, D., Lee, W., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(4), 652–661 (2013)

    Article  Google Scholar 

Download references

Acknowledgment

This work was financially supported by National Natural Science Foundation of China with Grants No. 61370216 and No. 61100191, and Shenzhen Strategic Emerging Industries Program with Grants No. ZDSY20120613125016389, No. JCYJ20120613151201451 and No. JCYJ20130329153215152.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haiming Luo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Du, H., Luo, H., Zhang, J., Zhu, R., Ye, Q. (2014). Interference-Free k-barrier Coverage in Wireless Sensor Networks. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12691-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12690-6

  • Online ISBN: 978-3-319-12691-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics