Anchor nodes placement for effective passive localization

This paper discusses anchor nodes placement for effective passive localization. The authors show that, for effective passive localization, the optimal placement of the anchor nodes is at the center of the network in such a way that no three anchor nodes share linearity

Frame theory and optimal anchor geometries in wireless localization

We revisit the problem of describing optimal anchor geometries that result in the minimum achievable MSE by employing the Cramer Rao Lower bound. Our main contribution is to show that this problem can be cast onto the whelm of modern Frame Theory, which not only provides new insights, but also allows the straightforward generalization of various classical results for the anchor placement problem. For example, by employing the frame potential for single-target localization, we see that the directions of the anchors, as seen from the target, should optimally be as orthogonal as possible, and that the existence of an optimal geometry for an arbitrary number of anchors is governed by the fundamental inequality in frame theory. Furthermore, the frame-theoretic approach allows for the simple derivation of some properties on optimal anchor placement that prove to be useful in a tractable approach for the more complex, multi-target anchor placement problem. In a more general sense, the paper builds a refreshing bridge between the classical problem of wireless localization and the powerful domain of Frame Theory, with far-reaching potential

Anchor Nodes Placement for Effective Passive Localization

Wireless sensor networks are composed of sensor nodes, which can monitor an environment and observe events of interest. These networks are applied in various fields including but not limited to environmental, industrial and habitat monitoring. In many applications, the exact location of the sensor nodes is unknown after deployment. Localization is a process used to find sensor node's positional coordinates, which is vital information. The localization is generally assisted by anchor nodes that are also sensor nodes but with known locations. Anchor nodes generally are expensive and need to be optimally placed for effective localization. Passive localization is one of the localization techniques where the sensor nodes silently listen to the global events like thunder sounds, seismic waves, lighting, etc. According to previous studies, the ideal location to place anchor nodes was on the perimeter of the sensor network. This may not be the case in passive localization, since the function of anchor nodes here is different than the anchor nodes used in other localization systems. I do extensive studies on positioning anchor nodes for effective localization. Several simulations are run in dense and sparse networks for proper positioning of anchor nodes. I show that, for effective passive localization, the optimal placement of the anchor nodes is at the center of the network in such a way that no three anchor nodes share linearity. The more the non-linearity, the better the localization. The localization for our network design proves better when I place anchor nodes at right angles

Doctor of Philosophy

dissertationLocation information of people is valuable for many applications including logistics, healthcare, security and smart facilities. This dissertation focuses on localization of people in wireless sensor networks using radio frequency (RF) signals, speci cally received signal strength (RSS) measurements. A static sensor network can make RSS measurements of the signal from a transmitting badge that a person wears in order to locate the badge. We call this kind of localization method radio device localization. Since the human body causes RSS changes between pairwise sensor nodes of a static network, we can also use RSS measurements from pairwise nodes of a network to locate people, even if they are not carrying any radio device. We call this device-free localization (DFL). The rst contribution of this dissertation is to radio device localization. The human body has a major e ect on the antenna gain pattern of the transmitting badge that the person is wearing, however, existing r

Localization Algorithm with On-line Path Loss Estimation and Node Selection

RSS-based localization is considered a low-complexity algorithm with respect to other range techniques such as TOA or AOA. The accuracy of RSS methods depends on the suitability of the propagation models used for the actual propagation conditions. In indoor environments, in particular, it is very difficult to obtain a good propagation model. For that reason, we present a cooperative localization algorithm that dynamically estimates the path loss exponent by using RSS measurements. Since the energy consumption is a key point in sensor networks, we propose a node selection mechanism to limit the number of neighbours of a given node that are used for positioning purposes. Moreover, the selection mechanism is also useful to discard bad links that could negatively affect the performance accuracy. As a result, we derive a practical solution tailored to the strict requirements of sensor networks in terms of complexity, size and cost. We present results based on both computer simulations and real experiments with the Crossbow MICA2 motes showing that the proposed scheme offers a good trade-off in terms of position accuracy and energy efficiency

Optimization of anchor nodes placement in wireless localization networks

This work focuses on optimizing node placement for time-of-flight-based wireless localization networks. Main motivation are critical safety applications. The first part of my thesis is an experimental study on in-tunnel vehicle localization. In- tunnel localization of vehicles is crucial for emergency management, especially for large trucks transporting dangerous goods such as inflammable chemicals. Compared to open roads, evacuation in tunnels is much more difficult, so that fire or other accidents can cause much more damage. We provide distance measurement error characterization inside road tunnels focusing on time of flight measurements. We design a complete system for in-tunnel radio frequency time-of- flight-based localization and show that such a system is feasible and accurate, and that few nodes are sufficient to cover the entire tunnel. The second part of my work focuses on anchor nodes placement optimization for time-of-flight-based localization networks where multilateration is used to obtain the target position based on its distances from fixed and known anchors. Our main motivation are safety at work applications, in particular, environments such as factory halls. Our goal is to minimize the number of anchors needed to localize the target while keeping the localization uncertainty lower than a given threshold in an area of arbitrary shape with obstacles. Our propagation model accounts for the presence of line of sight between nodes, while geometric dilution of precision is used to express the localization error introduced by multilateration. We propose several integer linear programming formulations for this problem that can be used to obtain optimal solutions to instances of reasonable sizes and compare them in terms of execution times by simulation experiments. We extend our approach to address fault tolerance, ensuring that the target can still be localized after any one of the nodes fails. Two dimensional localization is sufficient for most indoor applications. However, for those industrial environments where the ceiling is very high and the worker might be climbing or be lifted from the ground, or if very high localization precision is needed, three-dimensional localization may be required. Therefore, we extend our approach to three-dimensional localization. We derive the expression for geometric dilution of precision for 3D multilateration and give its geometric interpretation. To tackle problem instances of large size, we propose two novel heuristics: greedy placement with pruning, and its improved version, greedy placement with iterative pruning. We create a simulator to test and compare all our proposed approaches by generating multiple test instances. For anchor placement for multilateration-based localization, we obtain solutions with below 2% anchors overhead with respect to the optimum on average, with around 5s average execution time for 130 candidate positions. For the fault-tolerant version of the same problem, we obtain solutions of around 1% number of anchors overhead with respect to the optimum on average, with 0.4s execution time for 65 candidate positions, by using greedy heuristic with pruning. For 3D placement, the greedy heuristic with iterative pruning produced results of 0.05% of optimum on average, with average execution time of around 6s for 250 candidate positions, for the problem instances we tested

Three-dimensional visible light positioning : an experimental assessment of the importance of the LEDs’ locations

This paper assesses the accuracy of a three-dimensional Visible Light Positioning (VLP) algorithm for two different Light Emitting Diode (LED) configurations using the same four LEDs, but mounted at different locations on the ceiling. The two configurations are both simulated and measured at 22801 test points. It is observed that a classic square LED configuration results in position ambiguities, causing errors up to several meters. Alternatively, a star-shaped LED configuration is able to uniquely reconstruct the photodiode's location. For LEDs at a height of approximately 3 m above the receiver, median errors of 12.7 cm and maximal errors of 21.1 cm are experimentally obtained, showcasing the applicability of 3D VLP for drone navigation