Investigation On Wsan Routing Protocols Based On Low-Energy Adaptive Clustering Hierarchy

Wireless Sensor Actor network, which is low-cost, easily deployed, informative and prompt, sensitive, etc, has been increasingly applied in agriculture, military, industrial and other fields. A reliable routing algorithm of high-efficiency is a key factor for stable data transmission, highly efficient decision-making and quick response between networks in these applications. Rignt now, it is hot issue in current study in Wireless Sensor Actor network. The thesis mainly focuses on the EACBR protocol which is based on clustering protocol and makes improvement.The network EACBR protocol of WSAN is of a main characteristic, which forms several independent sub-network with the cluster head of Actor node:When establishing network, Actor node will create a routing table with shortest path which connects cluster head with all the nodes within the sub-network; Actor node passes routing messages to each Sensor node over the radio; When there is a data packet to be sent within each sub-network, the data transmission to Actor shall be carried out through the shortest path which is based on the routing information over the radio; Actor will analyze the received data for the next decision making about response.In thesis, thesis based on the clustering algorithm of the EACBR protocol, the classic routing algorithm LEACH is simulatedand the optimum number of the cluster heads is derived from the total energy consumed.In LEACH protocol, if taking into account the elected cluster-head positionwith random and uneven distribution, it will cause too much communication load between the cluster head node energy consumption. Based on the coverage area of the cluster head, a algorithm of the cluster head distance of specific restrictions is proposed, and then verified by simulation. We obtain the cluster distance under the best probability of clustering.In EACBR protocol, the data transfer after the formation of sub-networks is carried out through the shortest path. The theis analyzes and compares the mul-hop shortest path EACBR protocol in the data transfer mode and LEACH’s single-hop mode, and simulation.In view of the hierarchical nature of the network, we analyze and compare the energy consumption of double-layer EACBR protocol model and the three-layer network model. Simulation results show that three-layer network architecture is slightly larger compared to the energy consumption of two-layer network, but with a good performance in stability.In the last part of the theis, the clustering process of EACBR protocol is improved in three aspects which are probability derivation of clustering head formed in the clustering process, the distance between the selected clustering heads and data transmission between the shortest path within sub-network. The double-layer network model of EACBR protocol is improved up to a three-layer network model with the three-layer network model.In the pthesis, it is proved that more WSAN nodes have survived and the total energy consumption of network has reduced when the clustering process and network structure of EACBR is improved. The result meets the expected goal of the thesis.