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

Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network

Author

Listed:
  • Yunlong Yu
  • Le Ru
  • Sheng Mao
  • Kangning Sun
  • Qiangqiang Yu
  • Kun Fang

Abstract

Airborne highly dynamic ad hoc UAV network has features of high node mobility, fast changing network topology, and complex application environment. The performance of traditional routing algorithms is so poor over aspects such as end to end delay, data packet delivery ratio, and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. A bionic optimization based stability and congestion aware routing algorithm—BSCAR algorithm—is proposed to solve these problems. This algorithm integrates biological behavior and dynamic source routing algorithm, which can sense the congestion level of routes and the stability of routes. Ant colony optimization algorithm and the mathematical model of Physarum's behavior exert effort in the process of route discovery and maintenance. The level of pheromone in routes is chosen as a standard to choose route and calculated by the mathematical model of Physarum's behavior. A new volatilization mechanism of pheromone is also introduced into the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show that the BSCAR algorithm has superiority over traditional algorithms and it is dependable in battlefield environment.

Suggested Citation

  • Yunlong Yu & Le Ru & Sheng Mao & Kangning Sun & Qiangqiang Yu & Kun Fang, 2016. "Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 8242497-824, March.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:8242497
    DOI: 10.1155/2016/8242497
    as

    Download full text from publisher

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

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