http://scholars.ntou.edu.tw/handle/123456789/20273
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chien-Fu Cheng | en_US |
dc.contributor.author | Chen-Wei Wang | en_US |
dc.date.accessioned | 2022-02-11T03:37:00Z | - |
dc.date.available | 2022-02-11T03:37:00Z | - |
dc.date.issued | 2017-09-11 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.uri | http://scholars.ntou.edu.tw/handle/123456789/20273 | - |
dc.description.abstract | In this paper, we define a new type of coverage problem named target-barrier coverage problem in wireless sensor networks. A target-barrier is a continuous circular barrier formed around the target. The target-barrier has a d bound constraint that is set depending on applications and needs, where d bound is the minimum distance of the constructed barrier from the target. Target-barrier coverage is very suited for application in defense surveillance, including detection of intrusion from outside and prevention of barrier breaching from inside. For instance, in a jail scenario, sensors can be deployed to enclose a jail with the constraint of d bound to detect the escape of prisoners or unauthorized entry into the jail for rescuing prisoners. We focus on how to minimize the number of members required to construct target-barriers in a distributed manner while satisfying the d bound constraint and minimizing the amount of message exchange required. In performance evaluation, we compare our solution with the solution of related work and the Brute-Force algorithm which can find the minimum number of target-barrier members required. Our experimental results show that the proposed algorithm delivers satisfactory results in terms of the number of target-barrier members required and the amount of message exchange required. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartof | IEEE Transactions on Mobile Computing | en_US |
dc.subject | Sensors | en_US |
dc.subject | Wireless sensor networks | en_US |
dc.subject | Surveillance | en_US |
dc.subject | Mobile computing | en_US |
dc.subject | Mobile communication | en_US |
dc.subject | Algorithm design and analysis | en_US |
dc.subject | Wireless sensor networks | en_US |
dc.subject | coverage problem | en_US |
dc.subject | target-barrier coverage | en_US |
dc.title | The Target-Barrier Coverage Problem in Wireless Sensor Networks | en_US |
dc.type | journal article | en_US |
dc.identifier.doi | 10.1109/TMC.2017.2751040 | - |
dc.identifier.isi | WOS:000429252000017 | - |
dc.relation.journalvolume | 17 | en_US |
dc.relation.journalissue | 5 | en_US |
dc.relation.pages | 1216 - 1232 | en_US |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | journal article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.fulltext | no fulltext | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | Department of Computer Science and Engineering | - |
crisitem.author.dept | College of Electrical Engineering and Computer Science | - |
crisitem.author.dept | National Taiwan Ocean University,NTOU | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | National Taiwan Ocean University,NTOU | - |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。