@inproceedings{b774f927d27d4a829c513caf7b64acfc,

title = "The Coverage Problem in a Wireless Sensor Network",

abstract = "One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k = 1 is assumed. Applications of the result include: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.",

keywords = "Ad hoc network, Computer geometry, Coverage problem, Sensor network, Ubiquitous computing, Wireless network",

author = "Huang, {Chi Fu} and Yu-Chee Tseng",

year = "2003",

month = dec,

day = "1",

doi = "10.1145/941350.941367",

language = "English",

isbn = "1581137648",

series = "Proceedings of the Second ACM International Workshop on Wireless Sensor networks and Applications, WSNA 2003",

pages = "115--121",

booktitle = "Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003",

note = "null ; Conference date: 19-09-2003 Through 19-09-2003",

}