Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Aiming at the "hotspots" problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads' election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission.

References Powered by Scopus

Cited by Powered by Scopus

Get full text

This article is free to access.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Zhang, Y., Xiong, W., Han, D., Chen, W., & Wang, J. (2016). Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks. Journal of Sensors, 2016. https://doi.org/10.1155/2016/7542907

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 1

50%

Researcher 1

50%

Readers' Discipline

Tooltip

Engineering 2

50%

Computer Science 1

25%

Psychology 1

25%

Save time finding and organizing research with Mendeley

Sign up for free