Abstract
In wireless sensor networks, accurate location information is important for precise tracking of targets. In order to satisfy hardware installation cost and localization accuracy requirements, a weighted centroid localization (WCL) algorithm, which is considered a promising localization algorithm, was introduced. In our previous research, we proposed a test node-based WCL algorithm using a distance boundary to improve the localization accuracy in the corner and side areas. The proposed algorithm estimates the target location by averaging the test node locations that exactly match with the number of anchor nodes in the distribution map. However, since the received signal strength has large variability in real channel conditions, the number of anchor nodes is not exactly matched and the localization accuracy may deteriorate. Thus, we propose an intersection threshold to compensate for the localization accuracy in this paper. The simulation results show that the proposed test node-based WCL algorithm provides higher-precision location information than the conventional WCL algorithm in entire areas, with a reduced number of physical anchor nodes. Moreover, we show that the localization accuracy is improved by using the intersection threshold when considering small-scale fading channel conditions.
Highlights
Wireless sensor networks (WSNs) have been rapidly developed, and show promise for a variety of applications in next-generation networks
In order to evaluate the localization accuracy of the proposed T-weighted centroid localization (WCL) algorithm according to the distance boundary dm and the number of anchor nodes, we performed the simulations using MATLAB
We calculated the mean distance error (MDE) which is the average distance between the actual location L p of unknown nodes and their b p to evaluate the localization accuracy for each WCL algorithm
Summary
Wireless sensor networks (WSNs) have been rapidly developed, and show promise for a variety of applications in next-generation networks. In [12], the authors proposed a novel algorithm with the small extra logical overhead which used the shortest-hop path scheme to upgrade the virtual anchor nodes, whereas the number of physical anchor nodes was kept the same This algorithm was studied in another range-free localization method: the DV-hop. Since the RSS has large variability due to the degrading effects of reflection, shadowing, and fading in indoor wireless channel environments [15], the test node-based WCL (T-WCL) algorithm may reduce the localization accuracy because the numbers of anchor nodes in the distance boundary of the unknown node and in the test nodes are mismatched.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
