English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49942/85107 (59%)
Visitors : 7783498      Online Users : 39
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/110167


    Title: The Barrier-Breach Problem of Barrier Coverage in Wireless Sensor Networks
    Authors: Cheng, Chien-Fu;Wang, Chen-Wei
    Keywords: Wireless sensor networks;barrier coverage;barrier-breach problem
    Date: 2017-10-01
    Issue Date: 2017-04-18 02:10:22 (UTC+8)
    Publisher: IEEE Communications Society
    Abstract: 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.
    Relation: IEEE Communications Letters 21(10), p.2262 - 2265
    DOI: 10.1109/LCOMM.2017.2694432
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML74View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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