The Residual Energy Base On Wireless Networks

The main drawback of the tree routing algorithm in the ZigBee network is that its routing path is not optimal and each node is not energy-balanced or load-balanced. Under the conditions of large-scale data collection and limited hardware, it is easy to make the network congestion, also causing a lot of energy-consuming in the individual key-node, resulting in the phenomenon of network partitioning, which even causes the paralysis of the whole network. We hope to be able to try to choose the number of hops less energy consumption routing, which can minimize the energy consumption, but because of some individual nodes in network hot spot, in the transmission of data is often to transmit data through it,this will cause the premature death of the points, so that the whole network there arrive in the entire network does not work, while the other network nodes energy this time may also be more adequate for this intention, we hope to be able to extend the life cycle of the Zig Bee is broken. In view of the above problems, this paper designed the residual energy and the minimum hop count routing algorithm based on. To address these issues, this paper proposes a gradient-based ZigBee network routing algorithm.In this paper the design of the algorithm, when the node residual energy is higher than the threshold, this time routing can through this node. When the residual energy of nodes below the threshold, routing cannot through this node. And the threshold with remaining energy of the network is variable. Algorithm chooses the OMNET++ simulation platform to simulate and compare the improved algorithm with tree routing algorithm. The results show that the performance of this algorithm compared with tree routing algorithm in energy and load are improved.This paper compares the proposed algorithm to the original tree routing algorithm with the use of OMNET++ simulation tool. Results show that this proposed algorithm has improved performance in energy and load compared to tree routing algorithm. Finally, based on gradient-based routing, this paper proposes the concept of concentric-circle networking.