• Progress in Superconductivity
• /
• v.5 no.2
• /
• pp.98-104
• /
• 2004

We analyzed a noise-sensitivity profile of a specific SQUID sensor system for the localization of brain activity. The location of a neuromagnetic current source is estimated from the recording of spatially distributed SQUID sensors. According to the specific arrangement of the sensors, each site in the source space has different sensitivity, that is, the difference in the lead field vectors. Conversely, channel noises on each sensor will give a different amount of the estimation error to each of the source sites. e.g., a distant source site from the sensor system has a small lead-field vector in magnitude and low sensitivity. However, when we solve the inverse problem from the recorded sensor data, we use the inverse of the lead-field vector that is rather large, which results in an overestimated noise power on the site. Especially, the spatial sensitivity profile of a gradiometer system measuring tangential fields is much more complex than a radial magnetometer system. This is one of the causes to make the solutions of inverse problems unstable on intervening of the sensor noise. In this study, in order to improve the localization accuracy, we calculated the noise-sensitivity profile of our 40-channel planar SQUID gradiometer system, and applied it as a normalization weight factor to the source localization using synthetic aperture magnetometry.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.91-100
• /
• 2009

Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose IAL, the localization technique with interference avoidance for multiple mobile nodes in mobile wireless sensor networks. In IAL, interference is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we define LIP packet type for localization initiation by mobile node and LGP packet type for localization grant by anchor node. LRP packet type is used to reject localization by anchor node for interference avoidance. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and IAL provides efficient localization.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.255-256
• /
• 2008

Distributed localization algorithms are required for large-scale wireless sensor network applications. In this paper, we introduce an efficient algorithm, termed weighted neighbor-node distribution localization(WNDL), which emphasizes simple refinement and low system-load for low-cost and low-rate wireless sensors. We inspect WNDL algorithm through MATLAB simulation.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1200-1207
• /
• 2017

Sensors in a smartphone can be used to measure various physical quantities. In this paper, we propose an object localization scheme in a three dimenstional using a smart phone. The proposed scheme estimates the location of an object by observing it from several different points. The direction to the target object and the locations of the observation points are collected at each observation point using the location sensor and the orientation sensor in the smartphone. Based on these observations, the proposed scheme derives three dimensional line of sight vectors and estimates the location of the target object that minimizes the estimation error. We implemented the proposed scheme on an Android smartphone and tested its performance by estimating the height of a building and characteristics of the proposed approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.12
• /
• pp.1068-1076
• /
• 2005

In order to increase the autonomous navigation capability of a mobile robot, it is very crucial to develop a method for the robot to be able to recognize a priori hon structured environmental characteristics. This paper proposes an ultrasonic sensor based real-time method for recognizing a priori known structured indoor environmental characteristics like a wall and comer Unlike the methods reported in the literature the information obtained from the sensor can be processed in real-time by extended Kalman filter to update estimations of the position and orientation of robot with respect to known environmental characteristics.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.277-278
• /
• 2008

Localization system is an important problem for Wireless Sensor Networks(WSN). Since the sensor nodes are limited, the range-based that uses the special device for localization is unsuitable in WSN. DV-Hop is one of the range-free localization algorithm using hop-distance and number of hop count. But Its disadvantage is that it spend large communication cost in scalable sensor nodes. We propose a simple algorithm to reduce the communication cost, using the smallest number of hop count.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.55-56
• /
• 2011

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.261-267
• /
• 2016

In this paper, we studied the range-free localization algorithm between sensor nodes based on the Radical Line for sensor networks. Routing in wireless sensor networks should reduce the overall energy consumption of the sensor network, or induce equivalent energy consumption of all the sensor nodes. In particular, when the amount of data to send more data, the energy consumption becomes worse. New methods have been proposed to address this. So as to allow evenly control the overall energy consumption. For this, the paper covers designing a localization algorithm that can obtain the location information of the peripheral nodes with fewer operations. For the operation of the algorithm is applicable Radical Line. The experimental environment is windows 7, the Visual C ++ 2010, MSSQL 2008. The experimental results could be localized to perform an error rate of 0.1837.

• Journal of Digital Convergence
• /
• v.13 no.7
• /
• pp.207-212
• /
• 2015

The sensor network that is component of the Internet of Things require a lot of research to select the best route to send information to the anchor node, to collect a number of environment and cost efficient for communication between the sensor life. On the sensor network in one of the components of IOT's environment, sensor nodes are an extension device with low power low capacity. For routing method for data transmission between the sensor nodes, the connection between the anchor and the node must be accurate with in adjacent areas relatively. Localization CA (Centroid Algorithm) is often used although an error frequently occurs. In this paper, we propose a range-free localization method between sensor nodes based on the Radical Line in order to solve this problem.

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