Study On The Routing Algorithm In Wireless Sensor Network Based On Low Energy Consumption

The wireless sensor network becomes a hotspot all over the computer areas, it provided favorable conditions for people to get information. The sensor nodes easily concealed for its very small and very cheap, so they can be large located in the monitored region, and also easy to deploy and form self-organizing network. But the sensor node must operate on a tiny battery whit limited energy that recharge or replacement is not an option due to the complex environment it deployed, so the energy become the issue of the wireless sensor networks. Researchers at home and abroad have improved many energy-based routing protocols, how to reduce energy consumption and prolong the lifetime of the network become very important thing while improving protocols of wireless sensor network today. As the wireless sensor networks are application-related network, routing protocols according to different applications be divided into different categories.This paper describes a wireless sensor network routing design features and evaluation criteria, and makes analysis and summary for type wireless sensor network routing protocols. Then, it placed in perspective clustering technology and energy-saving technology, research and summary the existing clustering routing protocol, and analysis the energy-saving strategies and energy-saving technologies which is commonly used, at last it proposed a load-balanced and energy-efficient clustering routing protocol-(EELCA). In the EELCA, it used in the form of clustering, firstly, according to the proportion of the optimal cluster head calculates the number of cluster head, secondly divided into regions using certain rules, and assign each sub-region the number of cluster head. Thirdly, elect cluster head node based on both the energy level of the each sub-region and the optimal coverage of the cluster head to determine the distance between cluster head, make sure that cluster heads belong to sub-regions to maintain a certain distance. It both cover the whole network and to avoid signal interference. Fourthly, after the election, ordinary nodes apply to join the clusters without area limited, for instance, the same node can be added their own sub-region's cluster head, and also join the other regions'cluster heads. However, certain principles to be followed in this article, we named this principle the principle of proportionality, the principle taking into account three factors, cluster head node received signal's strength, the number of members of a cluster head and the distance between the cluster head and the base station. According to these three points , nodes judge to join the cluster which they decide to. After the cluster formation into the stabilization phase, ordinary nodes send information to its cluster head, cluster head send information to other cluster head which sub-region ID is smaller by 1, until it send information to the base station.Use the tools of MATLAB to make simulation tests on EELCA, the experimental results show that the protocol can achieve better balance and energy efficiency.Then to generalize and improve a proposed forwarding technique based on the Chinese Remainder Theorem (CRT). The main idea is to split the original message in several messages in several packets such that each node in the network will forward only small sub-packets. Finally, according to the CRT algorithm, the sink node need to reconstruct the original message. In the network, the lost of message will happen, so under the forwarding technique, if one of the component was lost, it is again possible to obtain the original message by sink.