A K-Means Clustered Routing Algorithm with Location and Energy Awareness for Underwater Wireless Sensor Networks
Luyao Li, Yang Qiu, Jing Xu
Abstract
Data delivery in harsh underwater channels consumes a higher transmission power than that in terrestrial networks. However, due to the complexity of the underwater environment, the energy supply of the nodes in underwater wireless sensor networks is usually limited by their required laborious battery replacement. Thus, energy consumption is considered one of the key issues in underwater wireless optical communication. To minimize such consumption for underwater transmission nodes, much research interest has been found on K-Means technology in designing routing algorithms. However, these algorithms have not regarded the located site and the remaining energy of the underwater nodes simultaneously, which might affect their efficiency. In this paper, we propose a clustered routing algorithm, namely the location and energy-aware k-means clustered routing (LE-KCR) algorithm, which applies K-means technology regarding both the located site and the remaining energy of each node. In the proposed LE-KCR algorithm, both the located site and the remaining energy of a candidate cluster-head, as well as the distance between it and its sink node, are considered in cluster-head selection. In addition, given the inaccessibility of some nodes to the whole underwater sensor network resulting from the limited transmission range of their clusters, the dual-hop routing technique is adopted for the edge nodes. The simulation results indicate that the proposed LE-KCR algorithm remarkably reduces the energy consumption and the dead nodes when compared to the traditional low-energy adaptive clustering hierarchy (LEACH) protocol and the optimized LEACH protocol based on K-means clustering technology.