IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v80y2022i3d10.1007_s11235-022-00914-1.html
   My bibliography  Save this article

A novel secure DV-Hop localization algorithm against wormhole attacks

Author

Listed:
  • Dezhi Han

    (Shanghai Maritime University)

  • Mengxiao Liu

    (Shanghai Maritime University)

  • Tien-Hsiung Weng

    (Providence University)

  • Canren Tang

    (Shanghai Maritime University)

  • Mario Donato Marino

    (Leeds Beckett University)

  • Kuan-Ching Li

    (Providence University)

Abstract

IoT era and its ubiquitous sensing raise serious security challenges such as wormhole attacks. Given that these attacks may affect the location determination of the employed sensors, security can be seriously compromised. The most common and severe attack is the single wormhole one, which is the focus of this paper. One of the most employed algorithms to approach the sensor location determination is the Distance Vector Hop (DV-Hop) algorithm, which can still be seriously affected from wormhole attacks. To overcome the challenges of this algorithm, this article proposes a novel secure DV-Hop localization algorithm against wormhole attack (ANDV-Hop), where beacon nodes delegate their attacked neighboring nodes to broadcast data messages, and the intersection of communication range of these neighboring nodes does include wormhole nodes. For implicit attacks, close nodes to the wormhole node are selected in order to broadcast data messages, whilst the nodes within the attack range remove beacon nodes at the other end of the link from the neighboring list. For explicit wormhole attack, the algorithm employs a trust model that calculates the comprehensive trust value obtained via a selection reward/punish coefficient. The selected ones within the intersection zone are considered rewarded, whilst the ones to be removed are classified as punished. Experimental results show that the proposed algorithm improves detection success rate, reduces relative localization error and energy loss, showing effectiveness and reliability.

Suggested Citation

  • Dezhi Han & Mengxiao Liu & Tien-Hsiung Weng & Canren Tang & Mario Donato Marino & Kuan-Ching Li, 2022. "A novel secure DV-Hop localization algorithm against wormhole attacks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(3), pages 413-430, July.
    • Handle: RePEc:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00914-1
    DOI: 10.1007/s11235-022-00914-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00914-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-022-00914-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Penghong Wang & Fei Xue & Hangjuan Li & Zhihua Cui & Liping Xie & Jinjun Chen, 2019. "A Multi-Objective DV-Hop Localization Algorithm Based on NSGA-II in Internet of Things," Mathematics, MDPI, vol. 7(2), pages 1-20, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiuwu Yu & Xun Wang & Yong Liu, 2024. "Secure positioning of wireless sensor networks against wormhole attacks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 87(3), pages 835-843, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tapan Kumar Mohanta & Dushmanta Kumar Das, 2022. "Improved DV-Hop localization algorithm based on social learning class topper optimization for wireless sensor network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(4), pages 529-543, August.

    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:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00914-1. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.