Research On Location Mechanism Based On Mobile Anchor Node

As an important research area of information technology in new century, involves multiple disciplines, including microelectronics, wireless communications, and wireless network. Wireless sensor networks play an increasingly significant role in the military, industry and people’s daily life. As a key technology of the wireless sensor networks, wireless positioning technologies is using to position sensor nodes, in order to position the events monitored by the sensor nodes. This paper proposes effective positioning mechanism for reducing the positioning costs and improving positioning accuracy based on a single mobile anchor node.For the positioning based on a single anchor node, choosing the moving path planning mechanism is a problem existing in process where the anchor node covering nodes. The anchor node’s path planning mechanism can be divided into two categories, namely static path planning mechanism and dynamic path planning mechanism. For the shortcomings of the static path planning mechanism, this paper select the dynamic path planning mechanism and research direction, and introduce a fixed step size mechanism based on previous proposed mechanism, the tabu search path planning mechanism. The results show that, in case of a sufficiently large node density, using the new mechanism can always find the right step size to make the anchor node move a shorter distance. This paper also proposes a new path planning mechanism, which combines the tabu search mechanism and clustering mechanism, in order to make the beacons stay closer to the nodes while the anchor node is moving. The simulation results show that this method shortens the distance between the nodes and their closet anchor beacons. After the anchor node finishes initial coverage of the nodes, traversing the beacons, which have been traversed by the anchor node, can be likened to the traveling sales problem. This paper proposes three path optimization mechanisms using tabu search algorithm. Compared to the path before optimized, in different circumstances, the optimized path applied the three methods shorten the moving distance of the anchor node.Finally, in the case of localization based on a single anchor node, the paper proposes a new localization method, which combines the RSSI-based ranging and AOA method. Comparing with the weighted centered localization algorithm based on RSSI and DV-HOP algorithm, the positioning accuracy and the number of positioned nodes are higher.