Earticle

Wireless sensor networks (WSNs) are a new kind of data acquisition technology for danger area warning to ensure the safety of personnel production operation. In order to apply the suitable wireless node localization algorithm for danger area warning,an improved CT-IPIT+ algorithm is proposed in this paper.Considered the "edge effect", the algorithm improved the interior point judgment rules which reduces the error rate of Out-To-In effectively.Through the selection of reasonable restriction threshold, the In-To-Out error is eliminated.By counting number of inside and outside judgement results, the purpose of reducing the total error rate of misjudgment is further realized.Simulation results show that the proposed algorithm can reduce the rate of two types of errors and the total error rate can be controlled under 6.3%.

Due to the wide application of range-based location algorithm for received signal strength, and according to the requirements of high accuracy and low power cost in the location algorithm for WSNs, in this paper, a Bayesian optimization RSSI and an indoor location algorithm for ILS were introduced by setting RRS ranging as location framework. Firstly, through analyzing the RSSI-based ranging model, an indoor location model was introduced. Secondly, in view of the influence on RSSI value caused by the indoor environment,the Bayesian probabilistic model was adopted to process the RSSI measured value and to screen out the "big probability" of RSSI value. Thirdly, Obtaining accurate measured data by estimating distance using method of minimum mean square error. Finally, Estimating the node location using least square method, and according to the TelosB node of Telos Series produced by company Crossbow, the ranging experiment can be designed and thus groups of experimental data were obtained and analyzed..The experimental results showed that the proposed location project greatly increased the location accuracy and decreased the computation complexity, and has obviously more advantage of running time over other location projects.

Node localization algorithm of NLOS (Non-line-of-sight) environment based on PSO (particle swarm optimization) is proposed aiming at NLOS range error. PSO algorithm is quoted in wireless sensor network localization. First of all, the parameter of PSO algorithm is improved and nonlinear adjustment to inertia weight is made to boost convergence rate of algorithm, at the same time, target value is in rank ordering to decrease calculated quantity. Simulation results demonstrate that proposed algorithm reduced error influence of NLOS and improved location accuracy.

In order to reduce localization error of the sensor node, a novel node localization algorithm (DVHop-Steff) is proposed in this paper based on DV-Hop algorithm and Steffensen iterative method. Firstly, DV-Hop algorithm is used to obtain location position of wireless sensor nodes; and then Steffensen iterative method is used to correct the locate results of DV-Hop algorithm and achieve higher localization precision, finally, the performance of the proposed algorithm is tested by simulation analysis. The results show that the localization precision of the proposed algorithm has been improved significantly and has more wide application scope.

The purpose of sensor network node localization is to obtain the information about the absolute or relative locations of various kinds of sensor nodes on the plane or in space. In many sensor network application fields, one important issue that users are concerned about is: in what location or area an inappropriate use or detection situation occurs. Sensor network node technology provides vital node location information for a whole network system's obtaining a large amount of detailed and reliable monitoring information. The obtaining of node location information will directly influence the effectiveness of the whole network system, so study on the node localization mechanism and algorithm involved in a wireless sensor network is the key to realizing node localization technology. In this paper, based on wireless sensor network research, a range-free localization mechanism based on DV-Hop localization algorithm is analyzed, with the optimized processing of this algorithm preliminarily realized, with an intuitive understanding of the relationship between nodes and localization errors realized through MATLAB simulation experiment.

Localization algorithm is an important and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. In this paper, an improved DV-Hop algorithm based on the node deployment was proposed. The proposed algorithm improves the localization accuracy by taking the advantage of the node deployment when computing the distance between the unknown node and the anchor. Simulation results prove that the improved DV-Hop algorithm offers the better performance compared to the original DV-Hop algorithm in localization accuracy without requiring additional hardware.

무선 센서 네트워크(WSN)에서 센서 노드의 위치 추정 기술 중 거리 기반의 위치 추정 기술은 거리 측정에 따라 센서 노드의 위치 추정의 정확성이 달라진다. 거리 기반의 위치 추정 기술에서 거리를 측정하는 많은 기술 중에 추가적인 장비 없이 쉽게 구현이 가능한 기술 중 하나는 수신 신호 세기이다. 그러나 수신신호세기 기반의 위치 추정 기법은 몇 가지 문제점을 고려해야 한다. 하나는 수신된 신호는 채널 환경에서 페이딩, 쉐도잉 그리고 장애물 등으로 인해서 거리 추정의 오차가 생긴다. 이로 인해서 센서 노드의 위치 추정의 정확성은 낮게 된다. 또 다른 하나는 거리 기반의 위치 추정 기술은 대부분 센서 노드에 의해서 자신의 위치를 추정한다는 것이다. 하지만 센서 노드의 한정된 배터리 용량 때문에 무선 센서 네트워크의 동작 시간이 감소하게 된다. 반면에 비콘 노드는 센서 노드보다 처리 능력과 배터리 용량이 더 높기 때문에 비콘 노드 기반 위치 추정 기법은 무선 센서 네트워크의 동작 시간을 연장 할 수 있다. 본 논문에서는 비콘 노드에서 수신 신호 세기와 전력손실지수 추정을 활용하여 센서 노드의 위치를 추정하는 알고리즘을 제안함으로써 위의 문제점을 극복한다. 시뮬레이션을 통해서 제안한 기법을 검증한다.

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.

Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

In this paper, we present a fine-grained localization algorithm for wireless sensor networks using a mobile beacon node. The algorithm is based on distance measurement using RSSI. The beacon node is equipped with a GPS sender and RF (radio frequency) transmitter. Each stationary sensor node is equipped with a RF. The beacon node periodically broadcasts its location information, and stationary sensor nodes perceive their positions as beacon points. A sensor node's location is computed by measuring the distance to the beacon point using RSSI. Our proposed localization scheme is evaluated using OPNET 8.1 and compared with Ssu's and Yu's localization schemes. The results show that our localization scheme outperforms the other two schemes in terms of energy efficiency (overhead) and accuracy.

본 논문은 무선 센서 네트워크의 분산 분포되어 있는 센서 노드들의 측위를 위해 Binary Particle Swarm Optimization (BPSO) 알고리즘을 제안한다. 자신의 위치를 모르는 센서 노드들은 셋 이상의 인접한 앵커, 즉, 위치를 알고 있는 노드들로부터의 거리를 측정하여 측위를 수행한다. 이러한 과정이 반복하는 동안 측위를 수행한 센서 노드들은 나머지 노드들에 대하여 또 다른 앵커 역할을 수행한다. 성능 평가를 위해 기존의 PSO 알고리즘에 대비하여, BPSO를 이용한 측위 오류 및 계산 시간 성능을 매트랩 시뮬레이션을 통해 비교 분석하였다. 시뮬레이션 결과 PSO 기반의 측위가 상대적으로 더 정확한 결과를 보여준다. 대조적으로, BPSO 알고리즘은 분산되어 있는 센서 노드들의 위치 측위를 더 빠르게 수행한다. 추가적으로, 전송 범위와 초기 앵커 노드들의 수가 측위 성능에 미치는 영향에 대한 분석을 수행한다.

This paper proposes a binary particle swarm optimization (BPSO) algorithm for distributed node localization in wireless sensor networks (WSNs). Each unknown node performs localization using the value of the measured distances from three or more neighboring anchors, i.e., nodes that know their location information. The node that is localized during the localization process is then used as another anchor for remaining nodes. The performances of particle swarm optimization (PSO) and BPSO in terms of localization error and computation time are compared by using simulations in Matlab. The simulation results indicate that PSO-based localization is more accurate. In contrast, BPSO algorithm performs faster for finding the location of unknown nodes for distributed localization. In addition, the effects of transmission range and number of anchor nodes on the localization error and computation time are investigated.

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.

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