Research On Localization Algorithms For Wireless Sensor Network Used OMNeT++Simulator

As a new technology of accessing and processing information, wireless sensornetworks can be used to sense and collect the information of various environmentand monitor object in the real time, and its range of application is very board. Thelocation information of nodes in wireless sensor networks is prime important to themonitoring activities of the sensor network, and accessing to the network nodelocation information is the basis of many applications.At present mangy algorithms, the node positioning accuracy is lower inlow-density network, which is affected easily by the change of the networktechnology, in addition, it cause great energy consumption in the node positioning.Considering the lack of above ways in node positioning, on the basis of DV-HOPalgorithm, the DV-HOP algorithm based on the select beacon nodes is proposed inthis paper, this algorithm adopt the mode of selecting the beacon nodes, using theproportion of node weights to calculate the average jump distance, while using astrategy in which we divided the selected beacons node into a number of groups,and it also use the method of trilateration to calculate the location of unknown node.Finally, average the calculated results.In order to reduce the expenses of the network communication and improvethe stability of the network, the algorithm based on node density is proposed in thispaper. According to the K-S formula estimated the per-hop spacing, using the ideaof selecting beacon nodes and weighted average to reduce the error of the algorithm.This algorithm only carried out a flooding broadcast, substantially reduce theexpense of network communication.Using OMNeT++simulation platform to simulate the two algorithms. Theresults of simulation shows that: These two algorithms reduce the accuracy of nodepositioning and the energy consumption of the network, improve the stability of thenetwork.