The Research On Address-based Routing Algorithm For Wireless Sensor Network

Wireless Sensor Network (WSN) is a late-model non-infrastructure wireless network, which has been promoted by the integration of sensor, embedded computation, distributed information process and wireless communication techniques. It is a new information acquisition and processing technology. Due to the characteristic of large-scale, limited-energy, data-centric and dynamic changes in network topology, the design of wireless sensor network routing protocols are full of challenge. And how to design a reliable energy-efficient routing algorithm become a key point and the final target of the routing protocol design in WSN.Current WSN routing protocols can be divided into two types: Routing protocols of the first type can be widely used, but its pertinence is not high under certain circumstances, so it's necessary to study proper routing protocols under different circumstances. Protocols of the second type have been optimized to fit for special utilization which can prolong network lifetime and increase robustness.This thesis adopted the second type. The basic conception and the struction of the WSN as well as the applications are introduced in this thesis firstly, and then the targets of design for routing protocols are abstracted. We give the classification of the routing protocols for WSN and summarize the characteristic of routing protocols.To reduce energy loss, a gridding-based clustering routing algorithm is proposed in this thesis. On the basis of the classical LEACH algorithm, through the introduction of gridding-based clustering method and mechanism of selection and establishment of cluster-head, and according to the analysis to the minimum time of the stability working, the new algorithm takes into account both the choice of the cluster head's location and the size of the network. Then the new algorithm further optimizes the structure of the cluster, balances energy consumption and selects more reasonable cluster head which makes the life cycle of sensor networks has a large extension on the basis of in LEACH algorithm.And in order to improve the reliability of routing algorithm when the sensor node is failure, the multi-path routing algorithms are researched in this thesis. By studing on the braid multipath algorithm and backoff algorithm, a weight-based method is proposed, which called higher weight sub-path generation algorithm. By constructing sub-path and switch quickly to sub-path when the main-path malfunctions, the new algorithm improved the robustness of network and extended the survival time of sensor nodes.