Energy-balanced Routing Algorithm Research Of Wireless Sensor Networks Based On Cluster Structure

The advent of wireless sensor networks(WSN) makes the logical communication of physical world and information world become a reality, which is a promising technology and widely used in applications. Therefore, this technology is a hot research field among many researchers in present.Wireless sensor network is composed of a large number of sensor nodes forming self-organizing network. Sensor is a core component of wireless sensor networks, but sensor nodes have the weak point of smaller volume, obtaining energy from batteries. So the developing efficient network routing algorithm is a key technology to minimize energy consumption.In this paper, to solve the problem of nodes randomly distributed energy consumption, the structural model of wireless sensor networks, network clusters number, cluster structure, network coverage state and the network connectivity are analyzed, and two novel routing algorithms based on cluster structure are proposed. One is grid-located improved algorithm based on geographic location; another one is triangle model rotation node routing algorithm based on uniformly clustering. Nevertheless, two clustering algorithms adopted different ways to build network model for route calculation after clustering. The fundamental idea of the former is used geographic location to mesh the detection area and build cluster. Meanwhile, a high-level network is formed between the cluster head nodes, which adopt single or multi-hop manner to send sensory data tasks to the aggregation node. However, the fundamental idea of the latter is firstly calculate the number of clustering under the minimum total energy consumption in network, then aggregation node select the maximum residual energy and optimal location nodes as the cluster head node to complete uniformly clustering. Nodes in the cluster adopt triangle model and node coverage probability to carry out work node selection. Simulation results show that the two routing algorithms have obvious advantage in the network lifecycle, stability and network latency, et al. compared with previous typical algorithms.