Research On Power-Saving Routing Algorithm For Wireless Sensor Network

Wireless sensor network can be defined as a multi-hop and autonomous network system consisting of a collective of sensor nodes designed to intercommunicate via wireless radio. It can acquire and process information, and transfer information to the terminal users. Wireless sensor network has comprehensive application prospect in many fields, such as military, environmental monitoring, agriculture, health care, space exploration, industry, civilian and home networks.Being limited by the application environments, wireless sensor networks which use wireless communication technology are different from traditional networks because the battery being used can not be recharged. Therefore, making full use of energy efficiently and prolonging life time becomes the main issue of sensor networking designing.The article introduces simply the concept,system structure,characteristic and application prospect of wireless sensor network, and researches the power-saving technology used in the wireless sensor network, and summarizes,analyzes and compares typical power-saving routing algorithm for wireless sensor network.Hierarchical routing is the research hotspot in routing algorithm for wireless sensor network. LEACH (Low Energy Adaptive Clustering Hierarchy, LEACH) is one of the most typical routing algorithm which causes the appearance of many hierarchical routing. So the article raises a new routing algorithm based on LEACH algorithm by analysis of LEACH algorithm and other algorithms.The clusters are built after cluster-heads are selected in LEACH algorithm, so cluster-heads spend more energy; the periodic establish of clusters and selection of cluster-heads need cost the extra expenses; the distribution of the clusters is unreasonable because of the random choice of cluster-heads. The article improved on LEACH algorithm in three ways. The improved algorithm uses the stationary cluster; the shape of the cluster is unequal, the radius of the cluster that is far away from the Sink node is smaller than the radius of the cluster that is close to the Sink node; the cluster-heads will are selected according to the present energy of the nodes. The new routing algorithm is named B-LEACH (Based on Low Energy Adaptive Clustering Hierarchy, B-LEACH).B-LEACH algorithm can utilize the energy of the sensor nodes and prolong the lifetime of the whole network. Finally, the article introduces the simulation software NS2(Network Simulator version 2) and the process of the simulation, and realizes the simulation of LEACH algorithm,LEACH-C(LEACH-centralized) algorithm and B-LEACH algorithm in 50m×50m and 100m×100m network, and analyzes detailedly the simulation result in three ways: the network lifetime,the number of data signals received at the sink node and the energy dissipated in the network. The simulation studies show, B-LEACH algorithm performs better than LEACH algorithm and LEACH-C algorithm in the index of the network lifetime,the number of data signals received at the sink node and the energy dissipated.