IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v10y2019i2p131-151.html
   My bibliography  Save this article

A New Approach based Bee Colony for the Resolution of Routing Problem in Mobile Ad-Hoc Networks

Author

Listed:
  • Said Labed

    (SCAL Team, MISC Laboratory, Abdelhamid Mehri Constantine 2 University, Constantine, Algeria)

  • Akram Kout

    (SCAL Team, MISC Laboratory, Ferhat Abbas Setif 1 University, Setif, Algeria)

  • Salim Chikhi

    (SCAL Team, MISC Laboratory, Abdelhamid Mehri Constantine 2 University, Constantine, Algeria)

Abstract

A mobile ad hoc network (MANET) is an autonomous system of mobile hosts (nodes) connected by a wireless link that forms a temporary network without the aid of any established infrastructure or centralized administration. The main problem of MANETs is the design of routing protocols that allow for communication among the hosts. The dynamic nature of such networks makes this problem especially challenging. The routing problems in ad hoc networks are due to their unpredictable and dynamic nature and the few resources (speed and autonomy). Therefore, bio-inspired algorithms are widely used to design adaptive routing strategies for MANETs. In this study, the authors propose a new approach based on the bee colony for the resolution of the routing problem in MANETs. The implementation (simulation) of the method is realized by Matlab, and the authors select Random WayPoint as mobility model. To validate the work, the authors compare the proposed approach with the AODV routing protocol in terms of the Quality of Service parameters, namely, End-to-End Delay, Packet Delivery Ratio and the Normalized Overhead Load.

Suggested Citation

  • Said Labed & Akram Kout & Salim Chikhi, 2019. "A New Approach based Bee Colony for the Resolution of Routing Problem in Mobile Ad-Hoc Networks," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 10(2), pages 131-151, April.
    • Handle: RePEc:igg:jamc00:v:10:y:2019:i:2:p:131-151
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2019040106
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:10:y:2019:i:2:p:131-151. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.