Research On Energy Balance Routing Algorithms For Wireless Sensor Network

Wireless Sensor Network (WSN) is a multi-hop network that consists of a mass of sensors nodes with the function of perception, data processing and wireless communication. WSN can be applied to collect the different environment parameters in large area. WSN is a data-centric network and the energy is high limited. So, the research on prolonging the network’s lifetime and balancing the energy consumption is a hot area in WSN. Researches of WSN involves routing algorithm, security algorithm and network coverage algorithm and so on. Routing algorithm is one of the hottest researches, and full and reasonable using energy is the most important factor in routing algorithm design.Based on the researches on the status of on routing algorithm in domestic and overseas, this artic took the clustering routing algorithm as the breakpoint, and analyzed the merits and demerits of the current algorithm. Pointed on the energy limited feature of the WSN, this artic do researches on the main factors of energy consumption, and proposes two algorithm as follows:(1) A residual energy based improved routing algorithm called WN-LEACH. This algorithm is based on N-LEACH, and takes the residual energy as an important element for cluster selection. Since N-LEACH had balanced the energy dissipation of cluster heads, this work improved the algorithm adaptability for energy-uneven network. To adapt to the uneven energy consumption for data transmission caused by different sink position, the algorithm brought in a weight parameter. The parameter should be changed to fit different network framework and it could be updated dynamically. Simulation results show that when the sink is far away from the layout area and the initial energy of the sensor nodes is set randomly, the algorithm can prolong the lifetime of the WSN.(2) A Game Theory based cooperative transmission routing algorithm (GTCRA). When the sink is in the center of the layout area and the initial energy of the sensor nodes is set randomly, WN-LEACH cannot avoid some nodes dead prematurely for the reason that the cluster node is selected randomly. To solve this problem, GTCRA took the Game Theory as the base theory, and brought in cooperative transmission method to share the energy consumption of the cluster head. Based on the features of WSN, the residual energy of the sensor node and the energy for data transmission in inner-cluster was considered when the payoff function was designed for cluster selection, and a first-price sealed auction game model was used to select the cooperative nodes. By playing game among the sensor nodes, the best cluster head and cooperative nodes were selected. Simulation results show that GTCRA can prolong the lifetime of the network and balance the energy dissipation of the network in the given situation.