http://scholars.ntou.edu.tw/handle/123456789/20273
標題: | The Target-Barrier Coverage Problem in Wireless Sensor Networks | 作者: | Chien-Fu Cheng Chen-Wei Wang |
關鍵字: | Sensors;Wireless sensor networks;Surveillance;Mobile computing;Mobile communication;Algorithm design and analysis;Wireless sensor networks;coverage problem;target-barrier coverage | 公開日期: | 11-九月-2017 | 出版社: | IEEE | 卷: | 17 | 期: | 5 | 起(迄)頁: | 1216 - 1232 | 來源出版物: | IEEE Transactions on Mobile Computing | 摘要: | 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. |
URI: | http://scholars.ntou.edu.tw/handle/123456789/20273 | ISSN: | 1536-1233 | DOI: | 10.1109/TMC.2017.2751040 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。