@inproceedings{e84a0d82e1c74eaa990da5c2f29bbac7,
title = "Probabilistic k-weighted coverage placement in wireless sensor networks",
abstract = "In this paper, we study a new problem called probabilistic A-weighted coverage placement, which is a generalization of the {\ss}-coverage placement. {\ss}-coverage placement assumes that the monitored area has uniform coverage requirement: events within the monitored area should be detected with probability Q X100% (i.e., detected by Q sensors), while probabilistic A-weighted coverage placement assumes that the monitored area has A-degrees of coverage requirement (i.e., A kinds of detection probability): events within distinct region of the monitored area are detected with distinct detection ability, i.e., one of the A kinds of detection probability. Besides, Q-coverage placement requires that the coverage requirement is integer multiple of 100% detection probability, while probabilistic A-weighted coverage placement allows coverage requirement to be non-integer multiple of 100% detection probability. We derive a lower bound on the number of sensors needed to satisfy the coverage requirement of a probabilistic A-weighted monitored area, and introduce a greedy algorithm to solve the problem.",
keywords = "NP-hardness, coverage, k-coverage, sensor networks, sensor placement, wireless",
author = "Chang, {Guey Yun} and Charng, {Chih Wei} and Sheu, {Jang Ping} and Liang Ruei-Yuan",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 19th Asia-Pacific Network Operations and Management Symposium, APNOMS 2017 ; Conference date: 27-09-2017 Through 29-09-2017",
year = "2017",
month = nov,
day = "1",
doi = "10.1109/APNOMS.2017.8094153",
language = "???core.languages.en_GB???",
series = "19th Asia-Pacific Network Operations and Management Symposium: Managing a World of Things, APNOMS 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "382--385",
booktitle = "19th Asia-Pacific Network Operations and Management Symposium",
}