Energy-Efficient Routing Algorithm Based on Small-World Characteristics

Water quality sensor networks are widely used in water resource monitoring. However, due to the fact that the energy of these networks cannot be supplemented in time, it is necessary to study effective routing protocols to extend their lifecycle. To address the problem of limited resources, a routing optimization algorithm based on a small-world network model is proposed. In this paper, a small-world network model is introduced for water quality sensor networks, in which the short average path and large clustering coefficient of the model are used to construct a super link. A short average path can reduce the network’s energy consumption, and a large coefficient can improve its fault-tolerance ability. However, the energy consumption of the relay nodes near the heterogeneous node is too great, and as such the energy threshold and non-uniform clustering are constructed to improve the lifecycle of the network. Simulation results show that, compared with the low-energy adaptive clustering hierarchy routing algorithm and the best sink location clustering heterogeneous network routing algorithm, the proposed improved routing model can effectively enhance the energy-utilization. The lifecycle of the network can be extended and the data transmission amount can be greatly increased.