• Proceedings of the Korea Contents Association Conference
• /
• 2012.05a
• /
• pp.33-34
• /
• 2012

무선 센서 네트워크의 다양한 응용에 있어 센서 노드의 지리학적 위치 측정은 매우 중요하다. 이를 위해 비-거리(Range-Free) 기반 위치 측정 기법에 대한 연구가 활발하게 진행 중이며, 비 균일 네트워크 환경에서 위치 정확도를 향상하기 위한 밀집 확률 기반의 위치 측정 기법이 제안되었다. 밀집 확률 기반의 위치 측정 기법에서 추정 거리 산출 시 노드 통신 반경 내 1-홉 거리는 모두 동일한 값을 갖는데 이는 반경 내 가까운 이웃 노드와 먼 이웃 노드가 있어도 모두 같은 거리로 추정하기 때문에 위치 측정 시 오차가 발생 할 수 있다. 따라서 본 논문에서는 이러한 오차를 줄이기 위해 각 노드마다 거리 추정 후 센싱 반경을 조절하여 2차 지역 거리 평가를 통해 센서의 위치를 측정하는 기법을 제안한다. 성능평가 결과, 제안하는 기법이 기존 기법에 비해 측위 정확도가 크게 향상되었다.

• 한국IT서비스학회:학술대회논문집
• /
• 2006.05a
• /
• pp.241-248
• /
• 2006

네트워크 거리 (Network distance : 일반적으로 ping이나 traceroute 등으로 측정 가능한 round trip time 등 네트워크 상에서 패킷 전송 시간) 추정 기법은 인터넷상의 많은 응용프로그램들에서 유용하게 사용된다. 예를 들면 다수의 서버를 인터넷상에 설치하고자 하는 경우 사용자들 간의 네트워크 거리를 알고 있다면 서버와 사용자간의 왕복 전송 시간 (Round Trip Time)등을 최소화할 수 있도록 서버를 분산하여 설치하는 구성을 도출해 낼 수 있을 것이다. Peer to Peer 응용 프로그램들에서도 이 네트워크 거리 정보는 매우 유용하다. 기존에 존재하는 추정 기법들은 대부분 유클리드 공간 좌표 기반 기법들로서 유클리드 좌표 상의 거리가 실제 네트워크 거리와 유사하도록 유클리드 공간 좌표를 지정한다. 그러나 이런 방법들의 문제점은 인터넷 상의 네트워크 거리가 삼각 부등식을 만족하지 않는 경우가 존재하는 등 유클리드 공간의 기본적인 가정을 만족하지 못한다는데 있다. 이런 문제점 때문에 새로운 모델이 필요하고, 이 논문에서는 가상 토폴로지(Virtual Topology) 모델과 지역 조정 항 (Local Adjustment Term) 모델을 제시하고, 기본적인 성능 분석을 시도하였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2011.06a
• /
• pp.25-26
• /
• 2011

사용자 의사거리 보정 잔차(UDRE)는 위성항법보정정보의 측위성능을 예측하는데 이용하는 매우 중요한 무결성 감시정보이다. 위성항법보정정보 사용자는 위성별로 제공되는 사용자 의사거리 보정 잔차 정보를 이용하여 목표로 하는 측위성능을 보장할 수 있는지 여부를 계산하고, 이 결과를 반영하여 위성항법보강시스템의 보정정보를 사용할지 아니면, 무시할지를 판단한다. 즉, 사용자 의사거리 보정 잔차는 위성별로 제공되는 보정정보를 이용하여 보정을 한 후에도 제거되지 않고 남는 위성과 사용자 수신기 간의 통계학적 거리 오차로서 가우시안 분포를 갖는다고 본다. 따라서 동일한 위성항법신호 환경이라도 위성항법보강시스템의 종류와 응용분야별로 다르게 설정되는 측위성능의 보장 수준에 따라 사용자 의사거리 보정 잔차는 다른 값을 갖게 된다. 본 논문은 위성항법보강시스템의 무결성 감시성능에 영향을 미치는 사용자 의사거리 보정 잔차 추정기법의 성능해석을 목적으로 다중 기준국 원시정보를 이용한 사용자 의사거리 보정 잔차 추정기법 구조분석과 영향력을 소개하고, 성능에 영향을 미치는 인자와 사용자 의사거리 보정 잔차 추정성능의 지표에 대해 정의한다. 그리고 마지막으로 성능해석의 방법을 제안하고, 타당성을 검증한다.

• 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 Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.453-461
• /
• 2012

This paper proposes an improved phase estimation method for AM(Amplitude Modulation) range measurement system. The previous phase estimation method induces errors by Doppler shift of a moving target. The proposed method compensates phase estimation error through the ADC(Adaptive Doppler Correction) to take the Doppler shift, thus can improve distance measurement accuracy. When compared with the previous method through simulation results, the Doppler shift compensation and accuracy are improved by 94.7% and 50%, respectively. Target distance error in an acoustic tank is estimated to be 7.7cm, which confirms that the proposed method can be used to estimate the distance in the marine environment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.559-569
• /
• 2010

We propose an RFID system based on range-free localization method. This method recognizes pre-determined reference tags first, and then checks within which reference tag the target tag is placed closest. It estimates target tag's position relative to the reference tag's position. We use Aging Counter to estimate the distance between reference and target tags using the read ratio of RFID tags. Practicality of the proposed method is verified by applying it to a library book locating system.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.2
• /
• pp.125-133
• /
• 2004

Most of the way shape estimation method using reference sources assume that the reference sources are in the farfield. That is, the reference sources are assumed to be far from the array. However, in applications of the array with reference sources, the reference sources are not far from the way, so that in practical ocean environments, the conventional method using farfield source model fail to estimate the positions of the hydrophones. In this paper, based on the nearfield source model, a subspace-based array shape estimation method was proposed. In the proposed method, nearfield reference source is modeled using the differential time delay at each hydrophone, and nearfield parameters are derived. Using these parameters, a subspace-based array shape estimation method that generalizes the existing farfield subspace fitting method which can work regardless of the range of the source is proposed. The Cramer-Rao lower bound for the proposed method is investigated. The results of the numerical experiments indicate that the proposed method performs well in estimating the shape of a perturbed way regardless of the ranges of the reference sources.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.209-216
• /
• 2005

In wireless sensor networks, an estimation method is proposed for distances between nodes within two hops. The method uses only proximity information of nodes without physiccal distance measurements. It drastically improves the performance of localization algorithms based on Proximity information. In addition, it is the first method that estimates distances between nodes exactly in two hops. The distances are estimated from the number of common neighbors under an assumption that the number of common neighbors is proportional to the intersection of two unit disks centered at the two nodes. Simulation analysis shows that the estimation error is roughly from 10 to 20 percent of real distances. Meanwhile, the number of messages required by a distributed algorithm realizing this method is only two times the number of nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.595-605
• /
• 2012

DV-Hop is one of the well known range-free localization algorithms. The algorithm works well in case of isotropic network since the sensor and anchor nodes are placed in the entire area. However, it results in large errors in case of anisotropic networks where the hop count between nodes is not linearly proportional to the Euclidean distance between them. Hence, we proposed a novel range-free algorithm for anisotropic networks to improve the localization accuracy. In the paper, the Euclidean distance between anchor node and unknown node is estimated by the average hop distance calculated at each hop count with hop count and distance information between anchor nodes. By estimating the unknown location of nodes with the estimated distance estimated by the average hop distance calculated at each hop, the localization accuracy is improved. Simulation results show that the proposed algorithm has more accuracy than DV-Hop.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.52-61
• /
• 2013

In wireless sensor networks, the geographical positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. For this reason, studies on range-free positioning schemes have been actively progressing. The density probability scheme based on central limit theorem and normal distribution was proposed to improve the location accuracy in non-uniform sensor network environments. The density probability scheme measures the final positions of unknown nodes by estimating distance through the sensor node communication. However, it has a problem that all of the neighboring nodes have the same 1-hop distance. In this paper, we propose an efficient sensor positioning scheme that overcomes this problem. The proposed scheme performs the second positioning step through the sensing range control after estimating the 1-hop distance of each node in order to minimize the estimation error. Our experimental results show that our proposed scheme improves the accuracy of sensor positioning by about 9% over the density probability scheme and by about 48% over the DV-HOP scheme.