Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

الملخص EN

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime.

In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm.

Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network.

In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads.

Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures.

It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network.

Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption.

Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime.

It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.