Skip to main navigation Skip to search Skip to main content

Dynamic Layered Clustering Routing algorithm in Underwater Sensor Networks

  • Chang Jian Hong*
  • , Wei Jie Wu
  • , Ping Peng Tang
  • *Corresponding author for this work
  • Wuhan Second Ship Design and Research Institute

Research output: Contribution to journalArticlepeer-review

Abstract

To deal with the limitation that flat routing can hardly be accustomed to large scale Underwater Sensor Networks (USN), a new clustering routing algorithm Dynamic Layered Clustering Routing (DLCR) is proposed, which can be accustomed to larger scale networks. This algorithm divides the networks into several layers from top to bottom, and selects the nodes which have more remaining energy and shorter distance to sink as the cluster head nodes, thus, clusters' communication energy consumption are reduced. In order to avoid the same nodes being elected to be cluster head nodes continuously, a dynamic layered mechanism that the networks are divided into different layers in each circle of data gathering is proposed. The experiment shows that DLCR not only has a better stability, but also reduces the energy consumption and prolongs the lifetime of the whole networks.

Original languageEnglish
Pages (from-to)1291-1297
Number of pages7
JournalDianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
Volume37
Issue number6
DOIs
StatePublished - 1 Jun 2015
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 7 - Affordable and Clean Energy
    SDG 7 Affordable and Clean Energy

Keywords

  • Clustering routing
  • Dynamic layered mechanism
  • Underwater Sensor Networks (USN)

Fingerprint

Dive into the research topics of 'Dynamic Layered Clustering Routing algorithm in Underwater Sensor Networks'. Together they form a unique fingerprint.

Cite this