基于连通度和加权校正的移动节点定位算法

移动节点定位问题是无线传感器网络中的研究重点。针对移动节点定位误差大的问题,提出一种基于连通度和加权校正的移动节点定位算法。在未知节点移动过程中,根据节点间连通度大小选取参与定位的信标节点,利用加权校正方法修正RSSI测距信息,然后用最小二乘法对未知节点进行位置估计。仿真分析表明,节点通信半径和信标密度在一定范围内,该算法表现出良好的定位性能,定位精度明显提升。     

一种基于网络密度分簇的移动信标辅助定位方法

现有移动信标辅助定位算法未充分利用网络节点分布信息,存在移动路径过长及信标利用率较低等问题。该文把网络节点分簇、增量定位与移动信标辅助相结合,提出了一种基于网络密度分簇的移动信标辅助定位算法(MBL(ndc))。该算法选择核心密度较大的节点作簇头,采用基于密度可达性的分簇机制把整个网络划分为多个簇内密度相等的簇,并联合使用基于遗传算法的簇头全局路径规划和基于正六边形的簇内局部路径规划方法,得到信标的优化移动路径。当簇头及附近节点完成定位后,升级为信标,采用增量定位方式参与网络其它节点的定位。仿真结果表明,该算法定位精度与基于HILBERT路径的移动信标辅助定位算法相当,而路径长度不到后者的50％。     

移动无线传感器网络定位算法研究

为了解决移动无线传感器网络中节点的自身定位问题,提出了一种基于运动预测的定位算法。该算法利用节点运动的连续性和接收信号强度测距方式,保存其最近两组历史位置信息,并结合节点当前的状态来估计自身位置。它不需要额外的硬件支持与较高的信标节点密度,满足复杂传输环境的应用要求。仿真结果表明,该算法具有较好的鲁棒性和较高的定位精度,节点随机运动时的定位误差约为15%,而直线运动时只有12%。     

无人机辅助的基于前馈神经网络的节点定位算法

针对无线传感网络(WSNs)的节点定位问题,提出无人机辅助的基于前馈神经网络的节点定位(UAV-NN)算法。UAV-NN算法利用无人机(UAV)作为锚节点,并由UAV周期地发射beacon信号,利用极端学习机(LEM)训练单隐藏前向反馈的神经网络(SLFN),未知节点接收来自UAV发射的beacon信号,并记录其接收信号强度指示(RSSI),已训练的SLFN再依据RSSI值估计节点位置。仿真结果表明,相比于传统的基于RSSI定位算法,提出的UAV-NN算法无需部署地面锚节点;相比其他传统的机器学习算法,UAV-NN算法通过引用ELM,减少了定位误差。     

An Interactive and Energy-efficient Node Localization Scheme for Wireless Sensor Networks

How to obtain accurate position of sensor node is still a challenging problem for wireless sensor networks (WSNs). This work concentrates on the problem of node localization with mobile anchor node, which is applied to broadcast beacon packets in the region of interest (ROI). Node localization scheme SAA-ERL (speed adaptive adjustment-energy ratio localization) for WSNs is realized in way of interactive communications. SAA scheme determines the suitable moving speed and direction for the mobile anchor node, while the ERL mechanism generates virtual hyper-spheres to help unknown nodes acquire their locations. Based on the quantitative analysis of the localizing performances, the guidelines for system parameters are obtained. Simulation results validate that when system parameters are jointly designed, SAA-ERL can be adapted to scenarios of diversified applications.     

Distributed localization using mobile beacons in wireless sensor networks

A new distributed node localization algorithm named mobile beacons-improved particle filter (MB-IPF) was proposed. In the algorithm, the mobile nodes equipped with globe position system (GPS) move around in the wireless sensor network (WSN) field based on the Gauss-Markov mobility model, and periodically broadcast the beacon messages. Each unknown node estimates its location in a fully distributed mode based on the received mobile beacons. The localization algorithm is based on the IPF and several refinements, including the proposed weighted centroid algorithm, the residual resampling algorithm, and the markov chain monte carlo (MCMC) method etc., which were also introduced for performance improvement. The simulation results show that our proposed algorithm is efficient for most applications.     

Range‐free intersecting chord‐based geometric localization scheme for wireless sensor networks

Recent advancement in wireless sensor network has contributed greatly to the emerging of low‐cost, low‐powered sensor nodes. Even though deployment of large‐scale wireless sensor network became easier, as the power consumption rate of individual sensor nodes is restricted to prolong the battery lifetime of sensor nodes, hence the heavy computation capability is also restricted. Localization of an individual sensor node in a large‐scale geographic area is an integral part of collecting information captured by the sensor network. The Global Positioning System (GPS) is one of the most popular methods of localization of mobile terminals; however, the use of this technology in wireless sensor node greatly depletes battery life. Therefore, a novel idea is coined to use few GPS‐enabled sensor nodes, also known as anchor nodes, in the wireless sensor network in a well‐distributed manner. Distances between anchor nodes are measured, and various localization techniques utilize this information. A novel localization scheme Intersecting Chord‐Based Geometric Localization Scheme (ICBGLS) is proposed here, which loosely follows geometric constraint‐based algorithm. Simulation of the proposed scheme is carried out for various communication ranges, beacon broadcasting interval, and anchor node traversal techniques using Omnet++ framework along with INET framework. The performance of the proposed algorithm (ICBGLS), Ssu scheme, Xiao scheme, and Geometric Constraint‐Based (GCB) scheme is evaluated, and the result shows the fact that the proposed algorithm outperforms the existing localization algorithms in terms of average localization error. The proposed algorithm is executed in a real‐time indoor environment using Arduino Uno R3 and shows a significant reduction in average localization time than GCB scheme and similar to that of the SSU scheme and Xiao scheme.     

Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique

Mobile sensor localization is a challenging problem in wireless sensor networks. Due to mobility, it is difficult to find exact position of the sensors at any time instance. The aim of localization is to minimize positioning errors of the mobile sensors. In this paper we propose two range-free distributed localization algorithms for mobile sensors with static anchors. Both the algorithms depend on selection of beacon points. First we assume that mobile sensors move straight during localization which helps us to provide an upper bound on localization error. Certain applications may not allow sensors to move in a straight line. Obstacles may also obstruct path of sensors. Moreover beacon point selection becomes difficult in presence of obstacles. To address these issues, we propose another localization algorithm with an obstacle detection technique which selects correct beacon points for localization in presence of obstacles. Simulation results show improvements in performance over existing algorithms.     

基于EKF的无线传感器网络移动信标定位算法

针对无线传感器网络节点定位精度较低的问题,提出一种基于扩展卡尔曼滤波的移动信标节点定位算法。该算法采用等距三重优化覆盖思想确定虚拟信标分布,利用蚁群算法获取最优遍历路径,同时引入扩展卡尔曼滤波算法以提高节点定位精度。通过对节点通信半径、虚拟信标数目、路径长度、迭代次数等参数分别进行仿真验证,结果表明本文算法定位精度明显优于普通质心定位算法,同时该算法在提高网络覆盖度、降低网络成本等方面也有较大优势。     

Sensitivity-based data fusion for optical localization of a mobile robot

Acoustic-based techniques are the standard for localization and communication in underwater environments, but due to the challenges associated with this medium, it is becoming increasingly popular to find alternatives such as using optics. In our prior work we developed an LED-based Simultaneous Localization and Communication (SLAC) approach that used the bearing angles, needed for establishing optical line-of-sight for LED-based communication between two beacon nodes and a mobile robot, to triangulate and thereby localize the position of the robot. Our focus in this paper is on how to optimally fuse measurement data for optical localization in a network with multiple pairs of beacon nodes to obtain the target location. We propose the use of a sensitivity metric, designed to characterize the level of uncertainty in the position estimate with respect to the bearing angle error, to dynamically select a desired pair of beacon nodes. The proposed solution is evaluated with extensive simulation and experimentation, in a setting of three beacons nodes and one mobile node. Comparison with multiple alternative approaches demonstrates the efficacy of the proposed approach.     

Heterogeneous Cooperative Localization for Social Networks

Location-aware techniques has become a hot research topic with great value in commercial and military applications. Cooperative localization, which utilizes multiple sensors in portable devices to estimate locations of the mobile users in the social networks, is one of the most promising solution for the indoor geo-location. Traditional cooperative localization methods are based on ranging techniques, they are highly dependent on the distance interpreted from the received signal strength (RSS) or time of arrival from anchors. However, a precise ranging procedure demands high performance hardware which would increase the cost to the current mobile platform. In this paper, we describes four ranging-free probabilistic cooperative localization algorithms: centroid scheme, nearest neighbor scheme, kernel scheme and AP density scheme to improve the accuracy for the indoor geo-location using current mobile devices. Since the GPS sensor embedded in the smart phone is able to provide accurate location information in the outdoor area, those mobile nodes can be used as calibrated anchors. The position of the indoor mobile node can be estimated by exchanging locations and RSSs from shared wireless access points information between the target node and anchor nodes. An empirical evaluation of the system is given to demonstrate the feasibility of these cooperative localization algorithms by reporting the results in a real-world environments, e.g. suburban area and city downtown. Moreover, we compared our results with the WiFi positioning system made by Skyhook Wireless to validate the accuracy of the proposed algorithms. Meanwhile, a Monte Carlo simulation is carried out to evaluate the performance of the cooperative algorithms under different scenarios. Results show that given the same scenario setting, the AP density scheme and kernel scheme outperform than other schemes.     

Sensor Position Determination with Flying Anchors in Three-Dimensional Wireless Sensor Networks

This paper presents a range-free position determination (localization) mechanism for sensors in a three-dimensional wireless sensor network based on the use of flying anchors. In the scheme, each anchor is equipped with a GPS receiver and broadcasts its location information as it flies through the sensing space. Each sensor node in the sensing area then estimates its own location by applying basic geometry principles to the location information it receives from the flying anchors. The scheme eliminates the requirement for specific positioning hardware, avoids the need for any interaction between the individual sensor nodes, and is independent of network densities and topologies. The performance of the localization scheme is evaluated in a series of simulations performed using ns-2 software and is compared to that of the Centroid and Constraint range-free mechanisms. The simulation results demonstrate that the localization scheme outperforms both Centroid and Constraint in terms of a higher location accuracy, a reduced localization time, and a lower beacon overhead. In addition, the localization scheme is implemented on the Tmote Sky for validating the feasibility of the localization scheme.     

Moving anchor node localization algorithm based on network connectivity

In order to better solve the contradiction between precision of localization and the number of anchor nodes in wireless sensor network,a mobile anchor node localization technology based on connectivity was proposed.First,the coverage characteristic of the network nodes was analyzed,and a critical value was found between the mobile step and the anchor node communication radius,mobile anchor nodes＇ coverage characteristic would change when near this critical value.Second,a mobile anchor node followed a planning path to form a positioning area seamless coverage was used.Finally,when there was no need for high-precision technology,node position would been estimated according with the connectivity of the network and the receiving information of the node.The simulation results show that the proposed algorithm can realize coarse-grained localization,and paths perform complete localization.     

基于UKF的移动信标辅助节点定位算法

常用的节点定位方法通常要求较多的信标节点,因此容易造成资源浪费.提出一种基于目标跟踪的移动信标辅助节点定位算法,信标节点在移动过程中周期性地发布自身位置信息,未知节点首先获取自身位置的近似估计,然后再利用无迹卡尔曼滤波(UKF)方法对移动信标进行跟踪,并完成进一步位置求精.在该算法中,未知节点之间无需相互通信,降低了能...     

Reference node placement and selection algorithm based on trilateration for indoor sensor networks

The key problem of location service in indoor sensor networks is to quickly and precisely acquire the position information of mobile nodes. Due to resource limitation of the sensor nodes, some of the traditional positioning algorithms, such as two‐phase positioning (TPP) algorithm, are too complicated to be implemented and they cannot provide the real‐time localization of the mobile node. We analyze the localization error, which is produced when one tries to estimate the mobile node using trilateration method in the localization process. We draw the conclusion that the localization error is the least when three reference nodes form an equilateral triangle. Therefore, we improve the TPP algorithm and propose reference node selection algorithm based on trilateration (RNST), which can provide real‐time localization service for the mobile nodes. Our proposed algorithm is verified by the simulation experiment. Based on the analysis of the acquired data and comparison with that of the TPP algorithm, we conclude that our algorithm can meet real‐time localization requirement of the mobile nodes in an indoor environment, and make the localization error less than that of the traditional algorithm; therefore our proposed algorithm can effectively solve the real‐time localization problem of the mobile nodes in indoor sensor networks. Copyright © 2008 John Wiley & Sons, Ltd.     

Wireless Node Localization under Hostile Radio Environment using Smart Antenna

This paper presents a resilient localization scheme for wireless sensor networks (WSNs). It suits well in estimation of node position under a corrupted radio environment. Position computation is based on information of angle-of-arrivals (AoA) and references obtained from a few mobile anchors. In the network, anchors are equipped with smart antennas and global positioning system receivers. They broadcast signals in a synchronous and periodic fashion. The neighboring nodes having the signals with received signal strength values above a prescribed threshold level, respond with their respective IDs. Anchors evaluate AoA information from these signals using estimation of signal parameters via rotational invariance technique (ESPRIT) algorithm. Next, they forward beacon messages, containing their references and estimated angles, to the corresponding nodes and move along random trajectories. After receiving three sets of such data, at least, nodes can initiate selective segregation of the inconsistent position estimations. Simulation results attaining higher degree of localization accuracy validate its competency over the existing schemes.

     

Auto-localization algorithm for local positioning systems

This paper studies the problem of determining the position of beacon nodes in Local Positioning Systems (LPSs), for which there are no inter-beacon distance measurements available and neither the mobile node nor any of the stationary nodes have positioning or odometry information. The common solution is implemented using a mobile node capable of measuring its distance to the stationary beacon nodes within a sensing radius. Many authors have implemented heuristic methods based on optimization algorithms to solve the problem. However, such methods require a good initial estimation of the node positions in order to find the correct solution. In this paper we present a new method to calculate the inter-beacon distances, and hence the beacons positions, based in the linearization of the trilateration equations into a closed-form solution which does not require any approximate initial estimation. The simulations and field evaluations show a good estimation of the beacon node positions.     

Optimal trajectory determination of a single moving beacon for efficient localization in a mobile ad-hoc network

An ad hoc network of small robots (sensor nodes) adjusting their positions to establish network connectivity would be able to provide a communication infrastructure in an urban battlefield environment. A sensor node would be capable of moving to a particular position to establish network connectivity, provided it knows its current position, positions of other sensor nodes and the radio propagation characteristics of the sensor area.In this paper, we present a pseudo formation control based trajectory algorithm to determine the optimal trajectory of a moving beacon used in localization of the sensor nodes in real-time. The trajectory and the frequency of transmission of the GPS based position information of the moving beacon influences the accuracy of localization and the power consumed by the beacon to localize. Localization accuracy and reduction in the number of position information messages can be achieved, in real-time, by determining the optimal position from where the beacon should transmit its next position information. This will decrease the time required to localize, and power consumed by the beacon in comparison to random or predetermined trajectories.We first show that optimal position determination is a pseudo formation control problem. Next, we show the pseudo formation control problem formulated as an unconstrained optimization problem under the free space propagation model. We further present the modeling of the beacon incorporating the trajectory algorithm based on the pseudo formation control in a discrete event simulator. Simulation results, comparing the performance of localization with pseudo formation control based trajectory against random waypoint and predetermined trajectories for the beacon are presented. The simulation results show that the localization accuracy is significantly improved along with reduction in the number of position information messages transmitted when the beacon traverses along the pseudo formation control based trajectory.     

基于接收信号强度的WSN概率定位算法

定位对无线传感器网络的应用、操作和管理发挥着至关重要的作用.针对传感器节点的定位,提出了一种基于接收信号强度的概率定位算法.介绍了算法原理及实现过程,讨论了信标节点分布对该算法性能的影响,最后比较了本概率定位算法和最小二乘定位算法在传感器节点定位性能上的优劣.仿真结果表明,信标节点分布对未知节点的定位误差具有较大的影响,本定位算法的性能要优于最小二乘定位算法.     

An analysis of error inducing parameters in multihop sensor node localization

Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Crame Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems.