Energy Wireless Sensor Network Routing Optimization Based On Dynamic Programming Method

In a traditional network routing nodes almost has no consideration to the energy,but in wireless sensor networks of the energy effectiveness of the routing algorithm isoften more important than finding the shortest path. In this paper, energy saving and abalanced internet energy consumption’ perspective presents a dynamic energeticprogramming based on routing algorithm. In order to extend the network’s lifetimeusing dynamic programming to ensure balanced energy consumption at the same timeas much as possible to find the best path, that is, the algorithm can balance the energyconsumption of network nodes at the same time, as far as possible to find the global bestpath for data forwarding.This paper is to talk about the problems, to improve the energy effectiveness of theWSN network and reduce the data transmission time. This paper completes thefollowing work: innovative and exploratory research. The main contents are:(1)There are some problems about the GPSR routing protocol and AODV routingprotocol, proposing energy-based aggregation of routing protocols and the directionalAODV routing protocol. Two agreements took into account the node energyconsumption of data transmission and the effectiveness of the energy balance of thenetwork, sensor nodes in accordance with their size and energy parameters such as thelocation of the destination node to select the next hop node. Algorithms are based on thegeographical location of neighbor for routing information, with low computationalcomplexity.(2) wireless sensor network node broadcast a relatively dense network topologydoes not change, according to the node transmission node to the sink node, theminimum number of hops between a fixed value, by using the minimum number ofhops into the network at all stages of make the network more responsive to dynamicprogramming strategy, then for WSNs based on dynamic programming model andhigh-performance network dynamic routing algorithm described in detail, and gives thealgorithm using pseudo-code execution, come and give proof of two theorems. Theroute recovery mechanism, the paper uses the primary path and alternate path common use, when the network link is dead or does not appear in the link node, the networkpriority with the primary path for data transmission, when the network fails, the use ofspare path for data transfer and forwarding. In order to avoid duplication of data sentdue to long transmission delay, packet loss also avoids the waste of energy caused bynetwork nodes;(3) Finally, this paper will DPER algorithm through computer simulation with theother two classical algorithms and improved comparative analysis of two algorithms toverify the algorithm in wireless sensor networks transmit data validity. Experimentalresults show that, based on dynamic programming energy-efficient wireless sensornetwork routing algorithm is a feasible way to strong, it not only in terms of networkperformance of a lifetime on better results, but also improve network energy efficiency,reducing the average path length, reducing the residual energy of nodes and poornetwork performance standards have shown good results.