Energy Balance Routing Algorithm For Wireless Sensor Networks

Wireless sensor networks is a science that includes science of sensors, computers, communications, microelectronics, information processing, and so on. With the rapid development of related technology, and with the maturity of sensor nodes that is low-cost, low-power, multifunctional and tiny, so wireless sensor networks has become a new research hotspot. And, routing algorithm for wireless sensor networks is an important research.This paper introduces research background and research status of wireless sensor networks. Then, routing protocols for wireless sensor networks and its related knowledge has been described. Because energy of nodes in wireless sensor networks is limited, and it can't be supplied, energy consumption has become an important issue for routing algorithm in wireless sensor networks. In this paper, for the problems of energy balance and survival time, two cluster-based routing algorithms are proposed. They are EDDR algorithm and CERA algorithm. And then, thinking, model, detailed description, and simulation for the algorithms, and other aspects have been fully described in this paper. In addition, simulation results show excellent performance of the algorithms.EDDR algorithm is applied to the nodes in static environment. And, its idea includes two aspects as follow: how to select cluster heads and how to route data between clusters. In the cluster head selection, it makes use of cluster head energy priority and constraint of the mininum distance between clusters. It improves on the randomness of cluster heads selection in LEACH, so that distribution of cluster heads is more even, and the energy consumption of cluster heads can be better contribution to each node; In the inter-cluster routing, it employs multi-hop manner, and makes use of Dijkstra algorithm with energy-distance composite weights to generate a shortest path between clusters, therefore, it can reduce the energy consumption of data transmission between clusters. Compared to LEACH algorithm, the simulation with MATLAB shows that EDDR algorithm improves the energy balance in wireless sensor networks, prolongs the network lifetime.CERA algorithm is applied to the nodes in mobile environment, its idea is to form cluster structure with good adaptability and stability, only rely on self-organization of mobile sensor nodes.Now, there are many routing algorithm for mobile environment, but they need to additional conditions, such as adding fixed nodes, which in fact limits the application of the algorithm. CERA algorithm proposed in this paper does not need additional conditions in the case. The clustering phase with the various considerations: Firstly, limited the scope of the cluster structure with the do transmission radius of free space model, and the smaller clusters not only can be relatively stable in the mobile range, but also can save energy for data transmission. Secondly, it use a method of composite weights to choose the cluster heads, the weight of the node is not only considered the energy of sensor nodes but also considered the very important factor to the mobile nodes, such as node speed and node aggregation. The greater the weight is, the more chance to become a candidate cluster head it has. In the MATLAB simulation, compared to LEACH, the results show that CERA algorithm effectively improves the energy balance of wireless sensor networks, prolongs the network lifetime, and increase the success rate of data transmission.