Journal of Jilin University Science Edition ›› 2018, Vol. 56 ›› Issue (6): 1488-1494.

Previous Articles     Next Articles

A Localization Algorithm Based on Convex Optimizationfor WSN Obstacle Environment #br#

CHENG Chao, LI Meng, WANG Jiuhe, CHEN Bilong   

  1. School of Computer Science and Engineering, Changchun University of Technology, Changchun 130012, China
  • Received:2017-08-09 Online:2018-11-26 Published:2018-11-26

Abstract: Aiming at the problems of low positioning accuracy of traditional DVhop algorithm and node positioning failure caused by objects blocking information dissemination in the positioning environment, we proposed an improved highprecision localization algorithm suitable for obstacle environment. Firstly, the algorithm introduced an error correction value that took into account the minimum number of hops of the positioning node. Through this parameter value, the anchor nodes participating in the positioning were screened, and then the average hop distance of the anchor nodes was optimized. Secondly, the distance between the unknown node and the anchor node was calculated by using the trigonometric function combined with the accurate distance between the two anchor nodes. Finally, through the convex optimization calculation of the location of unknown nodes, the data transmission between nodes had the optimal path, optimized the positioning process and improved the positioning accuracy. Simulation results show that the improved algorithm not only solves the problem of difficult localization in the obstacle environment of wireless sensor networks, but also effectively improves the positioning accuracy of unknown nodes.

Key words: wireless sensor network (WSN), localization, obstacle, trigonometric function, convex optimization, error correction

CLC Number: 

  • TP212.9