An Integrated Software Framework for Localization in Wireless Sensor Network

Devices that form a wireless sensor network (WSN) system are usually remotely deployed in large numbers in a sensing field. WSNs have enabled numerous applications, in which location awareness is usually required. Therefore, numerous localization systems are provided to assign geographic coordinates to each node in a network. In this paper, we describe and evaluate an integrated software framework WSNLS (Wireless Sensor Network Localization System) that provides tools for network nodes localization and the environment for tuning and testing various localization schemes. Simulation experiments can be performed on parallel and multi-core computers or computer clusters. The main component of the WSNLS framework is the library of solvers for calculating the geographic coordinates of nodes in a network. Our original solution implemented in WSNLS is the localization system that combines simple geometry of triangles and stochastic optimization to determine the position of nodes with unknown location in the sensing field. We describe and discuss the performance of our system due to the accuracy of location estimation and computation time. Numerical results presented in the paper confirm that our hybrid scheme gives accurate location estimates of network nodes in sensible computing time, and the WSNLS framework can be successfully used for efficient tuning and verification of different localization techniques

HEA-Loc: A robust localization algorithm for sensor networks of diversified topologies

In recent years, localization in a variety of Wireless Sensor Networks (WSNs) is a compelling but elusive goal. Several algorithms that use different methodologies have been proposed to achieve this goal. The performances of these algorithms depend on several factors, such as the sensor node placement, anchor deployment or network topology. In this paper, we propose a robust localization algorithm called Hybrid Efficient and Accurate Localization (HEA-Loc). HEA-Loc combines two techniques, Extended Kalman Filter (EKF) and Proximity-Distance Map (PDM) to improve localization accuracy. It is distributed in nature and works well in various scenarios as it is less susceptible to anchors deployment and the network topology. Furthermore, HEA-Loc has strong robustness and it can work well even the measurement errors are large. Simulation results show that HEA-Loc outperforms existing algorithms in both computational complexity and communication overhead. ©2010 IEEE.published_or_final_versionThe IEEE Wireless Communications and Networking Conference (WCNC 2010), Sydney, NSW., 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-

Low Cost, Low Complexity Sensor Design for Non-Cooperative Geolocation via Received Signal Strength

Obtaining accurate non-cooperative geolocation is vital for persistent surveillance of a hostile emitter. Current research for developing a small, cheap and energy efficient sensor network for non-cooperative geolocation measurements via received signal strength (RSS) is limited. Most existing work focuses on simulating a non-cooperative network (NN) and in doing so, simulated models often ignore localization errors caused from the hardware processing raw RSS data and often model environment-dependent errors as random. By comparing real-time measured non-cooperative geolocation data to a simulated system a more accurate model can be developed. This thesis discusses the development and performance of a small, low cost, low complexity, and energy efficient sensor network that can locate a NN via RSS. The main focus of this research effort is designing a Poor Man\u27s Spectrum Analyzer (PMSA) to locate a wireless device in a non-cooperative network (NN) that is transmitting in the Industrial, Scientific and Medical (ISM) radio band of 2.403 GHz to 2.48 GHz by measuring the emitter\u27s received signal strength (RSS)

Evaluation and Analysis of Node Localization Power Cost in Ad-Hoc Wireless Sensor Networks with Mobility

One of the key concerns with location-aware Ad-hoc Wireless Sensor Networks (AWSNs) is how sensor nodes determine their position. The inherent power limitations of an AWSN along with the requirement for long network lifetimes makes achieving fast and power-efficient localization vital. This research examines the cost (in terms of power) of network irregularities on communications and localization in an AWSN. The number of data bits transmitted and received are significantly affected by varying levels of mobility, node degree, and network shape. The concurrent localization approach, used by the APS-Euclidean algorithm, has significantly more accurate position estimates with a higher percentage of nodes localized, while requiring 50% less data communications overhead, than the Map-Growing algorithm. Analytical power models capable of estimating the power required to localize are derived. The average amount of data communications required by either of these algorithms in a highly mobile network with a relatively high degree consumes less than 2.0% of the power capacity of an average 560mA-hr battery. This is less than expected and contrary to the common perception that localization algorithms consume a significant amount of a node\u27s power

Fly, Wake-up, Find: UAV-based Energy-efficient Localization for Distributed Sensor Nodes

A challenging application scenario in the field of industrial Unmanned Aerial Vehicles (UAVs) is the capability of a robot to find and query smart sensor nodes deployed at arbitrary locations in the mission area. This work explores the combination of different communication technologies, namely, Ultra-Wideband (UWB) and Wake-Up Radio (WUR), with a UAV that acts as a "ubiquitous local-host"of a Wireless Sensor Network (WSN). First, the UAV performs the localization of the sensor node via multiple UWB range measurements, and then it flies in its proximity to perform energy-efficient data acquisition. We propose an energy-efficient and accurate localization algorithm - based on multi-lateration - that is computationally inexpensive and robust to in-field noise. Aiming at minimizing the sensor node energy consumption, we also present a communication protocol that leverages WUR technology to minimize ON-time of the power-hungry UWB transceiver on the sensors. In-field experimental evaluation demonstrates that our approach achieves a sub-meter localization precision of the sensor nodes - i.e., down to 0.6 m - using only three range measurements, and runs in 4 ms on a low power microcontroller (ARM Cortex-M4F). Due to the presence of the WUR and the proposed lightweight algorithm, the entire localization-acquisition cycle requires only 31 mJ on the sensor node. The approach is suitable for several emerging Industrial Internet of Things application scenarios where a mobile vehicle needs to estimate the location of static objects without any precise knowledge of their position

DPC-Net: Deep Pose Correction for Visual Localization

We present a novel method to fuse the power of deep networks with the computational efficiency of geometric and probabilistic localization algorithms. In contrast to other methods that completely replace a classical visual estimator with a deep network, we propose an approach that uses a convolutional neural network to learn difficult-to-model corrections to the estimator from ground-truth training data. To this end, we derive a novel loss function for learning SE(3) corrections based on a matrix Lie groups approach, with a natural formulation for balancing translation and rotation errors. We use this loss to train a Deep Pose Correction network (DPC-Net) that predicts corrections for a particular estimator, sensor and environment. Using the KITTI odometry dataset, we demonstrate significant improvements to the accuracy of a computationally-efficient sparse stereo visual odometry pipeline, that render it as accurate as a modern computationally-intensive dense estimator. Further, we show how DPC-Net can be used to mitigate the effect of poorly calibrated lens distortion parameters.Comment: In IEEE Robotics and Automation Letters (RA-L) and presented at the IEEE International Conference on Robotics and Automation (ICRA'18), Brisbane, Australia, May 21-25, 201

Exploiting partial reconfiguration through PCIe for a microphone array network emulator

The current Microelectromechanical Systems (MEMS) technology enables the deployment of relatively low-cost wireless sensor networks composed of MEMS microphone arrays for accurate sound source localization. However, the evaluation and the selection of the most accurate and power-efficient network’s topology are not trivial when considering dynamic MEMS microphone arrays. Although software simulators are usually considered, they consist of high-computational intensive tasks, which require hours to days to be completed. In this paper, we present an FPGA-based platform to emulate a network of microphone arrays. Our platform provides a controlled simulated acoustic environment, able to evaluate the impact of different network configurations such as the number of microphones per array, the network’s topology, or the used detection method. Data fusion techniques, combining the data collected by each node, are used in this platform. The platform is designed to exploit the FPGA’s partial reconfiguration feature to increase the flexibility of the network emulator as well as to increase performance thanks to the use of the PCI-express high-bandwidth interface. On the one hand, the network emulator presents a higher flexibility by partially reconfiguring the nodes’ architecture in runtime. On the other hand, a set of strategies and heuristics to properly use partial reconfiguration allows the acceleration of the emulation by exploiting the execution parallelism. Several experiments are presented to demonstrate some of the capabilities of our platform and the benefits of using partial reconfiguration