Related Experiment Video
Updated: Feb 5, 2026

Construction of a Wireless-Enabled Endoscopically Implantable Sensor for pH Monitoring with Zero-Bias Schottky Diode-based Receiver
Published on: August 27, 2021
NLOS Identification and Positioning Algorithm Based on Localization Residual in Wireless Sensor Networks
Jingyu Hua1, Yejia Yin2, Weidang Lu3
1Zhejiang Gongshang University, Hangzhou 310018, China. eehjy@163.com.
Abstract:
The problem of target localization in WSN (wireless sensor network) has received much attention in recent years. However, the performance of traditional localization algorithms will drastically degrade in the non-line of sight (NLOS) environment. Moreover, variable methods have been presented to address this issue, such as the optimization-based method and the NLOS modeling method. The former produces a higher complexity and the latter is sensitive to the propagating environment. Therefore, this paper puts forward a simple NLOS identification and localization algorithm based on the residual analysis, where at least two line-of-sight (LOS) propagating anchor nodes (AN) are required. First, all ANs are grouped into several subgroups, and each subgroup can get intermediate position estimates of target node through traditional localization algorithms. Then, the AN with an NLOS propagation, namely NLOS-AN, can be identified by the threshold based hypothesis test, where the test variable, i.e., the localization residual, is computed according to the intermediate position estimations. Finally, the position of target node can be estimated by only using ANs under line of sight (LOS) propagations. Simulation results show that the proposed algorithm can successfully identify the NLOS-AN, by which the following localization produces high accuracy so long as there are no less than two LOS-ANs.
Related Concept Videos
Residual Plots
When the residual values are plotted against the variable x, it is called a residual...
Residual Stresses
Position of Equilibrium in Acid-Base Reactions
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Trial and Error and Algorithm
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...

