A Multi-Hop Energy Efficient Clustering Algorithm in Routing Protocol for Wireless Sensor Networks

Abstract

Wireless sensor networks (WSN) including large quantity of small sensor nodes with low-power energy consumption can effectively extend its life-span. However, the performance of WSN is affected by the environment. In this paper, we devise a new multi-hop routing algorithm clustering sensor nodes into groups to minimize the total energy consumption of the WSN. The proposed algorithm optimizes the intensity distribution of the cluster-heads(CHs) when introducing the model of Voronoi-Structure trees. The results of the simulation indicate that our algorithm using optimal parameter is able to prolong the life-span of the networks around 16% compared with low-energy adaptive cluster hierarchy (LEACH) and the whole networks obtain high performance on effective energy consumption.

Multi-Hop versus Overlay Networks: A Realistic Comparison Based on Energy Requirements and Latency

“…The state of the art in this field is based on a vast literature on routing in multi-hop networks such as [4,5], but to the best of our knowledge the comparison of those two network approaches with parameters derived from realistic measurement campaigns has not been presented so far.…”