English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54452/89232 (61%)
造访人次 : 10573810      在线人数 : 49
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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 PDF0检视/开启



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