Title: A routing protocol for wireless sensor networks using K-means and Dijkstra algorithm

Authors: Zhang Ya-qiong; Li Yun-rui

Addresses: School of Information Engineering, YuLin University, Yulin, 719000, China ' Department of Electrical and Computer Engineering, Wayne State University, Detroit, 48202, USA

Abstract: For random clustering and one hop communication in LEACH, if there are too many nodes in a cluster, the cluster head will consume more energy and the network lifetime will be shortened. To balance energy consume and avoid long distance communication, a uniform clustering routing algorithm based on K-means and Dijkstra algorithm (KDUCR) is proposed in this paper. In the KDUCR algorithm, the sink node uses K-means clustering algorithm to divide sensor nodes into k uniform clusters and assigns the head of each cluster in the first round. Then the sink node uses Dijkstra algorithm with heads' position to calculate the shortest paths from every head to the sink node. In the resident round of network operation, reclustering will not run, only cluster heads updating and routing updating run. The simulation shows that the KDUCR algorithm could better balance the energy consumption of nodes and prolong lifetime of a wireless sensor network (WSN).

Keywords: WSNs; wireless sensor networks; routing protocols; K-means clustering; Dijkstra algorithm; energy balance; energy consumption; network lifetime; random clustering; one hop communication; LEACH; simulation.

DOI: 10.1504/IJAMC.2016.080964

International Journal of Advanced Media and Communication, 2016 Vol.6 No.2/3/4, pp.109 - 121

Available online: 10 Dec 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article