IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i6p3807824.html
   My bibliography  Save this article

Strong k-Barrier Coverage for One-Way Intruders Detection in Wireless Sensor Networks

Author

Listed:
  • Junhai Luo
  • Shihua Zou

Abstract

Intruders detection is one of the very important applications in Wireless Sensor Networks (WSNs). Sometimes detecting intruders is not sufficient; distinguishing whether an intruder is legal or illegal is necessary. Since k -barrier coverage is widely used in detecting intruders, a barrier construction algorithm is needed, which can not only detect an intruder but also judge an illegal intruder. An intruder is defined as illegal if and only if it crosses straightly through the monitored region from the special side to another side. On the contrary, it is a legal intruder. To detect an intruder and distinguish whether the intruder is legal or illegal, a strong k -barrier coverage algorithm is proposed. The strong k -barrier coverage is a local barrier constructing algorithm and can detect any intruder crossing the k -barrier with a full probability. The strong k -barrier coverage detects all intruders penetrating the annular region for k times. What is more, the proposed strong k -barrier algorithm can provide a reliable judgement on whether an intruder is legal or illegal, and the constructed k -barrier coverage is different from the traditional one-way barrier coverage using binary barriers that are intersected but not overlapped. Some simulation tests show that the proposed algorithm can construct strong k -barrier coverage very well.

Suggested Citation

  • Junhai Luo & Shihua Zou, 2016. "Strong k-Barrier Coverage for One-Way Intruders Detection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 12(6), pages 3807824-380, June.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:6:p:3807824
    DOI: 10.1155/2016/3807824
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/3807824
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/3807824?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:12:y:2016:i:6:p:3807824. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.