Analysis On The Localization Technology Of Wireless Sensor Network And Routing Protocol

As a convenient and effective wireless network technology with short distance andlower-power dissipation, the WSN (Wireless Sensor Networks) has been studied byboth academic and industrial circles at present, and increasingly applied in a largenumber of fields including scientific research, disaster warning, environmentalmonitoring, battlefield surveillance, intelligent transportation, agricultural and industrialproduction and daily life. Among them, node localization and routing protocol, as thekey technologies of wireless sensor network, have been the important aspects of theresearch in the recent years.This thesis mainly consists of three parts:The first part of this paper focuses on the localization technology of wireless sensornetwork. It proposes an improved DV-HOP algorithm basing on the RSSI algorithm bycomparing and analysing the current classic localization algorithms. The newalgorithm retains the merits of distance measurement of RSSI and DV-HOP algorithm,including simple operation and low hardware requirements，and reduces the greatinfluence on the accuracy of DV-HOP algorithm exerted by distribution of unevennetwork nodes, and well achieves the combination of advantages of the two algorithms.The simulation indicates that the improved DV-HOP algorithm can effectively reduceerrors in distance measurement and localization.The second part focuses on the routing protocol of wireless sensor network. Firstand foremost, it elaborates the routing protocol of wireless sensor network, includingthe features, designing requirements, classification and major problems. Second, byconducting simulation, comparing and analyzing the three representative hierarchicalrouting protocols, it demonstrates that the EADEFG routing protocols has moreadvantages in cluster-structure and clusters-heads selectiveness, and in uniformity ofcluster-heads distribution. Using this algorithm, the network life will be longer while thebase stations are out of the supervised zone than those unimproved algorithm.The third part puts forward an improved routing protocol of EADEEG on the basisof clustering algorithm, aiming to optimize and balance energy comsuption and toehence the net robustness.The idea is as follows:1) the energy consumption is balancedby amending the choice probability of the root-cluster-head and stabilized performanceperiod of dynamic regulation;2) bringing forward a routing-tree algorithm based on thesmaller connected dominating set, making the routing path and topological structuremore reasonable and optimizing the total energy consumed by node;3) introducing theidea of dynamic cluster-radius, which allows the cluster-radius to change while thequantity of the survival node vary and reduces the probability of emerging of isolated node and the unconnected network shardings,and the robust of the internet getenhanced. The simulation demonstrates that the improved routing protocol of EADEEGcan better balance the energy consumption by each node and effectively prolong the lifecircle of the network.