IDEAS home Printed from https://ideas.repec.org/a/prg/jnlaip/v2024y2024i3id234p340-358.html
   My bibliography  Save this article

Securing RPL-Based Networks Against Version Number and Rank Attacks

Author

Listed:
  • Alaa Eddine Khalfoune
  • Rachid Beghdad

Abstract

The increasing reliance on Low-power and Lossy Networks (LLN) in the Internet of Things (IoT) and their vulnerability to various attacks have made their protection necessary. Most of the proposed approaches to protecting such networks neither support scalability nor are lightweight enough to be incorporated into these constrained networks. In this paper, we present a lightweight approach to protecting LLN networks from rank and version number attacks. The proposal relies on light exchanged messages between the network nodes and the root and network nodes themselves. Successive comparison processes are used to detect the attack while two blocking techniques are introduced against malicious nodes. Simulations demonstrated the effectiveness of the approach, outperforming similar approaches such as Sink-Based Intrusion Detection Systems (SBIDS), Secure Routing Protocol (SRPL) for LLN, the Machine-Learning Technique based on K-Nearest Neighbour (MLTKNN), secure trust-aware Routing Protocol for Low Power and Lossy Networks (SecTrust) and Shield in terms of appropriate parameters, without causing extra charges on the network.

Suggested Citation

  • Alaa Eddine Khalfoune & Rachid Beghdad, 2024. "Securing RPL-Based Networks Against Version Number and Rank Attacks," Acta Informatica Pragensia, Prague University of Economics and Business, vol. 2024(3), pages 340-358.
  • Handle: RePEc:prg:jnlaip:v:2024:y:2024:i:3:id:234:p:340-358
    DOI: 10.18267/j.aip.234
    as

    Download full text from publisher

    File URL: http://aip.vse.cz/doi/10.18267/j.aip.234.html
    Download Restriction: free of charge

    File URL: http://aip.vse.cz/doi/10.18267/j.aip.234.pdf
    Download Restriction: free of charge

    File URL: https://libkey.io/10.18267/j.aip.234?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.

    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:prg:jnlaip:v:2024:y:2024:i:3:id:234:p:340-358. 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: Stanislav Vojir (email available below). General contact details of provider: https://edirc.repec.org/data/uevsecz.html .

    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.