淡江大學機構典藏:Item 987654321/111896
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3985321      線上人數 : 303
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/111896


    題名: The Target-Barrier Coverage Problem in Wireless Sensor Networks
    作者: Cheng, Chien-Fu;Wang, Chen-Wei
    關鍵詞: Sensors;Wireless sensor networks;Surveillance;Mobile computing;Mobile communication;Algorithm design;analysis
    日期: 2017-08-27
    上傳時間: 2017-10-31 02:10:48 (UTC+8)
    摘要: 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 dbound constraint that is set depending on applications and needs, where dbound 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 dbound to detect 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 dbound 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.
    關聯: IEEE Transactions on Mobile Computing 17(5), p.1216-1232
    DOI: 10.1109/TMC.2017.2751040
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML170檢視/開啟
    The Target-Barrier Coverage Problem in Wireless Sensor Networks.pdf3205KbAdobe PDF1檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋