| Summary: | In order to solve the problem that the DV-Hop localization algorithm has large errors in the wireless sensor network environment, this paper uses the minimum mean square criterion to determine the average hop distance of anchor nodes, and then calculates the mean value of the original average hop distance, which ensures that the improved average hop distance is closer to the real average hop distance of the whole network. The estimated distances between nodes are calculated by using the correction value corresponding to the average jump distance of the anchor node; in the positioning stage, when the anchor node is small, the estimated coordinates of unknown nodes are obtained by the minimum-maximum method; when the number of anchor nodes is large, the coordinates of unknown nodes are calculated by the maximum likelihood estimation method; this not only reduces the amount of calculation, but also the accuracy is more stable. This step is not only suitable for DV-Hop algorithm, but also can be used to estimate the coordinates when the distance between the unknown node and the anchor node is known. However, this improved method is only applicable to the premise that the simulation area is not large, so this improvement has its scope of adaptation, according to the needs of choice. Finally, the unknown node coordinates are iteratively optimized by using the quasi Newton method. Simulation results show that the proposed positioning algorithm has higher accuracy and better stability.
|
|---|
