• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.172-188
• /
• 2006

Sensor localization is one of the fundamental problems in wireless sensor networks. Previous localization algorithms can be classified into two categories, the GGB (Global Geometry-Based) approaches and the LGB (Local Geometry-Based). In the GGB approaches, there are a fixed set of reference nodes of which the coordinates are pre-determined. Other nodes determine their positions based on the distances from the fixed reference nodes. In the LGB approaches, meanwhile, the reference node set is not fixed, but grows up dynamically. Most GGB algorithms assume that the nodes are deployed in a convex shape area. They fail if either nodes are in a concave shape area or there are obstacles that block the communications between nodes. Meanwhile, the LGB approach is vulnerable to the errors in the distance estimations. In this paper, we propose new localization algorithms to cope with those two limits. The key technique employed in our algorithms is to determine, in a fully distributed fashion, if a node is in the line-of-sight from another. Based on the technique, we present two localization algorithms, one for anchor-based, another for anchor-free localization, and compare them with the previous algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.55-63
• /
• 2013

In cognitive radio networks, acquirement of position information of primary user is very important to secondary network since localization information of primary users can be utilized for improving the spectrum efficiency of secondary network and for avoiding harmful interference to primary users by using proper power control. Among various location methods, Received Signal Strength (RSS)-based localization has been widely used for distance measurements in the location detection process despite its inherent inaccuracy because it can be easily implemented without any additional hardware cost. In the RSS-based localization, the distance is measured by the received signal strength, and distance error can be caused by many factors such as fading, shadowing and obstacle between two nodes. In the paper, therefore we propose a localization scheme based on estimation of path-loss exponent to localize the location of primary users more accurately. Through simulations, it is shown that the proposed scheme can provide less localization error and interference rate to primary users than other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.370-376
• /
• 2012

The CSS(Chirp Spread Spectrum) technology is used for developing various WPAN(Wireless Personal Area Network) application fields in general, and it can be adapted to implement localization systems especially using SDS-TWR(Symmetric Double Sided - Two Way Ranging). But the ranging errors are occurred in many practical applications due to some interferences by some experiments. Thus, the compensation algorithm for localization is required for developing localization applications. The suggested compensation algorithm that is named KF_EDR(Kalman Filter and Equivalent Distance Rate) for localization in order to reduce the ranging errors is suggested in this paper. The KF_EDR compensation algorithm for localization is mainly composed of the AEDR(Algorithm of Equivalent Distance Rate) and the Kalman Filter. It is confirmed that the improved error ratio of the KF_EDR are 10.5% and 4.2% compared with the AEDR algorithm in lobby and stadium. From the results, it is analyzed that the KF_EDR can be widely used for some localization system in ubiquitous society.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.8
• /
• pp.750-757
• /
• 2011

Wireless Sensor Network is composed of a lot of sensor nodes that are densely deployed in a field. So generally this sensor nodes are spreaded using Helicopter or Fixed wing. Each node delivers own location and acquired information to user when it detects specific events. In this paper, we propose localization algorithm without range information in wireless sensor network using helicopter. Helicopter broadcasts periodically beacon signal for sensor nodes. Sensor nodes stored own memory this beacon signal until to find another beacon point(satisfied special condition). This paper develops a localization mechanism using the geometry conjecture(perpendicular bisector of a chord) to know own location. And the simulation results demonstrate that our localization scheme outperforms Centroid, APIT in terms of a higher location accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.820-827
• /
• 2014

One of the basic problems in Wireless Sensor Networks (WSNs) is the localization of the sensor nodes based on the known location of numerous anchor nodes. WSNs generally consist of a large number of sensor nodes and recording the location of each sensor nodes becomes a difficult task. On the other hand, based on the application environment, the nodes may be subject to mobility and their location changes with time. Therefore, a scheme that will autonomously estimate or calculate the position of the sensor nodes is desirable. This paper presents an intelligent localization scheme, which is an artificial neural network (ANN) based localization scheme used to estimate the position of the unknown nodes. In the proposed method, three anchors nodes are used. The mobile or deployed sensor nodes request a beacon from the anchor nodes and utilizes the received signal strength indicator (RSSI) of the beacons received. The RSSI values vary depending on the distance between the mobile and the anchor nodes. The three RSSI values are used as the input to the ANN in order to estimate the location of the sensor nodes. A feed-forward artificial neural network with back propagation method for training has been employed. An average Euclidian distance error of 0.70 m has been achieved using a ANN having 3 inputs, two hidden layers, and two outputs (x and y coordinates of the position).

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

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

• BMB Reports
• /
• v.43 no.10
• /
• pp.670-676
• /
• 2010

In this paper, a novel approach, ELM-PCA, is introduced for the first time to predict protein subcellular localization. Firstly, Protein Samples are represented by the pseudo amino acid composition (PseAAC). Secondly, the principal component analysis (PCA) is employed to extract essential features. Finally, the Elman Recurrent Neural Network (RNN) is used as a classifier to identify the protein sequences. The results demonstrate that the proposed approach is effective and practical.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.609-611
• /
• 2005

위치 인지(localization)는 유비쿼터스 응용의 중요 기술로서 사용자 및 센서 노드 주변의 환경 상태와 같은 정보를 지능적으로 판단하는 상황 인지(context awareness)와 더불어 실재 지리적 위치를 인지(location awareness)할 수 있는 지능화된 서비스를 말한다. 기존의 센서 네트워크를 이용한 위치 인지 기술들은 실내(Indoor) 공간에서 미리 설치된 센서 노드블을 기반으로 능동형 혹은 수동형 방식으로 움직이는 노드의 위치를 측정 하는 인프라스트럭척 기반의 기술 이었다. 그러나 이러한 방식은 위치 인지를 위해 미리 특정 노드 들을 설치해야 하는 근본적인 문제점이 있어서, 군사 작전이나 위급 상황과 같은 환경에서도 강건하게(robust) 사용하기 위해서는 새로운 구조가 필요로 하다. 본 논문에서는 인프라스트럭쳐 기반이 없는 환경에서도 센서 네트워크를 이용해서 강건하게 위치 인식을 할 수 있는 하이브리드(hybrid) 알고리즘 및 시스템을 제안하였다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.363-364
• /
• 2008

Localization algorithms are required for indoor sensor network applications. In this paper, we introduce an efficient algorithm for low complexity and high accuracy, termed multi-internal division localization(MID), which emphasizes simple refinement and low system-load for low-cost and low-rate wireless sensors. We inspect MID algorithm through MATLAB simulation.