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

Discrete event simulation–based energy efficient path determination scheme for probabilistic voting–based filtering scheme in sensor networks

Author

Listed:
  • Su Man Nam
  • Tae Ho Cho

Abstract

In wireless sensor networks, sensors are extremely vulnerable to false positive and false negative attacks due to their stringent energy and computational constraints. Several en-route filtering schemes mainly focus on saving energy through early detection of false data within a short distance against these attacks; however, they cannot immediately block the false data injected by compromised nodes. A security scheme uses context-aware architecture for a probabilistic voting–based filtering scheme to detect the compromised nodes and block the injection of false data, unlike security protocols. Although these schemes effectively obstruct the false data forwarding, they cannot make any detour around the compromised node to avoid it during data forwarding. In this article, we propose a discrete event simulation–based energy efficient path determination scheme that takes a detour around the compromised node against the attacks. Our proposed scheme extracts candidate paths considering the network status and selects a path with the highest energy efficiency from among the candidates using discrete event simulation. Simulation results indicate that the proposed scheme provides energy savings of up to 12% while maintaining the security strength against the two attacks compared to the existing schemes.

Suggested Citation

  • Su Man Nam & Tae Ho Cho, 2020. "Discrete event simulation–based energy efficient path determination scheme for probabilistic voting–based filtering scheme in sensor networks," International Journal of Distributed Sensor Networks, , vol. 16(8), pages 15501477209, August.
  • Handle: RePEc:sae:intdis:v:16:y:2020:i:8:p:1550147720949134
    DOI: 10.1177/1550147720949134
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147720949134
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147720949134?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
    ---><---

    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:16:y:2020:i:8:p:1550147720949134. 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.