On multiple point coverage in wireless sensor networks

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 covera...

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005 pp. 8 pp. - 764
Main Authors Shuhui Yang, Fei Dai, Cardei, M., Jie Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Algorithm design and analysis
Analytical models
Computer networks
Computer science
Intelligent networks
Linear programming
Neodymium
Performance analysis
Switches
Wireless sensor networks
Online AccessGet full text
ISBN0780394658
9780780394650
ISSN2155-6806
DOI10.1109/MAHSS.2005.1542868

Cover

More Information
Summary: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-CCSlk-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
ISBN:0780394658
9780780394650
ISSN:2155-6806
DOI:10.1109/MAHSS.2005.1542868