Related papers: Recovery of Localization Errors in Sensor Networks…
Understanding the dynamics of complex systems is a central task in many different areas ranging form biology via epidemics to economics and engineering. Unexpected behaviour of dynamic systems or even systems failure is sometimes difficult…
Cooperative geolocation has attracted significant research interests in recent years. A large number of localization algorithms rely on the availability of statistical knowledge of measurement errors, which is often difficult to obtain in…
A Semidefinite Programming (SDP) relaxation is an effective computational method to solve a Sensor Network Localization problem, which attempts to determine the locations of a group of sensors given the distances between some of them [11].…
We consider a registration-based approach for localizing sensor networks from range measurements. This is based on the assumption that one can find overlapping cliques spanning the network. That is, for each sensor, one can identify…
The localization problem in a wireless sensor network is to determine the coordination of sensor nodes using the known positions of some nodes (called anchors) and corresponding noisy distance measurements. There is a variety of different…
We consider the anchor placement problem in localization based on one-way ranging, in which either the sensor or the anchors send the ranging signals. The number of anchors deployed over a geographical area is generally sparse, and we show…
We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and a number of reference nodes at known positions.…
The conventional solutions for fault-detection, identification, and reconstruction (FDIR) require centralized decision-making mechanisms which are typically combinatorial in their nature, necessitating the design of an efficient distributed…
We address the problem of distributed cooperative localization in wireless networks, i.e. nodes without prior position knowledge (agents) wish to determine their own positions. In non-cooperative approaches, positioning is only based on…
In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted wireless sensor networks (WSNs). In this scheme, a mobile anchor (MA) node cooperates with static sensor nodes and…
This paper studies a coordinate alignment problem for cooperative mobile sensor network localization with range-based measurements. The network consists of target nodes, each of which has only access position information in a local fixed…
In this paper, the problem of target localization in the presence of outlying sensors is tackled. This problem is important in practice because in many real-world applications the sensors might report irrelevant data unintentionally or…
This manuscript is a preliminary pre-print version of a journal submission by the authors, revisiting the problem of range measurement based localization of a signal source or a sensor. The major geometric difficulty of the problem comes…
We report two decentralized multi-agent cooperative localization algorithms in which, to reduce the communication cost, inter-agent state estimate correlations are not maintained but accounted for implicitly. In our first algorithm, to…
Sensor selection is an important design problem in large-scale sensor networks. Sensor selection can be interpreted as the problem of selecting the best subset of sensors that guarantees a certain estimation performance. We focus on…
As the world becomes more and more interconnected, our everyday objects become part of the Internet of Things, and our lives get more and more mirrored in virtual reality, where every piece of~information, including misinformation, fake…
This work proposes a novel approach to reinforce localization security in wireless networks in the presence of malicious nodes that are able to manipulate (spoof) radio measurements. It substitutes the original measurement model by another…
We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization…
Cooperative localization is a promising solution to improve the accuracy and overcome the shortcomings of GNSS. Cooperation is often achieved by measuring the distance between users. To optimally integrate a distance measurement between two…
A new method for estimating the relative positions of location-unaware nodes from the location-aware nodes and the received signal strength (RSS) between the nodes, in a wireless sensor network (WSN), is proposed. In the method, a…