IDEAS home Printed from https://ideas.repec.org/a/hin/complx/8835103.html
   My bibliography  Save this article

A Dynamic Hierarchical Clustering Data Gathering Algorithm Based on Multiple Criteria Decision Making for 3D Underwater Sensor Networks

Author

Listed:
  • Xiaoying Song
  • Wei Sun
  • Qilong Zhang

Abstract

Data gathering is the basis of monitoring applications in an underwater sensor network, and excellent network coverage and data transmission reliability are the guarantees for the quality of monitoring tasks. However, the energy consumption of the nodes is too fast due to the heavy load of the cluster heads closer to the sink when data is transmitted between cluster heads (CHs) and the sink by multihop, which leads to an energy hole problem in an underwater sensor network of clustering technology. Aiming to address this problem, we propose a dynamic hierarchical clustering data gathering algorithm based on multiple criteria decision making (DHCDGA) in a 3D underwater sensor network. Firstly, the entire monitoring network is divided into many layers. For selecting a cluster head in each layer, multiple criteria decision making of an intuitionistic fuzzy Analytic Hierarchy Process (AHP) and hierarchical fuzzy integration is adopted. Furthermore, a sorting algorithm is used to form a clustering topology algorithm to solve the problem that there is the only node in one cluster. Then, an energy-balanced routing algorithm between clusters is proposed according to the residual energy of the node, the depth, and the number of neighbor nodes. Finally, the simulation results show that DHCDGA can not only effectively balance the energy consumption of the network and prolong the network lifetime but also improve network coverage and data gathering reliability.

Suggested Citation

  • Xiaoying Song & Wei Sun & Qilong Zhang, 2020. "A Dynamic Hierarchical Clustering Data Gathering Algorithm Based on Multiple Criteria Decision Making for 3D Underwater Sensor Networks," Complexity, Hindawi, vol. 2020, pages 1-14, October.
  • Handle: RePEc:hin:complx:8835103
    DOI: 10.1155/2020/8835103
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/8835103.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/8835103.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8835103?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:hin:complx:8835103. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.