• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1014-1034
• /
• 2015

Location information of sensor nodes plays a critical role in many wireless sensor network (WSN) applications and protocols. Although many localization algorithms have been proposed in recent years, they usually target at dense networks and perform poorly in sparse networks. In this paper, we propose two component-based localization algorithms that can localize many more nodes in sparse networks than the state-of-the-art solution. We first develop the Basic Common nodes-based Localization Algorithm, namely BCLA, which uses both common nodes and measured distances between adjacent components to merge components. BCLA outperforms CALL, the state-of-the-art component-based localization algorithm that uses only distance measurements to merge components. In order to further improve the performance of BCLA, we further exploit the angular information among nodes to merge components, and propose the Component-based Localization with Angle and Distance information algorithm, namely CLAD. We prove the merging conditions for BCLA and CLAD, and evaluate their performance through extensive simulations. Simulations results show that, CLAD can locate more than 90 percent of nodes in a sparse network with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1463-1471
• /
• 2016

The indoor localization algorithm using the Difference Means based on Fingerprint (DMFPA) to improve the performance of indoor localization in moving Wi-Fi environment is proposed in this paper. In addition to this, the performance of the proposed algorithm is also compared with the Original Fingerprint Algorithm (OFPA) and the Gaussian Distribution Fingerprint Algorithm (GDFPA) by our developed indoor localization simulator. The performance metrics are defined as the accuracy of the average localization accuracy; the average/maximum cumulative distance of the occurred errors and the average measurement time in each reference point.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3571-3577
• /
• 2010

The estimated location coordinator exploration scheme and the E&E(Equivalent distance rate & Estimated location coordinator exploration) compensation algorithm for localization is proposed, and the performance of the E&E is analyzed in this paper. The proposed scheme is adapted to the AEDR(Algorithm for localization using the concept of Equivalent Distance Rate). From several experiments, it is confirmed that the performance of the localization compensation in SDS-TWR is improved from 0.60m to 0.34m in four experimental scenarios, and the performance of the localization compensation ratio of the E&E is also better than that of the AEDR as a level of maximum 15%. It can be thought that the proposed localization compensation algorithm E&E can be sufficiently applicable to various localization applications because the performance of the localization error rate of the E&E is measured as less than 1m in 99% of the total performance experiments.

• Advances in aircraft and spacecraft science
• /
• v.1 no.4
• /
• pp.455-469
• /
• 2014

High-precision autonomous localization technique is essential for future Mars rovers. This paper addresses an innovative integrated localization algorithm using a multiple information fusion approach. Firstly, the output of IMU is employed to construct the two-dimensional (2-D) dynamics equation of Mars rover. Secondly, radio beacon measurement and terrain image matching are considered as external measurements and included into the navigation filter to correct the inertial basis and drift. Then, extended Kalman filtering (EKF) algorithm is designed to estimate the position state of Mars rovers and suppress the measurement noise. Finally, the localization algorithm proposed in this paper is validated by computer simulation with different parameter sets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.10
• /
• pp.949-955
• /
• 2007

This paper proposes an efficient localization algorithm in the RFID sensor space for the precise localization of a mobile robot. The RFID sensor space consists of embedded sensors and a mobile robot. The embedded sensors, that is tags are holding the absolute position data and provide them to the robot which carries a reader and requests the absolute position fur localization. The reader, it is called as antenna usually, gets several tag data at the same time within its readable range. It takes time to read all the tags and to process the data to estimate the position, which is a major factor to deteriorate the localization accuracy. In this paper, an efficient algorithm to estimate the position and orientation of the mobile robot as quickly as possible has been proposed. Along with the algorithm, a new allocation of the tags in the RFID sensor space is also proposed to improve the localization accuracy. The proposed algorithms are demonstrated and verified through the real experiments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.641-648
• /
• 2009

Currently several kinds of sensor localization methods have been developed for terrestrial wireless sensor networks. This study, in order to extend the field to underwater environments, a localization technique is studied for UWSNs (Underwater Wireless Sensor Networks). In underwater environments, RF (Radio Frequency) signal is not suitable for underwater usage because of extremely limited propagation. Because of that reason UWSNs should be constituted with acoustic modems. But, to realize underwater application, we can borrow many design principles from ongoing research for terrestrial environments. So, in this paper we introduce the modified localization algorithm using ToA method which is based on the terrestrial research. First of all, we study the localization techniques for terrestrial environments where we investigate possible methods to underwater environment. And then the appropriate algorithm is presented in the underwater usage. Finally the proposed underwater based localization algorithm is evaluated by using computer.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.619-626
• /
• 2008

In this paper, we proposed a RSS based cooperative localization algorithm using VRN for wireless sensor networks, which can estimate the BN position. The proposed localization system monitoring all nodes estimates a position of BN, and calculates an intersection area with cooperative localization. From the results, we confirm that BN intersection area is reduced as the number of RN is increased. In addition, the fewer RN exists, the more iteration needs at least 4 times. Moreover, the propose algorithm using 4 RNs is improved 71.6% estimation performance than conventional method. Therefore, the cooperative localization algorithm with VRN provides higher localization accuracy than RSS based conventional method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1053-1056
• /
• 2009

In this paper, we proposed a RSS based cooperative localization algorithm using area reduction mehood for wireless sensor networks, which can estimate the BN position. The proposed localization system monitoring all nodes estimates a position of BN, and calculates an intersection area with cooperative localization. From the results, we confirm that BN intersection area is reduced as the number of RN is increased. Moreover, the propose algorithm using 4 RNs is improved estimation performance than conventional method. Therefore, the cooperative localization algorithm with area reduction mehood provides higher localization accuracy than RSS based conventional method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.6
• /
• pp.51-60
• /
• 2011

Researches on indoor localization using the wireless sensor network have been actively carried out to be used for indoor area where GPS signal is not received. Computationally efficient WCL(Weighted Centroid Localization) algorithm is shown to perform relatively well. However, to get the best performance for WCL all the anchor nodes must send signal with power to cover 96% of the network. The fact that outside the transmission range of the fixed nodes drastic localization error occurs results in large mean error and deviation. Due to these problems the WCL algorithm is not easily applied for use in the real indoor environment. In this paper we propose SRS(Succesive Region Setting) algorithm which sequentially reduces the estimated location area using the signal strength from the anchor nodes. The proposed algorithm does not show significant performance degradation corresponding to transmission range of the anchor nodes. Simulation results show that the proposed SRS algorithm has mean localization error 5 times lower than that of the WCL under free space propagation environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.2
• /
• pp.119-124
• /
• 2013

Recent increasing demand on the indoor localization requires more advanced and hybrid technology. This paper proposes an application of the hybrid indoor localization method based on a position-coded pattern that can be used with other existing indoor localization techniques such as vision, beacon, or landmark technique. To reduce the pattern-recognition error rate, the error detection and correction algorithm was applied based on Hamming code. The indoor localization experiments based on the proposed algorithm were performed by using a QCIF-grade CMOS sensor and a position-coded pattern with an area of $1.7{\times}1.7mm^2$. The experiments have shown that the position recognition error ratio was less than 0.9 % with 0.4 mm localization accuracy. The results suggest that the proposed method could be feasibly applied for the localization of the indoor mobile service robots.