Research On Localization Algorithm Based On Local Optimization Techniques For Wireless Sensor Networks

Wireless sensor networks(WSN)as an emerging technology,as well as highly multidisciplinary cross and the frontiers of knowledge integration make it infinitely broad application prospects.Wireless sensor networks are usually deployed in the monitoring area inside or around a large number of sensor nodes,the nodes having a certain amount of storage,calculation,processing capability,and are formed network through self-organized.It is because of its network for rapid deployment,self-organization and fault tolerance features,wireless sensor network can obtain objective physical information.So it is widely applied in the fields of national defense,industry and agriculture automation,urban management,environmental monitoring,bio-medical,disaster relief,remote control and operating in hazardous areas etc.With the advancement of technology development and extensive research on sensor networks,wireless sensor networks will bring great changes to our lives.The actual use of various sensor networks show that the location information of events is one of the things sensor networks are most concerned about.Location information is essential for testing activities,it is important to detect the information contained in the message said.If the monitor message does not have the location information,the message will be meaningless.So the location technology development has huge impact on the application of the WSN.Sensor node localization is the basis for the entire wireless sensor networks.Since the sensor node energy is limited,so consider the positioning error,we must also consider the cost of communication and complexity of algorithms.DV-HOP localization algorithm is a typical distance-free localization algorithm,based on the lower communication cost and complexity of the algorithm can get good positioning accuracy.But the original location algorithm positioning error is relatively large.This article summarizes the main reason for the error and analyzed for the number of beacon nodes and the average hop distance is optimized: First,to optimize the number of beacon nodes,the concept of the average number of hops,an unknown optimization at each node localization the number of beacon nodes,thereby improving the positioning accuracy;secondly to optimize the average jump distance,this paper proposes two average jump distance optimization algorithm and gives a detailed implementation process,one is by taking the average of the jump distance,another optimization is done by weighting.By optimizing the average hop distance is further optimized beacon nodes involved in the calculation.By the Mat-lab simulation results show that the new proposed location algorithm compared with the traditional location algorithm,has a high positioning accuracy.