Skip to main content

Advertisement

SpringerLink
Log in

Theoretical Treatment of Target Coverage in Wireless Sensor Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The target coverage is an important yet challenging problem in wireless sensor networks, especially when both coverage and energy constraints should be taken into account. Due to its nonlinear nature, previous studies of this problem have mainly focused on heuristic algorithms; the theoretical bound remains unknown. Moreover, the most popular method used in the previous literature, i.e., discretization of continuous time, has yet to be justified. This paper fills in these gaps with two theoretical results. The first one is a formal justification for the method. We use a simple example to illustrate the procedure of transforming a solution in time domain into a corresponding solution in the pattern domain with the same network lifetime and obtain two key observations. After that, we formally prove these two observations and use them as the basis to justify the method. The second result is an algorithm that can guarantee the network lifetime to be at least (1 - ε) of the optimal network lifetime, where ε can be made arbitrarily small depending on the required precision. The algorithm is based on the column generation (CG) theory, which decomposes the original problem into two sub-problems and iteratively solves them in a way that approaches the optimal solution. Moreover, we developed several constructive approaches to further optimize the algorithm. Numerical results verify the efficiency of our CG-based algorithm.

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

Similar content being viewed by others

References

  1. He T, Krishnamurthy S, Luo L et al. VigilNet: An integrated sensor network system for energy-efficient surveillance. ACM Transactions on Sensor Networks, 2006, 2(1): 1–38.

    Article  Google Scholar 

  2. Akyildiz I F, Su W, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications Magazine, 2002, 40(8): 102–114.

    Article  Google Scholar 

  3. Cardei M, Du J. Energy-efficient coverage problems in wireless ad hoc sensor networks. The Computer Communications Journal, 2006, 29(4): 413–420.

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Cardei M, Thai M, Li Y, Wu W. Energy-efficient target coverage in wireless sensor networks. In Proc. IEEE INFOCOM 2005, Miami, USA, Mar. 13-15, 2005, pp. 1976–1984.

  6. Cardei M, Wu J, Lu M, Pervaiz M O. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In Proc. IEEE Int. Conf. Wireless and Mobile Computing, Networking and Communications (WiMob 2005), Montreal, Canada, Aug. 22-24, 2005, pp. 438–445.

  7. Liu H, Wan P, Jia X. Maximal lifetime scheduling for k to 1 sensor-target surveillance networks. Computer Networks, 2006, 50(15): 2839–2854.

    Article  MATH  Google Scholar 

  8. Liu H, Wan P, Jia X. Maximal lifetime scheduling for sensor surveillance systems with k sensors to 1 target. IEEE Transactions on Parallel and Distributed Systems, 2007, 17(12): 1526–1536.

    Article  Google Scholar 

  9. Lu M, Wu J, Cardei M, Li M. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In Proc. IEEE International Conference on Computer Networks and Mobile Computing (ICCNMC2005), Zhangjiajie, China, Aug. 2-4, 2005, pp. 43–52.

  10. Jaggi N, Abouzeid A A. Energy-efficient connected coverage in wireless sensor networks. In Proc. 4th Asian International Mobile Computing Conference (AMOC), Kolkota, India, Jan., 2006.

  11. Horst R, Tuy H. Global Optimization: Deterministic Approaches. 3rd Ed. Berlin: Springer-Verlag, 1996.

    MATH  Google Scholar 

  12. Ye Y. An O(n 3 l) potential reduction algorithm for linear programming. Mathematical Programming, 1991, 50: 239–258.

    Article  MATH  MathSciNet  Google Scholar 

  13. Vance H, Barnhart C, Johnson E, Glaw A. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and applications, 1994, 3(2): 111–130.

    Article  MATH  MathSciNet  Google Scholar 

  14. Bjorklund P, Varbrand P, Yuan D. Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach. In Proc. IEEE INFOCOM 2003, San Francisco, USA, Mar. 30-Apr. 3, 2003, pp. 818–824.

  15. Gu Y, Ji Y S, Li J, Zhao B H. QoS-aware target coverage in wireless sensor networks. Wireless Communications and Mobile Computing, 2009, 9(12): 1645–1659.

    Article  Google Scholar 

  16. Lubbecke M E, Desrosiers J. Selected topics in column generation. Operations Research, 2002, 53(6): 1007–1023.

    Article  MathSciNet  Google Scholar 

  17. He T, Vicaire P A, Yan T et al. Achieving real-time target tracking using wireless sensor networks. In Proc. IEEE RTAS 2006, San Jose, California, Apr. 4-7, 2006, pp. 37–48.

  18. Nath S, Liu J, Zhao F. SensorMap for wide-area sensor webs. IEEE Computer Magazine, 2007, 40(7): 90–93.

    Google Scholar 

  19. Maggie X C, Ruan L, Wu W L. Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In Proc. IEEE INFOCOM 2005, Miami, USA, Mar. 13-17, 2003, pp. 2638–2645.

  20. Maggie X C, Ruan L, Wu W L. Coverage beach problems in bandwidth constrained sensor networks. ACM Transactions on Sensor Networks, 2007, 3(2): Article No.12.

  21. Wang C, Thai M T, Li Y et al. Minimum coverage breach and maximum network lifetime in wireless sensor networks. In Proc. IEEE Global Telecommunications Conference (GLOBECOM), Washington DC, USA, Nov. 26-30, 2007, pp. 1118–1123.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Science and Technology of China, Hefei, 230027, China

    Yu Gu & Bao-Hua Zhao

  2. State Key Laboratory of Networking and Switching Technology, Beijing, 100876, China

    Bao-Hua Zhao

  3. Information Systems Architecture Science Research Division, National Institute of Informatics, Tokyo, Japan

    Yu-Sheng Ji (Member, IEEE)

  4. Department of Computer Science, University of Tsukuba, Tsukuba Science City, Ibaraki, Japan

    Jie Li (Senior Member, ACM, IEEE)

Authors
  1. Yu Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bao-Hua Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu-Sheng Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jie Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bao-Hua Zhao.

Additional information

This work has been partially supported by the National Natural Science Foundation of China under Grant Nos. 60872009, 6002016, the Hi-Tech Research and Development 863 Program of China under Grant Nos. 2007AA01Z428, 2009AA01Z148, the Post Doctoral Fellowship (ID No. P10356) for Scientific Research of Japan Society for Promotion of Science (JSPS).

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 97.7 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gu, Y., Zhao, BH., Ji, YS. et al. Theoretical Treatment of Target Coverage in Wireless Sensor Networks. J. Comput. Sci. Technol. 26, 117–129 (2011). https://doi.org/10.1007/s11390-011-9419-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-011-9419-4

Keywords

Search

Navigation