English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51296/86402 (59%)
造訪人次 : 8154508      線上人數 : 99
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/110167

    題名: The Barrier-Breach Problem of Barrier Coverage in Wireless Sensor Networks
    作者: Cheng, Chien-Fu;Wang, Chen-Wei
    關鍵詞: Wireless sensor networks;barrier coverage;barrier-breach problem
    日期: 2017-10
    上傳時間: 2017-04-18 02:10:22 (UTC+8)
    出版者: IEEE Communications Society
    摘要: When there are multiple barriers in a wireless sensor network (WSN), the sleep-wakeup schedule can be used to alternate working barriers to extend the overall network lifetime. However, when one working barrier is being replaced by another, if any intruder comes into the potential-breach-point between these two barriers, the barrier-breach problem may occur. In this letter, the proposed algorithm uses mobile elements to check presence of intruders at potential-breach-points. Compared to the extant algorithms, the proposed algorithm has two major advantages: (1) It does not remove crossing barriers, so the overall network lifetime of barrier coverage can be extended; (2) It does not alternate working barriers always based on the order of barrier’s distance to the front side, from near to far, so the sleep-wakeup schedule can be flexibly arranged.
    關聯: IEEE Communications Letters 21(10), p.2262 - 2265
    DOI: 10.1109/LCOMM.2017.2694432
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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