Cooperative wireless localization based on weighting for vector‐addition error

Localization error occurrence due to a position ambiguity is a very critical problem in wireless distributed cooperative localization, which may, in turn, affect the reliability of the localization of the whole or a major portion of the network. In this paper, we formulate a two‐dimensional cooperative localization model via graph partition in arbitrary topologies while considering the cooperative node's (or neighbor's) position ambiguity. Based on this model, we establish a robust algorithm, named weighted factor graph (FG)‐based cooperative localization algorithm, by mapping local topologies into the FG and by incorporating the vector‐addition error as the weight. The vector‐addition error includes the measurement error and the neighbor's position ambiguity, simultaneously. The optimal weight is derived theoretically according to the statistic properties of the vector errors and the joint probability density function. Theoretical analysis and numerical results indicate that the proposed algorithm can acquire higher level of accuracy for localization in various topology scenarios in comparison with some typical algorithms. Copyright © 2014 John Wiley & Sons, Ltd.     

IMU辅助的TDOA室内定位

室内环境下,当无线信号受到多径和非视距干扰时,传统的基于到达时间差（Time Difference of Arrival,TDOA）的测距模型定位精度不满足室内定位精度要求。为此,提出利用TDOA与低成本的惯性测量单元（Inertial Measurement Unit,IMU）相结合的定位方法。在视距情况下,只有TDOA系统工作,但在信号受到干扰时,利用IMU能够在短时间内提供一个准确的相对位置信息的特性,采用TDOA算法对其进行辅助定位,并利用卡尔曼滤波器对它们的数据进行预处理,最后使用扩展卡尔曼滤波器对数据进行处理融合。实验结果表明,提出的算法比传统的TDOA定位具有更高的精度。     

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.     

Distributed location model and algorithm with position uncertainty

The localization of multiple mobile terminals （MTs） is an encouraging paradigm of applications in wireless networks. Peer-to-peer communication between MTs facilitates the cooperative localization of multiple MTs. For sake of low complexity and high robustness, investigations often focus on the distributed algorithm in cooperative localization. However, the impact from position uncertainty of cooperative MT lacks of analysis in related works. A new distributed location model, as well as corresponding algorithm, is devised when considering both the distance measurement error and the position uncertainty of MTs, which is more judicious than the traditional model for distributed cooperative localization scenario. In addition, the performance of proposed algorithm is analyzed through Cramér-Rao lower bound （CRLB）. Simulations indicate that the algorithm outperforms traditional methods in terms of accuracy and robustness.     

A Comprehensive Tutorial on Localization: Algorithms and Performance Analysis Tools

This tutorial offers a comprehensive view of technological solutions and theoretical fundamentals of localization and tracking (LT) systems for wireless networks. We start with a brief classification of the most common types of LT systems, e.g. active versus passive technologies, centralized versus distributed solutions and so forth. To continue, we categorize the LT techniques based on the elementary types of position-related information, namely, connectivity, angle, distance and power-profile. The attention is then turned to the difference between active and passive LT systems, highlighting the evolution of the localization techniques. Motivated by the interests of industry and academia on distance-based active localization system, a deep review of the most common algorithms used in these systems is provided. Non-Bayesian and Bayesian techniques will be tackled and compared with numerical simulations. To list some of the proposed approaches, we mention the multidimensional scaling (MDS), the semidefinite programming (SDP) and the Kalman filter (KF) methods. To conclude the tutorial, we address the fundamental limits of the accuracy of range-based positioning. Based on the unifying framework proposed by Abel, we derive the closed-form expressions for the Cramér?CRao lower bound (CRLB), the Battacharyya Bound (BB), the Hammersley?CChapmann?CRobbins Bound (HCRB) and the Abel Hybrid Bound (AHB) in a source localization scenario. We show a comparison of the aforementioned bounds with respect to a Maximum-Likelihood estimator and explore the difference between random and regular (equi-spaced anchors) network topologies. Finally, extensions to cooperative scenarios are also discussed in connection with the concept of information-coupling existing in multitarget networks.     

基于刚性约束的双移动机器人协同定位

准确、快速的状态估计是保证多机器人顺利完成协作搬运任务的关键.然而,大部分现有多机器人协同定位方法都存在一定的局限性,往往无法同时兼顾定位精度与计算复杂度.因此,本文从协作搬运任务的特点出发,将距离与方位的刚性约束条件引入协同定位中,同时根据机器人之间的紧密耦合关系建立起通用有效的运动模型和量测模型.最终在此刚性约束系统建模的基础上,提出一种基于高斯-厄米特求积分卡尔曼滤波（Quadrature Kalman Filter,QKF）的双移动机器人协同定位方法.仿真实验结果表明：与基于无约束模型的QKF协同定位方法相比,本文所提方法不但具有更高的定位精度,而且计算复杂度大大降低,有助于实现多机器人实时协同定位.     

Cooperative localization techniques for wireless sensor networks: free,signal and angle based techniques

This paper addresses the problem of localization in sensor networks where, initially, a certain number of sensors are aware of their positions (either by using GPS or by being hand‐placed) and are referred to as anchors. Our goal is to localize all sensors with high accuracy, while using a limited number of anchors. Sensors can be equipped with different technologies for signal and angle measurements. These measures can be altered by some errors because of the network environment that induces position inaccuracies. In this paper, we propose a family (AT‐Family) of three new distributed localization techniques in wireless sensor networks: free‐measurement (AT‐Free) where sensors have no capability of measure, signal‐measurement (AT‐Dist) where sensors can calculate distances, and angle‐measurement (AT‐Angle) where sensors can calculate angles. These methods determine the position of each sensor while indicating the accuracy of its position. They have two important properties: first, a sensor node can deduce if its estimated position is close to its real position and contribute to the positioning of others nodes; second, a sensor can eliminate wrong information received about its position. This last property allows to manage measure errors that are the main drawback of measure‐based methods such as AT‐Dist and AT‐Angle techniques. By varying the density and the error rate, simulations show that the three proposed techniques achieve good performances in term of high accuracy of localized nodes and less energy consuming while assuming presence of measure errors and considering low number of anchors. Copyright © 2012 John Wiley & Sons, Ltd.     

基于颜色的粒子滤波算法的改进与全硬件实现

传统基于颜色的粒子滤波算法在硬件实现中存在着跟踪效果不理想、实时性差等问题.该文结合硬件电路需要对基于颜色的粒子滤波算法进行了改进,在传统SR重采样算法的基础上将剩余粒子撒向目标点附近,以提高其在硬件环境下跟踪的准确性与稳定性.文中给出了改进算法的全硬件实现的电路架构,并在FPGA上完成了目标跟踪系统的实现.实验表明提...     

Target localization and tracking in noisy binary sensor networks with known spatial topology

Target localization and tracking are two of the critical tasks of sensor networks in many applications. Conventional localization and tracking techniques developed for wireless systems that rely on direction‐of‐arrival (DOA) or time‐of‐arrival (TOA) information are not suitable for low‐power sensors with limited computation and communication capabilities. In this paper, we propose a low‐complexity and energy‐efficient method for target localization and tracking in noisy binary sensor networks, where the sensors can only perform binary detection, and the physical links are characterized by additive white Gaussian noise (AWGN) channels. The proposed method is based on known spatial topology. An efficient wake‐up strategy is used to activate a particular group of sensors for cooperative localization and tracking. We analyze the localization error probability and tracking miss probability in the presence of prediction errors. Simulation results validate the theoretic analysis and demonstrate the effectiveness of the proposed approach. Copyright © 2008 John Wiley & Sons, Ltd.     

一种基于多普勒频率变化率单站无源定位的改进跟踪滤波算法

IMM-PF算法巨大的计算量影响跟踪的实时性,IMM-UKF由于线性化误差使得精度不高.针对这些问题,本文在基于多普勒频率变化率的单站无源定位问题的基础上提出了一种改进的交互式多模型滤波算法（IMMEK-UKFPF）,利用不同的模型匹配不同类型的滤波器,充分发挥了卡尔曼滤波和无迹卡尔曼滤波以及粒子滤波各自的优点.仿真结果表明该算法减少了跟踪定位所用时间,提高了计算效率,同时具有良好的跟踪性能和较强的鲁棒性.     

多机器人定位中基于熵的分布式观测量选择方法

本文提出了多机器人定位中基于熵的分布式观测量选择新方法.在多机器人基于相对观测量的合作定位中,当队列中某个机器人在某时刻获得多个相对观测量时,我们可以融合所有这些观测来更新整个队列的位置及协方差矩阵.但随着机器人个数及观测量的增加,定位计算量将迅速增长,影响了定位的实时性和有效性.为了减轻计算负担、保持定位的实时性,首先对这些观测量进行选择,找出那些具有大的信息量的观测,利用这些观测量来更有效的更新整个队列的位置及协方差矩阵.在保证一定定位精度的前提下,减少了整个队列定位的计算量,提高了定位的实时性和可靠性.我们研究比较了在选择不同数量的观测量的条件下,定位精度和定位时间的变化.仿真实验结果表明,基于熵的分布式观测量选择方法可有效地提高定位的效率,尤其是在机器人个数比较多的情况下,更能显示它的优势.     

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.     

A Survey of Cooperative Games for Cognitive Radio Networks

Cooperative cognitive radio networks are new cognitive radio paradigm. Cooperative communication approaches, such as cooperative spectrum sensing and cooperative spectrum sharing, are playing key roles in the development of cognitive radio networks. To achieve the high performance, a cooperative cognitive communication framework is often used to model various cooperative spectrum sensing or sharing scenarios. However, its implementation faces numerous challenges due to the complexity of mobility and traffic models, the needs of dynamic spectrum access, the heterogeneous requirements from different users, and the distributed structure of the network. Fortunately, cooperative game theory can be used to formulate and model the interactions among licensed and unlicensed users for spectrum sensing and spectrum sharing to efficiently allocate spectrum resource in the highly dynamic and distributed radio environment. In this paper, we first present the cooperative communication technologies and describe their existing challenges, then introduce different game solutions, after that, we discuss several cooperative game strategies, and analyze the associated their applications in cognitive radio networks, at final, some open directions for future research on economic strategies in cooperative communication in cognitive radio networks are proposed.     

Extended Kalman Filter-based localization algorithm by edge computing in Wireless Sensor Networks

The Extended Kalman Filter (EKF) has received abundant attention with the growing demands for robotic localization. The EKF algorithm is more realistic in non-linear systems, which has an autonomous white noise in both the system and the estimation model. Also, in the field of engineering, most systems are non-linear. Therefore, the EKF attracts more attention than the Kalman Filter (KF). In this paper, we propose an EKF-based localization algorithm by edge computing, and a mobile robot is used to update its location concerning the landmark. This localization algorithm aims to achieve a high level of accuracy and wider coverage. The proposed algorithm is helpful for the research related to the use of EKF localization algorithms. Simulation results demonstrate that, under the situations presented in the paper, the proposed localization algorithm is more accurate compared with the current state-of-the-art localization algorithms.     

A new range‐free PCA‐based localization algorithm in wireless sensor networks

Range‐free localization algorithms in wireless sensor networks have been an interesting field for researchers over the past few years. The combining of different requirements such as storage space, computational capacities, communication capabilities, and power efficiency is a challenging aspect of developing a localization algorithm. In this paper, a new range‐free localization algorithm, called PCAL, is proposed using soft computing techniques. The proposed method utilizes hop‐count distances as the data to train and build a neural network. Before feeding the data into the neural network for the purpose of training, the dimensionality of data is reduced by principal component analysis algorithm. The performance of the proposed algorithm is evaluated using simulation. The obtained results show that the proposed algorithm has a better performance in contrast to other algorithms based on storage space, communication overhead, and localization accuracy. Furthermore, the effect of various parameters on the PCAL algorithm is studied.     

Multiobjective optimization‐based DV‐hop localization using NSGA‐II algorithm for wireless sensor networks

Localization is one of the important requirements in wireless sensor networks for tracking and analyzing the sensor nodes. It helps in identifying the geographical area where an event occurred. The event information without its position information has no meaning. In range‐free localization techniques, DV‐hop is one of the main algorithm which estimates the position of nodes using distance vector algorithm. In this paper, a multiobjective DV‐hop localization based Non‐Sorting Genetic Algorithm‐II (NSGA‐II) is proposed in WSNs. Here, we consider six different single‐objective functions to make three multiobjective functions as the combination of two each. Localization techniques based on proposed multiobjective functions has been evaluated on the basis of average localization error and localization error variance. Simulation results demonstrate that the localization scheme based on proposed multiobjective functions can achieve good accuracy and efficiency as compared to state‐of‐the‐art single‐ and multiobjective GA DV‐hop localization scheme.     

Cubature Information Filters Using High-Degree and Embedded Cubature Rules

The information form of the Kalman filter (KF) is preferred over standard covariance filters in multiple sensor fusion problems. Aiming at this issue, two types of cubature information filters (CIF) for nonlinear systems are presented in this article. The two approaches, which we have named the embedded cubature information filter (ECIF) and the fifth-degree cubature information filter (FCIF), are developed from a fifth-degree cubature Kalman filter and a newly proposed embedded cubature KF. Theoretical analysis shows that the proposed filters can achieve higher level estimation accuracy than conventional information filters, such as the CIF and the extended information filter (EIF). Performance comparisons of the proposed information filters with the conventional CIF are demonstrated via two independent multisensor tracking problems. The experimental results, presented herein, demonstrate that the proposed algorithms are more reliable and accurate than the CIF.     

基于Harris Hawks优化算法的介质波导滤波器优化设计

Harris Hawks优化(Harris Hawks optimization, HHO)算法是一种模拟鸟群合作捕食行为的新型群智能算法. 介质波导滤波器是当前5G移动通信设备急需的器件,因此如何利用新型优化算法高效且精确地对介质波导滤波器进行优化设计十分重要. 文中首先描述了HHO算法流程,并结合滤波器优化问题提出了一种通用框架;然后基于稳态假设对HHO算法的更新方程进行了理论分析,依据所导出的方程分析了算法的动态特性及收敛行为;最后利用HHO算法实现了两款介质波导滤波器的优化设计. 为验证算法性能,将本文算法与三个著名的群智能算法进行比较. 实验结果表明,HHO算法的收敛速度、效率和精度都明显优于目前业内主流应用的自适应差分进化算法、花粉授粉优化算法和灰狼优化算法.     

Filtering approaches to accelerated consensus in diffusion sensor networks

The main objective in distributed sensor networks is to reach agreement or consensus on values acquired by the sensors. A common methodology to approach this problem is using the iterative and weighted linear combination of those values to which each sensor has access. Different methods to compute appropriate weights have been extensively studied, but the resulting iterative algorithm still requires many iterations to provide a fairly good estimate of the consensus value. In this paper, different accelerating consensus approaches based on adaptive and non‐adaptive filtering techniques are studied and applied on the problem of acoustic source localization using the adaptive projected subgradient method. A comparative simulation study shows that the non‐adaptive polynomial filters based on Newton's interpolating polynomials and semi‐definite programming can provide more accelerated consensus and better estimation accuracy than adaptive filters evaluated using constrained affine projection algorithm or stochastic gradient algorithm provided that the network topology is known beforehand. Copyright © 2013 John Wiley & Sons, Ltd.     

Cooperative strategies in satellite assisted emergency services

This paper deals with the cooperative strategies, which can be adopted in emergency scenarios by integrating space and terrestrial segments, and communication and localization services. First, the cooperative solutions for integrated Navigation and Communication systems are reviewed and an effective software‐defined radio implementation is described. Then, cooperative systems for broadcast and multicast communications in Incident Area Network are proposed and evaluated: in the broadcast scenario, low‐complexity relaying techniques are adopted to overcome the propagation impairments and the performance degradation; in the multicast system, radio resources management techniques for group communications are designed to allow the efficient use of scarce resources and improve connectivity and reliability of the overall system. The technical solutions have been studied and tested in the framework of the Italian National Research Project SAtellite‐assisted LocalIzation and Communication system for Emergency services [1]. Copyright © 2013 John Wiley & Sons, Ltd.