The Research On Localization Algorithm And Security In Wireless Sensor Network

This paper analysts the node localization methods of the wireless sensor networkhave those problems generally that measuring accuracy influenced by externalenvironment, the complicated algorithms, high energy consumption, great consumptionof hardware power, and get a node localization algorithms method that smaller affectedby environment, lower algorithm complexity, and not expand additional hardware,which improves the safety performance of the algorithm. The main research is asfollows:1) According to the overall research and analysis of advantages and disadvantagesof the centroid algorithm and DV-Hop algorithm, what’s more, in order to make full useof their advantages, and avoid those disadvantage that accumulative errors brought bymultilevel jump, and lower positioning precision as well as the energy consumption, thispaper puts forward a comprehensive node localization algorithm CDLS, without ranging.The algorithm mixes the advantages of the centroid algorithm and DV-Hop algorithm, indifferent stages. Furthermore, it improves both algorithms.Through the simulationexperiment of Matlab, it shows that the algorithm can improve the location accuracy,lower the energy consumption, but extend the life cycle of network. Compared thoseerrors caused by different network as well as the energy consumption with the originalDV-Hop algorithm, the average accuracy of the algorithms’ node localization improves5%~7%.2) The paper analysis that the old node location algorithm is extremely easy toattack by internal and external network, what’s more, it introduces the common types ofthe worm holes attacks and the harms brought by them in the primitive DV-Hopalgorithm, furthermore, it analysis the safety of the DV-Hop algorithm and theperformance of the worm, which introduces a effective method to prevent the wormattack. This paper puts forward a security localization algorithm EPWDV-Hop, which isa kind of effective algorithm to prevent worm attack. The core of the algorithm is totesting the hops between the two nodes, by judging the number of the hops to make surewhether a worm hole attacks between two nodes. When there is a worm holes attack,using the best hops to replace the attacked hops, then calculated the best averagereasonable hops. According to the Matlab simulation experiment, it proves that the algorithm doesn’t need other external hardware support. It just need to add an additionalsmall amount of cost at the first of the algorithm, which can helps to prevent the wormhole attack effectively.