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

A Multipopulation Firefly Algorithm for Correlated Data Routing in Underwater Wireless Sensor Networks

Author

Listed:
  • Ming Xu
  • Guangzhong Liu

Abstract

Low data delivery efficiency and high energy consumption are the inherent problems in Underwater Wireless Sensor Networks (UWSNs) characterized by the acoustic channels. Existing energy-efficient routing algorithms have been shown to reduce energy consumption of UWSNs to some extent, but still neglect the correlation existing in the local data of sensor nodes. In this paper, we present a Multi-population Firefly Algorithm (MFA) for correlated data routing in UWSNs. We design three kinds of fireflies and their coordination rules in order to improve the adaptability of building, selecting, and optimization of routing path considering the data correlation and their sampling rate in various sensor nodes. Different groups of fireflies conduct their optimization in the evolution in order to improve the convergence speed and solution precision of the algorithm. Moreover, after the data packets are merged during the process of routing path finding, MFA can also eliminate redundant information before they are sent to the sink node, which in turn saves energy and bandwidth. Simulation results have shown that MFA achieves better performance than existing protocols in metrics of packet delivery ratio, energy consumption, and network throughput.

Suggested Citation

  • Ming Xu & Guangzhong Liu, 2013. "A Multipopulation Firefly Algorithm for Correlated Data Routing in Underwater Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(3), pages 865154-8651, March.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:3:p:865154
    DOI: 10.1155/2013/865154
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/865154
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/865154?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:9:y:2013:i:3:p:865154. 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.