• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.1
• /
• pp.1-9
• /
• 2016

Range-based wireless localization system must measure accurate range between a mobile node (MN) and reference nodes. However, non-line-of-sight (NLOS) error caused by the spatial structures disturbs the localization system obtaining the accurate range measurements. Localization methods using the range measurements including NLOS error yield large localization error. But filter-based localization methods can provide comparatively accurate location solution. Motivated by the accuracy of the filter-based localization method, a filter residual-based NLOS error estimation method is presented in this paper. Range measurement-based residual contains NLOS error. By considering this factor with NLOS error properties, NLOS error is mitigated. Also a process noise covariance matrix tuning method is presented to reduce the time-delay estimation error caused by the single dynamic model-based filter when the speed or moving direction of a MN changes, that is the used dynamic model is not fit the current dynamic of a MN. The presented methods are evaluated by simulation allowing direct comparison between different localization methods. The simulation results show that the presented filter is more accurate than the iterative least squares- and extended Kalman filter-based localization methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3889-3903
• /
• 2017

Fast and accurate localization of randomly deployed nodes is required by many applications in wireless sensor networks (WSNs). However, mobile nodes localization in WSNs is more difficult than static nodes localization since the nodes mobility brings more data. In this paper, we propose a Range-based Monte Carlo Box (RMCB) algorithm, which builds upon the Monte Carlo Localization Boxed (MCB) algorithm to improve the localization accuracy. This algorithm utilizes Received Signal Strength Indication (RSSI) ranging technique to build a sample box and adds a preset error coefficient in sampling and filtering phase to increase the success rate of sampling and accuracy of valid samples. Moreover, simplified Particle Swarm Optimization (sPSO) algorithm is introduced to generate new samples and avoid constantly repeated sampling and filtering process. Simulation results denote that our proposed RMCB algorithm can reduce the location error by 24%, 14% and 14% on average compared to MCB, Range-based Monte Carlo Localization (RMCL) and RSSI Motion Prediction MCB (RMMCB) algorithm respectively and are suitable for high precision required positioning scenes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.829-832
• /
• 2010

Wireless Sensor Networks have been proposed for several location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point to point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we proposed a modified DV-Hop (range-free localization) algorithm which reduces node's location error and cumulated distance error by minimizing localization error. Simulation results have verified the high estimation accuracy with our approach which outperforms the classical DV-Hop.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2627-2647
• /
• 2022

The easy scalability and low cost of range-free localization algorithms have led to their wide attention and application in node localization of wireless sensor networks. However, the existing range-free localization algorithms still have problems, such as large cumulative errors and poor localization performance. To solve these problems, an incremental strategy-based residual regression network is proposed for node localization in wireless sensor networks. The algorithm predicts the coordinates of the nodes to be solved by building a deep learning model and fine-tunes the prediction results by regression based on the intersection of the communication range between the predicted and real coordinates and the loss function, which improves the localization performance of the algorithm. Moreover, a correction scheme is proposed to correct the augmented data in the incremental strategy, which reduces the cumulative error generated during the algorithm localization. The analysis through simulation experiments demonstrates that our proposed algorithm has strong robustness and has obvious advantages in localization performance compared with other algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.8
• /
• pp.845-850
• /
• 2009

Localization which estimates a robot's position and orientation in a given environment is very important for mobile robot navigation. Although low-cost sensors are preferred for practical service robots, they suffer from the inaccurate and insufficient range information. This paper proposes a novel approach to increasing the success rate of low-cost sensor-based localization. In this paper, both the previous and the current data obtained from the IR sensors are used for localization in order to utilize as much environment information as possible without increasing the number of sensors. The sensor model used in the monte carlo localization (MCL) is modified so that the accumulated range information may be used to increase the accuracy in estimating the current robot pose. The experimental results show that the proposed method can robustly estimate the robot's pose in indoor environments with several similar places.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.633-639
• /
• 2013

Several estimation methods used in the range measurement based wireless localization area have individual problems. These problems may not occur according to certain application areas. However, these problems may give rise to serious problems in particular applications. In this paper, three methods, ILS (Iterative Least Squares), DS (Direct Solution), and DSRM (Difference of Squared Range Measurements) methods are considered. Problems that can occur in these methods are defined and a simple hybrid solution is presented to solve them. The ILS method is the most frequently used method in wireless localization and has local minimum problems and a large computational burden compared with closed-form solutions. The DS method requires less processing time than the ILS method. However, a solution for this method may include a complex number caused by the relations between the location of reference nodes and range measurement errors. In the near-field region of the complex solution, large estimation errors occur. In the DSRM method, large measurement errors occur when the mobile node is far from the reference nodes due to the combination of range measurement error and range data. This creates the problem of large localization errors. In this paper, these problems are defined and a hybrid localization method is presented to avoid them by integrating the DS and DSRM methods. The defined problems are confirmed and the performance of the presented method is verified by a Monte-Carlo simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.420-427
• /
• 2010

This paper describes a localization method based on Monte Carlo Localization approach for a mobile robot. The method uses range data which are measured from ultrasound transmitting beacons whose locations are given a priori. The ultrasound receiver on-board a robot detects the range from the beacons. The method requires several beacons, theoretically over three. The method proposes a sensor model for the range sensing based on statistical analysis of the sensor output. The experiment uses commercialized beacons and detector which are used for trilateration localization. The performance of the proposed method is verified through real implementation. Especially, it is shown that the performance of the localization degrades as the sensor update rate decreases compared with the MCL algorithm update rate. Though the method requires exact location of the beacons, it doesn't require geometrical map information of the environment. Also, it is applicable to estimation of the location of both the beacons and robot simultaneously.

• The Journal of Korea Robotics Society
• /
• v.9 no.2
• /
• pp.117-123
• /
• 2014

Localization is one of the essential tasks necessary to achieve autonomous navigation of a mobile robot. One such localization technique, Monte Carlo Localization (MCL) is often applied to a digital surface model. However, there are differences between range data from laser rangefinders and the data predicted using a map. In this study, commonly observed from air and ground (COAG) features and candidate selection based on the shape of sensor data are incorporated to improve localization accuracy. COAG features are used to classify points consistent with both the range sensor data and the predicted data, and the sample candidates are classified according to their shape constructed from sensor data. Comparisons of local tracking and global localization accuracy show the improved accuracy of the proposed method over conventional methods.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.429-437
• /
• 2005

Sensor localization has become an essential requirement for realistic applications over wireless sensor networks (WSN). In this paper we propose an ad hoc localization algorithm that is infrastructure-free, anchor-free, and computationally efficient with reduced communication. A novel combination of distance and direction estimation technique is introduced to detect and estimate ranges between neighbors. Using this information we construct unidirectional coordinate systems to avoid the reflection ambiguity. We then compute node positions using a transformation matrix [T], which reduces the computational complexity of the localization algorithm while computing positions relative to the fixed coordinate system. Simulation results have shown that at a node degree of 9 we get $90\%$ localization with $20\%$ average localization error without using any error refining schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.643-650
• /
• 2014

Recently, the wireless communication applications are studied in various environment by the development of short range communication system like wireless sensor networks. This paper presents the analysis of localization schemes for ship application using received signal strength. The localization schemes using received signal strength from wireless networks are classified under two methods, which are Range based method and Range free method. Range based methods estimate the location with least square estimation based on estimated distance using path-loss model. Range free methods estimated the location with the information of anchor nodes linked to target. Simulation results show the appropriate localization scheme for each cabin environments based on the empirical path-loss model in warship's internal space.