Clustering is vital for lengthening the lives of resource-constrained wireless sensor nodes. In this work, we propose a cluster-based energy-efficient router placement scheme for wireless sensor networks, where the K-means algorithm is used to select the initial cluster headers and then a cluster header with sufficient battery energy is selected within each cluster. The performance of the proposed scheme was evaluated in terms of the energy consumption, end-to-end delay, and packet loss. Our simulation results using the OPNET simulator revealed that the energy consumption of our proposed scheme was better than that of the low-energy adaptive clustering hierarchy, which is known to be an energy-efficient clustering mechanism. Furthermore, our scheme outperformed low-energy adaptive clustering hierarchy in terms of the end-to-end delay, throughput, and packet loss rate.
The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the Global IT Talent support program (IITP-2017-0-01672) supervised by the IITP (Institute for Information and Communication Technology Promotion).This research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the Global IT Talent support program (IITP-2017-0-01672) supervised by the IITP (Institute for Information and Communication Technology Promotion).
