A New Localization Scheme with Statistical Estimation against Wormhole Attack in Wireless Sensor Networks

Wormhole attack is one of the most devastating threats for range-free localization in wireless sensor networks. In this paper, we evaluate three statistical estimation methods with the same network model and geographic information obtailaed by the DV-Hop algorithm. We analyze the limits of Minimum Mean Square Estimate （MMSE）, Least Median of Squares （LMS） and Enhanced greedy At- tack-Resistant MMSE （EARMMSE） and propose an improved EARMMSE with the hop-distance relationship, named EARMMSE＋. Simulation results illustrate the performance of MMSE, LMS and EARMMSE＋ with different anchor fraction, the length of wormhole link and the average local neighborhood and show that EARMMSE＋ outperforms MMSE and LMS.

Reach Centroid Localization Algorithm

As much as accurate or precise position estimation is always desirable, coarse accuracy due to sensor node localization is often sufficient. For such level of accuracy, Range-free localization techniques are being explored as low cost alternatives to range based localization techniques. To manage cost, few location aware nodes, called anchors are deployed in the wireless sensor environment. It is from these anchors that all other free nodes are expected to estimate their own positions. This paper therefore, takes a look at some of the foremost Range-free localization algorithms, detailing their limitations, with a view to proposing a modified form of Centroid Localization Algorithm called Reach Centroid Localization Algorithm. The algorithm employs a form of anchor nodes position validation mechanism by looking at the consistency in the quality of Received Signal Strength. Each anchor within the vicinity of a free node seeks to validate the actual position or proximity of other anchors within its vicinity using received signal strength. This process mitigates multipath effects of radio waves, particularly in an enclosed environment, and consequently limits localization estimation errors and uncertainties. Centroid Localization Algorithm is then used to estimate the location of a node using the anchors selected through the validation mechanism. Our approach to localization becomes more significant, particularly in indoor environments, where radio signal signatures are inconsistent or outrightly unreliable. Simulated results show a significant improvement in localization accuracy when compared with the original Centroid Localization Algorithm, Approximate Point in Triangulation and DV-Hop.

Comparison of Indoor Localization Systems Based on Wireless Communications

Localization using a Wireless Sensor Network (WSN) has become a field of interest for researchers in the past years. This information is expected to aid in routing, systems maintenance and health monitoring. For example, many projects aiming to monitor the elderly at home include a personal area network (PAN) which can provide current location of the patient to the medical staff. This article presents an overview of the current trends in this domain. We introduce the mathematical tools used to determine position then we introduce a selection of range-free and range-based proposals. Finally, we provide a comparison of these techniques and suggest possible areas of improvement.

Cooperative Nodes Localization for Three-Dimensional Underwater Wireless Sensor Network Based on Weighted Centroid Localization Algorithm

The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more difficult to locate the nodes in marine environment.Aiming at the characteristics of UWSN,a kind of cooperative range-free localization method based on weighted centroid localization(WCL) algorithm for three-dimensional UWSN is proposed.The algorithm assigns the cooperative weights for the beacon nodes according to the received acoustic signal strength,and uses the located unknown nodes as the new beacon nodes to locate the other unknown nodes,so a fast localization can be achieved for the whole sensor networks.Simulation results indicate this method has higher localization accuracy than the centroid localization algorithm,and it needs less beacon nodes and achieves higher rate of effective localization.

An efficient range-free localization algorithm for wireless sensor networks

Node positioning is a fundamental problem in applications of wireless sensor networks (WSNs). In this paper, a new range-free algorithm, called spring swarm localization algorithm (SSLA), is proposed for positioning WSNs. To determine the locations of sensor nodes, the proposed algorithm uses network topology information and a small fraction of sensor nodes which know their locations. Numerical simulations show that high positioning accuracy can be obtained by using the algorithm. Some examples are given to illustrate the effectiveness of the algorithm.

基于核Tikhonov规则化的多跳非测距定位方法

针对多跳非测距定位算法易受到节点分布不均、非视距传播等网络各向异性因素的影响,提出一种基于核Tikhonov规则化定位方法。采用核Tikhonov规则化方法构建跳数—距离映射模型,并利用该模型估计未知节点到参考节点的距离。理论分析和仿真实验表明,基于核Tikhonov规则化定位能有效避免网络各向异性和计算不适定问题,提高定位精度,涉及参数少,算法计算开销小,可适应于节点部署环境较复杂的网络,具有较高的实际应用价值。