Research On Routing Protocols Of Wireless Sensor Networks

Since micro-electronics, computer and wireless communication made progress, wireless sensor network has got rapid development and become the focus of Information Technology field. Because of the restrictions on self conditions and deployment environment, it puts forward high demands for energy utility efficiency, network lifetime, fault-tolerant and expansibility.Routing protocol is the pivotal research subject in network layer of wireless sensor network. This paper classifies routing protocols into different classes by the network structure and the protocol operation. Then it analyze representative protocols on operation process and application scope, which is the foundation of the further research.In general, routing in wireless sensor network can be divided into flat-based routing, hierarchical-based routing, and location-based routing, depending on the network structure. LEACH and LEACH-C are typical hierarchical protocol which is the foundation of most hierarchical protocols. After analyzing the two protocols on theory, implementation, advantages and disadvantages, this paper proposes a new protocol ~ Hybrid Clustering Routing Protocol (HCRP). HCRP makes base station decide cluster-head (CH) nodes in first round. After that, it asks CH nodes to choose non-cluster-head (NCH) nodes to be CH next round. HCRP is better than the classical clustering algorithm LEACH. Also it makes improvements in fault-tolerant and haleness, compared with LEACH-C.Sensor nodes always break down due to hardware failure and disturb from outer environment. The existing fault-tolerant routing protocol CRAM employs multiple cluster-head nodes by turns to achieve the aim of fault tolerance. This paper proposes a protocol ~ Adaptive Clustering Routing Based on Handshake (ACRBOH) for Wireless Sensor Networks. Firstly, this protocol builds up clusters with the same method as LEACH. Then the new protocol employs a handshake mechanism to detect the states of CH nodes and NCH nodes. Once a CH node fails, NCH nodes will go to sleep during the remaining slots. On the contrary, the slot time of dead NCH nodes would be allocated equally to adjacent alive NCH nodes on DASE (Divide Adjacent Slots Equally) mechanism so as to increase the outgoing data. Compared with existing fault-tolerant protocols, this protocol is simple, efficient and easy to implement. At the same time, this paper shows another two implement methods of this protocol - Equal Frame Changed Slot (EFCS) and UnEqual Frame Unchanged Slot (UFUS). Simulation results show that, when the failure ratio of nodes exceed...