IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0120715.html
   My bibliography  Save this article

Securing Mobile Ad Hoc Networks Using Danger Theory-Based Artificial Immune Algorithm

Author

Listed:
  • Maha Abdelhaq
  • Raed Alsaqour
  • Shawkat Abdelhaq

Abstract

A mobile ad hoc network (MANET) is a set of mobile, decentralized, and self-organizing nodes that are used in special cases, such as in the military. MANET properties render the environment of this network vulnerable to different types of attacks, including black hole, wormhole and flooding-based attacks. Flooding-based attacks are one of the most dangerous attacks that aim to consume all network resources and thus paralyze the functionality of the whole network. Therefore, the objective of this paper is to investigate the capability of a danger theory-based artificial immune algorithm called the mobile dendritic cell algorithm (MDCA) to detect flooding-based attacks in MANETs. The MDCA applies the dendritic cell algorithm (DCA) to secure the MANET with additional improvements. The MDCA is tested and validated using Qualnet v7.1 simulation tool. This work also introduces a new simulation module for a flooding attack called the resource consumption attack (RCA) using Qualnet v7.1. The results highlight the high efficiency of the MDCA in detecting RCAs in MANETs.

Suggested Citation

  • Maha Abdelhaq & Raed Alsaqour & Shawkat Abdelhaq, 2015. "Securing Mobile Ad Hoc Networks Using Danger Theory-Based Artificial Immune Algorithm," PLOS ONE, Public Library of Science, vol. 10(5), pages 1-16, May.
    • Handle: RePEc:plo:pone00:0120715
    DOI: 10.1371/journal.pone.0120715
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0120715
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0120715&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0120715?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
    ---><---

    Citations

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


    Cited by:

    1. Rahab M Ramadan & Safa M Gasser & Mohamed S El-Mahallawy & Karim Hammad & Ahmed M El Bakly, 2018. "A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks," PLOS ONE, Public Library of Science, vol. 13(3), pages 1-17, March.

    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:plo:pone00:0120715. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.