Open AccessThis article is
- freely available
Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering
Department of Informatics, University of Piraeus, 80, Karaoli & Dimitriou Street, GR-185-34 Piraeus, Greece
Department of Electronics, Technological Educational Institute (TEI) of Athens, Agiou Spiridonos, GR-12210 Egaleo, Athens, Greece
* Author to whom correspondence should be addressed.
Received: 14 September 2012; in revised form: 4 January 2013 / Accepted: 14 January 2013 / Published: 18 January 2013
Abstract: The wide utilization of Wireless Sensor Networks (WSNs) is obstructed by the severely limited energy constraints of the individual sensor nodes. This is the reason why a large part of the research in WSNs focuses on the development of energy efficient routing protocols. In this paper, a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. ECHERP models the network as a linear system and, using the Gaussian elimination algorithm, calculates the combinations of nodes that can be chosen as cluster heads in order to extend the network lifetime. The performance evaluation of ECHERP is carried out through simulation tests, which evince the effectiveness of this protocol in terms of network energy efficiency when compared against other well-known protocols.
Keywords: WSNs; energy efficiency; hierarchical routing; Gaussian elimination
Citations to this Article
Cite This Article
MDPI and ACS Style
Nikolidakis, S.A.; Kandris, D.; Vergados, D.D.; Douligeris, C. Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering. Algorithms 2013, 6, 29-42.
Nikolidakis SA, Kandris D, Vergados DD, Douligeris C. Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering. Algorithms. 2013; 6(1):29-42.
Nikolidakis, Stefanos A.; Kandris, Dionisis; Vergados, Dimitrios D.; Douligeris, Christos. 2013. "Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering." Algorithms 6, no. 1: 29-42.