Energy-efficient hierarchical routing for wireless sensor networks

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

Abstract

Clustering algorithm is wildly used in the routing of wireless sensor networks (WSNs). However, because of the non-uniform cluster-head selection in the classical clustering algorithm, some nodes maybe exhaust energy prematurely. In this paper, a distributed, energy-efficient routing protocol based on multiple objective decision-making and ant colony (EERMA) is proposed for large scale cluster-based wireless sensor networks. A multiple objective decision-making based clustering algorithm is adopted to select the best nodes as the cluster-heads according to their energy efficiency. Meanwhile, the Density Method is adopted to avoid collisions and to ensure the symmetrical distribution of the cluster-heads. In inter-cluster, an improved AntNet algorithm, which is a biologically inspired paradigm specified for WSNs, is adopted across all cluster-heads to forward aggregate data to the sink node by means of multi-hop. As only cluster-heads participate in the inter-cluster routing operation, the algorithm can provide a smooth operation more effectively. Simulation results denote that EERMA algorithm has longer lifetime and more eximious expansibility than LEACH-like algorithms. © 2010 Old City Publishing, Inc.

Cite

CITATION STYLE

APA

Gao, T., Jin, R., Xu, T., & Wang, L. (2011). Energy-efficient hierarchical routing for wireless sensor networks. Ad-Hoc and Sensor Wireless Networks, 11(1–2), 35–72. https://doi.org/10.7753/ijsea0209.1001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free