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

An Energy-Efficient Routing Algorithm for Underwater Wireless Sensor Networks Inspired by Ultrasonic Frogs

Author

Listed:
  • Ming Xu
  • Guangzhong Liu
  • Huafeng Wu

Abstract

The area of three-dimensional (3D) underwater wireless sensor networks (UWSNs) has attracted significant attention recently due to its applications in detecting and observing phenomena that cannot be adequately observed by means of two-dimensional UWSNs. However, designing routing protocols for 3D UWSNs is a challenging task due to stringent constraints imposed by acoustic communications and high energy consumption in acoustic modems. In this paper, we present an ultrasonic frog calling algorithm (UFCA) that aims to achieve energy-efficient routing under harsh underwater conditions of UWSNs. In UFCA, the process of selecting relay nodes to forward the data packet is similar to that of calling behavior of ultrasonic frog for mating. We define the gravity function to represent the attractiveness from one sensor node to another. In order to save energy, different sensor nodes adopt different transmission radius and the values can be tuned dynamically according to their residual energy. Moreover, the sensor nodes that own less energy or locate in worse places choose to enter sleep mode for the purpose of saving energy. Simulation results show the performance improvement in metrics of packet delivery ratio, energy consumption, throughput, and end-to-end delay as compared to existing state-of-the-art routing protocols.

Suggested Citation

  • Ming Xu & Guangzhong Liu & Huafeng Wu, 2014. "An Energy-Efficient Routing Algorithm for Underwater Wireless Sensor Networks Inspired by Ultrasonic Frogs," International Journal of Distributed Sensor Networks, , vol. 10(2), pages 351520-3515, February.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:2:p:351520
    DOI: 10.1155/2014/351520
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/351520
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/351520?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:10:y:2014:i:2:p:351520. 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.