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

An ACOA-AFSA Fusion Routing Algorithm for Underwater Wireless Sensor Network

Author

Listed:
  • Huafeng Wu
  • Xinqiang Chen
  • Chaojian Shi
  • Yingjie Xiao
  • Ming Xu

Abstract

Due to intrinsic properties of aqueous environments, routing protocols for underwater wireless sensor network (UWSN) have to cope with many challenges such as long propagation delay, bad robustness, and high energy consumption. Basic ant colony optimization algorithm (ACOA) is an intelligent heuristic algorithm which has good robustness, distributed computing and combines with other algorithms easily. But its disadvantage is that it may converge at local solution, not global solution. Artificial fish swarm algorithm (AFSA) is one kind of intelligent algorithm that can converge at global solution set quickly but has lower precision in finding global solution. Therefore we can make use of AFSA and ACOA based on idea of complementary advantages. So ACOA-AFSA fusion routing algorithm is proposed which possesses advantages of AFSA and ACOA. As fusion algorithm has aforementioned virtues, it can reduce existing routing protocols' transmission delay, energy consumption and improve routing protocols' robustness theoretically. Finally we verify the feasibility and effectiveness of fusion algorithm through a series of simulations.

Suggested Citation

  • Huafeng Wu & Xinqiang Chen & Chaojian Shi & Yingjie Xiao & Ming Xu, 2012. "An ACOA-AFSA Fusion Routing Algorithm for Underwater Wireless Sensor Network," International Journal of Distributed Sensor Networks, , vol. 8(5), pages 920505-9205, May.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:5:p:920505
    DOI: 10.1155/2012/920505
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/920505
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/920505?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:8:y:2012:i:5:p:920505. 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.