• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.253-270
• /
• 2013

To achieve accurate localization information, complex algorithms that have high computational complexity are usually implemented. In addition, many of these algorithms have been developed to overcome several limitations, e.g., obstruction interference in multi-path and non-line-of-sight (NLOS) environments. However, localization systems those have complex design experience latency when operating multiple mobile nodes occupying various channels and try to compensate for inaccurate distance values. To operate multiple mobile nodes concurrently, we propose a localization system with both low complexity and high accuracy and that is based on a chirp spread spectrum (CSS) radio. The proposed localization system is composed of accurate ranging values that are analyzed by simple linear regression that utilizes a Big-$O(n^2)$ of only a few data points and an algorithm with a self-calibration feature. The performance of the proposed localization system is verified by means of actual experiments. The results show a mean error of about 1 m and multiple mobile node operation in a $100{\times}35m^2$ environment under NLOS condition.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.574-592
• /
• 2016

Range-free localization algorithm computes a normal node's position by estimating the distance to anchors which know their actual position. In recent years, reliable anchor selection research has been gained a lot of attention because this approach improves localization accuracy by selecting the only subset of anchors called reliable anchor. The distance estimation accuracy and the geometric shape formed by anchors are the two important factors which need to be considered when selecting the reliable anchors. In this paper, we study the relationship between a relative position of three anchors and localization error. From this study, under ideal condition, which is with zero localization error, we find two conditions for anchor selection, thereby proposing a novel anchor selection algorithm that selects three anchors matched most closely to the two conditions, and the validities of the conditions are proved using two theorems. By further employing the conditions, we finally propose a novel range-free localization algorithm. Simulation results show that the proposed algorithm shows considerably improved performance as compared to other existing works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.65-75
• /
• 2009

In Wireless Sensor Network, the sensor node localization is important issue for information tracking, event detection, routing. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning system, then all the other nodes are approximately localized using various algorithms based on a coordinate system of anchor DV-Hop is a localized, distributed, hop by hop positioning algorithm in wireless sensor network where only a limited fraction of nodes have self positioning capability. However, instead of uniformly distributed network, in anisotropic network with possible holes, DV-Hop's performance is very low. To address this issue, we propose Group based DV-Hop (GDV-Hop) algorithm. Best contribution of GDV-Hop is that it performs localization with reduced error compared with DV-Hop in anisotropic network.

• Korean Journal of Remote Sensing
• /
• v.23 no.5
• /
• pp.465-471
• /
• 2007

Many hospitals have been considering new technology such as wireless sensor network(WSN). The technology can be used to track the location of medical devices needed for inspections or repairs, and it can also be used to detect of a theft of an asset. In an asset-tracking system using WSN, acquiring the location of moving sensor nodes inherently introduces uncertainty in location determination. In fact, the sensor nodes attached to an asset are prone to failure from lack of energy or from physical destruction. Therefore, even if the asset is located within the predetermined area, the asset-tracking application could "misunderstand" that an asset has escaped from the area. This paper classifies the causes of such unexpected situations into the following five cases: 1) an asset has actually escaped from a predetermined area; 2) a sensor node was broken; 3) the battery for the sensor node was totally discharged; 4) an asset went into a shadow area; 5) a sensor node was stolen. We implemented and installed our asset-tracking system in a hospital and continuously monitored the status of assets such as ventilators, syringe pumps, wheel chairs and IV poles. Based on this real experience, we suggest how to differentiate each case of location uncertainty and propose possible solutions to prevent them.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.1059-1066
• /
• 2011

This paper makes a close inquiry into ill-conditioning that may be occurred in wireless localization of the sensor nodes based on network signals in the wireless sensor network and provides the clue for solving the problem. In order to estimate the location of a node based on the range information calculated using the signal propagation time, LS (Least Squares) method is usually used. The LS method estimates the solution that makes the squared estimation error minimal. When a nonlinear function is used for the wireless localization, ILS (Iterative Least Squares) method is used. The ILS method process the LS method iteratively after linearizing the nonlinear function at the initial nominal point. This method, however, has a problem that the final solution may converge into a LM (Local Minimum) instead of a GM (Global Minimum) according to the deployment of the fixed nodes and the initial nominal point. The conditions that cause the problem are explained and an adaptive method is presented to solve it, in this paper. It can be expected that the stable location solution can be provided in implementation of the wireless localization methods based on the results of this paper.

• Convergence Security Journal
• /
• v.10 no.2
• /
• pp.11-17
• /
• 2010

Recent technological advances allow us to envision a future where large numbers of low-power, inexpensive sensor devices are densely embedded in the physical environment, operating together in a wireless network. This paper considers localization for mobile sensors; localization must be invoked periodically to enable the sensors to track their location. Localizing more frequently allows the sensors to more accurately track their location in the presence of mobility. In this paper, we test and analyze the accuracy of a moving node localization by Received Signal Strength (RSS).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.889-900
• /
• 2012

In wireless sensor networks, the positioning scheme using received signal strength (RSS) has been widely considered. Appropriate estimation of path-loss exponent (PLE) between a sensor node and an anchor node plays a key role in reducing position error in this RSS-based positioning scheme. In the conventional researches, a sensor node directly uses the PLEs measured by its nearest anchor node to calculate its position. However, the actual PLE between a sensor node and the anchor node can be different from the PLE measured by its nearest anchor node. Thus, if a sensor node directly uses the PLEs measured by its nearest anchor node, the estimated position is different from the actual position of the sensor node with a high probability. In this paper, we describe the method how a sensor node estimates PLEs from the anchor nodes of interest by itself and calculates its position based on these self-estimated PLEs. Especially, our proposal suggests the mechanism to iteratively calculate the PLEs depending on the estimated distances between a sensor node and anchor nodes. Based on the recalculated PLEs, the sensor node reproduces its position. Through simulations, we show that our proposed positioning scheme outperforms the traditional scheme in terms of position error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.3
• /
• pp.318-326
• /
• 2013

In this paper, a novel WUSB (Wireless USB) over WBAN (Wireless Body Area Networks) MAC protocol is proposed to improve efficiency of sensing the personal information. Furthermore, a localization technique based on that protocol is also proposed for indoor localization in a ship. For this purpose, the proposed localization algorithm minimizes power consumption and estimates location with accuracy. It is executed independently at each sensor node on the basis of WUSB over WBAN protocol. And it minimizes power consumption by estimating locations of sensor nodes without GPS (Global Positioning Systems).

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.