• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2120-2126
• /
• 2010

This paper aims to realize the location tracking system using the Zigbee in the wireless sensor network. The wireless sensor network offers the user-oriented location tracking service in the ubiquitous environment. The location tracking service can track the location of an object or a person and provides it. The location tracking system realized in this paper can be used inside or outside without any black-out areas to measure the location of the moving nodes. In tracking inside the RSSI signals use and in tracking outside will connect with the GPS signals to track the location. Also, by using Zigbee, the wireless sensor network environment was established and by obtaining the location of the moving nodes, the real-time tracking is possible.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.589-592
• /
• 2010

무선 센서 네트워크에 대한 연구에서 센서 노드 로부터 발생한 데이터는 데이터 그 자체의 의미도 중요하지만, 데이터의 발생 위치 역시 매우 중요하다고 할 수 있다. 기존 연구로 센서 노드의 위치를 추정할 수 많은 방법들이 있지만, GPS 를 이용하거나 절대적인 위치를 알고 있는 앵커 노드 등을 이용하는 방법들은 추가적인 하드웨어 및 여러 번의 통신이 필요하게 되고 그에 따라 에너지 소비의 증가와 앵커 노드의 손실에 의한 오차의 확대 등 많은 문제를 갖고 있다. 본 논문에서는 센서 노드를 하드웨어적으로 단순화 할 수 있는 거리에 기반하지 않은(range-free) 방식을 사용하여 무선 센서 네트워크에서 싱크 노드로부터 센서 노드의 상대적인 위치를 추정하고 추정 데이터를 기반으로 싱크 노드에서 보정하는 방법으로 자원의 제약에서 비교적 자유로운 싱크 노드의 역할을 증대시킨 위치 추정 및 보정방법에 대해 설명한다.

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

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.123-129
• /
• 2009

It is important to locate nodes in the research of wireless sensor network. In this paper, we propose a method that estimates the positions of nodes by using adjacent node information and signal strength in wireless sensor network. With this method, we can find positions of nodes easily because we use Information that nodes have. And we can make a map for all the nodes because we can measure a relative position for an node whose position is not known based on anchor nodes whose positions are already known. In addition, we can confirm whether nodes are placed appropriately. We confirmed that we can locate positions of unknown nodes with small error through verifying the proposed method.

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

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.953-956
• /
• 2009

무선 센서 네트워크에서 이동하는 표적의 위치를 추정하기 위한 연구는 센서 노드의 에너지가 제한 되어 있어 센서 노드 상호간의 협력적인 신호처리 기법이 필수적이다. 기존의 무선 센서 네트워크에서 이동 표적의 위치를 추정하는 방법은 각 센서 노드에서 이동 표적으로부터 수신된 신호를 이용해 수신신호강도, 잡음제거, 압축 등의 신호처리를 수행하고 기지국으로 전송하는 형태이다. 이런 기존의 기법은 애드 호크 방법의 무선 센서 네트워크에는 적용이 어렵고, 각 센서 노드에서 신호처리 및 통신에 의한 에너지 소모가 크기 때문에 무선 센서 네트워크의 생존 시간이 짧아지게 된다. 본 논문에서는 웨이블릿 기반의 무선 센서 네트워크의 협력적 신호 처리 방법을 제안한다. 제안된 방법은 웨이블릿 변환을 이용한 센서노드에서의 에너지 효율적 특징추출을 수행하고 각 센서 노드간의 특징 전송을 통해 표적의 위치를 추정한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.472-478
• /
• 2010

In the environment of wireless communication system of IEEE 802.15.3a UWB standard, the angle of arrival(AOA) estimation technique for the indoor wireless positioning algorithms, based on the AOA parameter estimation which fits well for the wireless communication channel and shows high estimation accuracy, is proposed. After the UWB signal model, based on the IEEE 802.1.3a standard, is constructed, the average weighted MUSIC technique is proposed, which shows better estimation accuracy than those of conventional estimation technique. Through the simulation studies, the environment of the indoor wireless positioning system including the IEEE 802.15.3a channel is configured and we demonstrate better estimation results by the proposed AOA estimation technique than those from the conventional method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.15-21
• /
• 2011

In the range-based localization, the localization accuracy will be high dependent on the accuracy of distance measurement between two nodes. The received signal strength(RSS) is one of the simplest methods of distance measurement, and can be easily implemented in a ranging-based method. However, a RSS-based localization scheme has few problems. One problem is that the signal in the communication channel is affected by many factors such as fading, shadowing, obstacle, and etc, which makes the error of distance measurement occur and the localization accuracy of sensor node be low. The other problem is that the sensor node estimates its location for itself in most cases of the RSS-based localization schemes, which makes the sensor network life time be reduced due to the battery limit of sensor nodes. Since beacon nodes usually have more resources than sensor nodes in terms of computation ability and battery, the beacon node based localization scheme can expand the life time of the sensor network. In this paper, therefore we propose a beacon node based localization algorithm using received signal strength(RSS) and path loss calibration in order to overcome the aforementioned problems. Through simulations, we prove the efficiency of the proposed scheme.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.525-534
• /
• 2005

We present several distributed algorithms for localizing nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms

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