English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 60984/93521 (65%)
造訪人次 : 1574308      線上人數 : 13
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/115582

    題名: On-Supporting Energy Balanced k-Barrier Coverage in Wireless Sensor Networks
    作者: Weng, Chien-I;CHANG, Chih-Yung;Hsiao, Chih-Yao;Chang, Chao-Tsun;CHEN, Haibao
    關鍵詞: Distributed;Barrier Coverage;Wireless Sensor Networks
    日期: 2018-01-15
    上傳時間: 2018-11-15 12:10:47 (UTC+8)
    摘要: The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes decentralized algorithms to cope with the k-barrier coverage problem. For a given value k, the proposed algorithms find out the maximum disjoint sets of sensors such that each set of sensors meets the requirement of k-barrier coverage for users. Three mechanisms, called Basic, Backtracking, and Branch, are proposed for constructing as more as possible the disjoint sets of sensors that satisfy the requirement of k-barrier coverage. Performance study reveals that the proposed algorithms achieve near-optimal performance.
    關聯: IEEE ACCESS 6, p. 13261–13274
    DOI: 10.1145/1582379.1582440
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    On-supporting energy balanced k-barrier coverage in wireless sensor networks.pdf1172KbAdobe PDF2檢視/開啟



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