On Connected Multiple Point Coverage in Wireless Sensor Networks

  • Shuhui YangEmail author
  • Fei Dai
  • Mihaela Cardei
  • Jie Wu
  • Floyd Patterson


We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a sensor. In some applications, when the network is sufficiently dense, area coverage can be approximated by guaranteeing point coverage. In this case, all the points of wireless devices could be used to represent the whole area, and the working sensors are supposed to cover all the sensors. Many applications related to security and reliability require guaranteed k-coverage of the area at all times. In this paper, we formalize the k-(Connected) Coverage Set (k-CCS/k-CS) problems, develop a linear programming algorithm, and design two non-global solutions for them. Some theoretical analysis is also provided followed by simulation results.


Coverage problem linear programming localized algorithms reliability wireless sensor networks 



The work was supported in part by NSF grants ANI 0083836, CCR 9900646, CNS 0422762, CNS 0434533, and EIA 0130806.


  1. 1.
    D. Tian and N. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. of the 1st ACM Workshop on Wireless Sensor Networks and Applications, 2002Google Scholar
  2. 2.
    Carle J. and Simplot-Ryl D. (2004). Energy efficient area monitoring by sensor networks. IEEE Computer 37(2):40–46Google Scholar
  3. 3.
    J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proc. of the 3rd Int’l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M), 1999Google Scholar
  4. 4.
    M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. Proc. of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2005Google Scholar
  5. 5.
    T. Yan, T. He, and J. Stankovic, Differentiated surveillance for sensor networks. Proc. of the First International Conference on Embedded Networked Sensor Systems (SenSys), 2003.Google Scholar
  6. 6.
    Y. Xu and J. Heidemann, Geography-informed energy conservation for ad hoc routing. Proc. of MOBICOM, 2003Google Scholar
  7. 7.
    F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, PEAS: A robust energy conserving protocol for long-lived sensor networks. Proc. of ICDCS, 2003Google Scholar
  8. 8.
    S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks. Proc. of ICC, 2001Google Scholar
  9. 9.
    Z. Abrams, A. Goel, and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. Proc. of Information Processing in Sensor Networks, 2004.Google Scholar
  10. 10.
    Dai F. and Wu J. (2004). An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10):908–920CrossRefGoogle Scholar
  11. 11.
    Harary F. and Haynes T. (2000). Double domination in graphs. ARS Combinatoria 55:201–213zbMATHMathSciNetGoogle Scholar
  12. 12.
    H. Koubaa and E. Fleury, On the performance of double domination in ad hoc networks. Proc. of IFIP Medhoc, 2000Google Scholar
  13. 13.
    J. Shaikh, J. Solano, I. Stojmenovic, and J. Wu, New metrics for dominating set based energy efficient activity scheduling in ad hoc networks. Proc. of the International Workshop on Wireless Local Networks (WLN), 2003Google Scholar
  14. 14.
    F. Dai and J. Wu, On constructing k-connected k-dominating set in wireless networks. Proc. of IPDPS, Apr. 2005Google Scholar
  15. 15.
    M. Franceschetti, M. Cook, and J. Bruck, A geometric theorem for approximate disk covering algorithms. Technical Report ETR035, Caltech, 2001Google Scholar
  16. 16.
    Hochbaum D. S. and Maass W. (1985). Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM 32(1):130–136zbMATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    H. Zhang and J. Hou, Maintaining sensing coverage and connectivity in large sensor networks. Technical Report UIUC. UIUCDCS-R-2003-2351, 2003Google Scholar
  18. 18.
    X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, Integrated coverage and connectivity configuration in wireless sensor networks. Proc. of the 1st ACM Conference on Embedded Networked Sensor Systems, 2003Google Scholar
  19. 19.
    D. Tian and N. Georganas, Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Networks Journal, pp. 744–761, 2005.Google Scholar
  20. 20.
    Z. Jiang, R. Kline, J. Wu, and F. Dai, A Practical Method to Form Energy Efficient Connected Kcoverage in Wireless Sensor Networks, accepted to appear in WASN workshop, in conjunction with IEEE ICDCS, 2006.Google Scholar
  21. 21.
    Stojmenovic I., Seddigh M., and Zunic J. (2002). Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13(1):14–25CrossRefGoogle Scholar
  22. 22.
    Clark B. N., Colbourn C. J., and Johnson D. S. (1990). Unit disk graphs. Discrete Mathematics 86:165–177zbMATHMathSciNetCrossRefGoogle Scholar
  23. 23.
    D. Z. Du, Design and analysis of approximation algorithms. Lecture Notes, Department of Computer Science, University of MinnesotaGoogle Scholar
  24. 24.
    Y. Ye, An o(n 3 l) potential reduction algorithm for linear programming. Mathematical Programming, Vol. 50, No. 2, pp. 239–258, 1991.zbMATHMathSciNetCrossRefGoogle Scholar
  25. 25.
    Wu J. and Lou W. (2003). Forward node set based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3(2):141–154zbMATHCrossRefGoogle Scholar
  26. 26.
    Lin C. R. and Gerla M. (1996). Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7):1265–1275CrossRefGoogle Scholar
  27. 27.
    T. Moscibroda and R. Wattenhofer, Efficient computation of maximal independent sets in unstructured multi-hop radio networks. Proc. of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004Google Scholar
  28. 28.
    Alzoubi K., Li X.-Y., Wang Y., Wan P.-J., Frieder O. (2003). Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 14(5):408–421CrossRefGoogle Scholar
  29. 29.
    Hogg R. V. and Tanis E. A. (1993). Probability and Statistical Inference, 4th edition. MacMillan Publishing Company, NYzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Shuhui Yang
    • 1
    Email author
  • Fei Dai
    • 2
  • Mihaela Cardei
    • 1
  • Jie Wu
    • 1
  • Floyd Patterson
    • 2
  1. 1.Department of Computer Science and EngineeringFlorida Atlantic UniversityBoca RatonUSA
  2. 2.Department of Electrical and Computer EngineeringNorth Dakota State UniversityFargoUSA

Personalised recommendations