International Journal of Wireless Information Networks

, Volume 13, Issue 4, pp 289–301

On Connected Multiple Point Coverage in Wireless Sensor Networks

  • Shuhui Yang
  • Fei Dai
  • Mihaela Cardei
  • Jie Wu
  • Floyd Patterson
Article

DOI: 10.1007/s10776-006-0036-z

Cite this article as:
Yang, S., Dai, F., Cardei, M. et al. Int J Wireless Inf Networks (2006) 13: 289. doi:10.1007/s10776-006-0036-z

Abstract

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.

Keywords

Coverage problemlinear programminglocalized algorithmsreliabilitywireless sensor networks

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Shuhui Yang
    • 1
  • 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