Skip to main content
SpringerLink
Log in

Multi-covered path in wireless sensor networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The progress of development on sensor networks has inspired many new applications. Some of these applications require the target to be observed by more than one sensors simultaneously. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In this paper, we addressed the coverage problem from two different view points and referred to them as the worst-case and best-case coverage problems. Most existing works on these two problems assumed that the coverage degree is one (i.e. the target area falls within the sensing range of at least one sensor). In this paper, we address the k-coverage problem, where the coverage degree is a user-defined parameter k. This is a generalization of the earlier work where only k=1 is assumed. By combining geometric and algorithmic techniques, we establish optimal algorithms to solve the two variants of the k-coverage problem in polynomial time. An important extension of our study on the k-coverage problem was also proposed: the distributed algorithm for the problem. This helps in applying the proposed algorithm under more practical scenarios.

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

Similar content being viewed by others

References

  1. Adriaens, J., Megerian, S., & Potkonjak, M. (2006). Optimal worst-case coverage of directional field-of-view sensor networks. In 3rd annual IEEE communications society on sensor and ad hoc communications and networks (SECON ’06) (Vol. 1, pp. 336–345).

    Chapter  Google Scholar 

  2. Awerbuch, B., & Gallager, R. (1987). A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, 33, 315–322.

    Article  Google Scholar 

  3. Batalin, M. A., & Sukhatme, G. S. (2004). Coverage, exploration and deployment by a mobile robot and communication network. Telecommunication Systems, 26, 181–196.

    Article  Google Scholar 

  4. de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997). Computational geometry: algorithms and applications.

    Google Scholar 

  5. Han, G., Xu, H., Duong, T., Jiang, J., & Hara, T. (2011). Localization algorithms of wireless sensor networks: a survey. Telecommunications Systems, 1–18.

  6. Huang, C., & Tseng, Y. (2005). The coverage problem in a wireless sensor network. ACM Mobile Networks and Applications, 10(4), 519–528.

    Article  Google Scholar 

  7. Huang, C., Tseng, Y. C., & Lo, L. (2007). The coverage problem in three-dimensional wireless sensor networks. Journal of Interconnection Networks, 8(3), 209–227.

    Article  Google Scholar 

  8. Huang, L., Xu, H., Wang, Y., Wu, J., & Li, H. (2006). Coverage and exposure paths in wireless sensor networks. Journal of Computer Science and Technology, 21(4), 490–495.

    Article  Google Scholar 

  9. Kumar, S., Lai, T., & Barlogh, J. (2004). On k-coverage in a mostly sleeping sensor network. In Proceedings of MobiCom 04 (pp. 144–158).

    Google Scholar 

  10. Li, D., Wong, K., Hu, Y., & Sayeed, A. (2002). Detection, classification and tracking of targets in distributed sensor networks. IEEE Signal Processing Magazine, 19.

  11. Li, X., Wan, P., & Frieder, O. (2003). Coverage in wireless ad-hoc sensor networks. IEEE Transactions on Computers, 52(6), 753–763.

    Article  Google Scholar 

  12. Liu, J., Liu, J., Reich, J., Cheung, P., & Zhao, F. (2004). Distributed group management in sensor networks: algorithms and applications to localization and tracking. Telecommunications Systems, 26, 235–251.

    Article  Google Scholar 

  13. Mao, G., Fidan, B., & Anderson, B. D. (2007). Wireless sensor network localization techniques. Computer Networks, 51, 2529–2553.

    Article  Google Scholar 

  14. Megerian, S., Koushanfar, F., Qu, G., & Potkonjak, M. (2002). Exposure in wireless sensor networks: theory and practical solutions. ACM Journal of Wireless Networks, 8(5), 443–454.

    Article  Google Scholar 

  15. Megerian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. (2005). Worst and best-case coverage in sensor networks. IEEE Transactions on Mobile Computing, 4(1), 84–92.

    Article  Google Scholar 

  16. Meguerdichian, S., Slijepcevic, S., Karayan, V., & Potkonjak, M. (2001). Localized algorithms in wireless ad hoc networks: location discovery and sensor exposure. In Proceedings of MobiHoc 01 (pp. 106–116).

    Chapter  Google Scholar 

  17. Mehta, D., Lopez, M., & Lin, L. (2003). Optimal coverage paths in ad-hoc sensor networks. In Proceedings of IEEE ICC 03 (pp. 507–511).

    Google Scholar 

  18. O’Rourke, J. (1998). In Computational geometry in C.

    Chapter  Google Scholar 

  19. Tang, S., Mao, X., & Li, X. Y. (2009). Optimal k-support coverage paths in wireless sensor networks. In PERCOM ’09: proceedings of the 2009 IEEE international conference on pervasive computing and communications (pp. 1–6).

    Chapter  Google Scholar 

  20. Vashney, P. (1996). Distributed detection and date fusion.

  21. Wan, P., & Yi, C. (2006). Coverage by randomly deployed wireless sensor networks. IEEE Transactions on Information Theory, 52, 2658–2669.

    Article  Google Scholar 

  22. Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., & Gill, C. (2005). Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Transactions on Sensor Networks, 1, 36–72.

    Article  Google Scholar 

  23. Yen, L., Yu, C., & Cheng, Y. (2006). Expected k-coverage in wireless sensor networks. Ad Hoc Networks, 4, 636–650.

    Article  Google Scholar 

  24. Zhou, Z., Das, S., & Gupta, H. (2004). Connected k-coverage problem in sensor networks. In Proceedings of ICCCN 04 (pp. 373–378).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Science, Southwestern University, Chongqing, China

    Can Fang

  2. School of Computer Science, Northwestern Polytechnical University, Xian, China

    Peng Zhang

  3. School of Information Engineering, Nanchang University, Nanchang, China

    Wei Huang

  4. Shanghai Advanced Research Institute, Chinese Academy of Sciences, Shanghai, China

    Cheng Fu

Authors
  1. Can Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cheng Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Peng Zhang or Wei Huang.

Additional information

This project is supported by the Fundamental Research Funds for the Central Universities XDJK2013C007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, C., Zhang, P., Huang, W. et al. Multi-covered path in wireless sensor networks. Telecommun Syst 54, 19–33 (2013). https://doi.org/10.1007/s11235-013-9713-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9713-2

Keywords

Search

Navigation