A routing protocol for wireless sensor networks using K-means and Dijkstra algorithm
by Zhang Ya-qiong; Li Yun-rui
International Journal of Advanced Media and Communication (IJAMC), Vol. 6, No. 2/3/4, 2016

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).

Online publication date: Tue, 13-Dec-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Media and Communication (IJAMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com