Open AccessResearch on Node localization Algorithm in WSN Based on TDOA
Author(s) -
Zhao Qiao-mei,
Yun Cheng,
Tong Zhou
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1757/1/012142
Subject(s) - non line of sight propagation , multilateration , computer science , node (physics) , algorithm , wireless sensor network , computation , taylor series , focus (optics) , channel (broadcasting) , position (finance) , line (geometry) , real time computing , wireless , computer network , mathematics , telecommunications , engineering , mathematical analysis , physics , geometry , structural engineering , optics , finance , economics
Many applications of wireless sensor networks (WSN) require nodes to know their location information. Monitoring data without node location information is meaningless in many situations. Since the node positioning efficiency of WSN directly affects the performance of the network, designing an efficient positioning algorithm is the focus of WSN research. Based on the principle of TDOA positioning in WSN, it studies two main positioning algorithms: Chan and Taylor algorithm. Meanwhile the least square (LS) method is used to provide the initial position for Taylor algorithm and the first calculation result for Chan algorithm. Simulation results under different conditions show that the Chan algorithm has a good positioning accuracy and less computation than that of Taylor algorithm in the line of sight (LOS) environment. However, under the actual channel, due to the influence of No Line of Sight (NLOS), the positioning accuracy of Taylor algorithm is better than that of Chan algorithm, but its computation is large.