Open Access

ARTICLE

A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm

Xinliang Tang¹, Man Zhang¹, Pingping Yu¹, Wei Liu², Ning Cao^{3, *}, Yunfeng Xu⁴

1 School of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang, 050000, China.
2 Hebei Chemical and Pharmaceutical College, Hebei Seismological Bureau, Shijiazhuang, 050000, China.
3 School of Internet of Things and Software Technology, Wuxi Vocational College of Science and Technology, Wuxi, 214028, China.
4 Rutgers Business School-Newark, Washington Park, Newark, NJ 07102, USA.

* Corresponding Author: Ning Cao. Email: .

Computers, Materials & Continua 2020, 64(3), 1725-1739. https://doi.org/10.32604/cmc.2020.010272

Received 26 February 2020; Accepted 24 April 2020; Issue published 30 June 2020

Abstract

In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm. The algorithm uses a clustering method to form and optimize clusters, and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN. To ensure that the cluster head (CH) selection in the network is fair and that the location of the selected CH is not concentrated within a certain range, we chose the appropriate CH competition radius. Simulation results show that, compared with LEACH, LEACH-C, and the DEEC clustering algorithm, this algorithm can effectively balance the energy consumption of the CH and extend the network life.

---

Keywords

---

Citations