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

Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks

Author

Listed:
  • Saeed Hamam
  • Ahmad S. Almogren

Abstract

Network coding has been confirmed as a potential technology to improve performance of wireless mesh networks (WMNs); network coding has great advantages for sensor networks like minimization of communication needed to collect sensor data and error recovery. A few network coding aware routings have been proposed. However, these mechanisms detect coding opportunities through local traffic pattern checking, which hardly obtains optimal routes. This paper proposes a Distributed Dynamic Memetic Algorithm Based Coding Aware Routing (DDMCAR) for wireless mesh networks, which employs memetic algorithm to optimize routes and coding opportunities. This paper proposes an improvement over GCAR algorithm by employing memetic algorithm and also meme sharing among nodes to increase the chance of finding optimal solution and continuous monitoring and update of meme fitness to achieve a dynamic tracking of network conditions, and finally using most fit memes for load balancing elevating congestion. Through simulations on randomly generated wireless mesh networks, DDMCAR is to be shown to find optimal routes within a short time and achieve more improvements than GCAR.

Suggested Citation

  • Saeed Hamam & Ahmad S. Almogren, 2016. "Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 5429303-542, March.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:5429303
    DOI: 10.1155/2016/5429303
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/5429303
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/5429303?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
    ---><---

    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:sae:intdis:v:12:y:2016:i:3:p:5429303. 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.