Study On The Centroid Localization Algorithm Based On Polygon Decomposition

Wireless sensor network is one of the hottest research fields in contemporary,it is composed of many disciplines and combines the fast development. It iswidely used in various fields, and provides great convenience to our life, butalso changed the way we live. At present there are many research institutionsin the wireless sensor network research, there have been a lot of productsavailable. A lot of people will expand its development as the Internet, to theInternet as a channel of communication, to other things, remain within doors, itcan control the distant things.Wireless sensor networks are often used a large number of layout, amonitoring network is composed of many small nodes of the monitoring. Thesenodes coordinate with each other, work together to accomplish a task. Position isessential for sensor networks, we regardless of the sensor network to completewhat is inseparable from the position coordinates of sensor nodes. We cannot increase the GPS module for each sensor node, because the cost isunbearable, so according to coordinate limited and other information toachieve all of the node localization is very important, it is also a greatchallenge for wireless sensor network applications.Many of the current positioning method, is mainly divided into two typesaccording to whether the location: Location Algorithm and range freelocalization algorithm. The former is mainly composed of RSSI locationalgorithm and location algorithm based on time difference and so on. Thelatter is the centroid localization algorithm, APIT algorithm and so on. Theformer is used, the higher requirement to the hardware, we usually use rangefree localization algorithm. This paper first of the wireless sensor network and positioning algorithmare introduced, and then analyzed the advantages of each algorithm, the reasonsfor the existence of the positioning error. High positioning accuracy such asAPIT positioning algorithm is better than the positioning algorithm, comparethe two algorithms are easy to find, it divides the unknown node’s area by manytriangles, and then one by one test which triangle is limited, the overlap area ofthese triangles as the coordinates of the unknown nodes, to determine the finaldue to coincidence the area is generally small, so the location error is relativelysmall, relatively high accuracy. The centroid localization algorithm basedon location area is larger, the positioning error is large. Analysis of theadvantages and disadvantages of the algorithm, the transplantation method,advantages of APIT algorithm and RSSI value of the advantages of theimproved localization algorithm based on combined together, a new algorithm isproposed. The algorithm first narrow are alocation, and then weightedlocalization. The improved algorithm is better than the existing.Finally, the simulation experiment of the improved algorithm to verify thealgorithm performance is the same with the theoretical analysis, and comparedwith the existing algorithm, the new algorithm is superior to verify the improvedalgorithm. Simulation results show the new algorithm achieves the expectedobjective.