RSSI-based Localization Algorithms using Spatial Diversity in Wireless Sensor Networks

Accepted for publication in International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC)International audienceMany localization algorithms in Wireless Sensor Networks (WSNs) are based on received signal strength indication (RSSI). Although they present some advantages in terms of complexity and energy consumption, RSSI values, especially in indoor environments, are very unstable due to fading induced by shadowing effect and multipath propagation. In this paper, we propose a comparative study of RSSI-based localization algorithms using spatial diversity in WSNs. We consider different kinds of single / multiple antenna systems: Single Input Single Output (SISO) system, Single Input Multiple Output (SIMO) system, Multiple Input Single Output (MISO) system and Multiple Input Multiple Output (MIMO) system. We focus on the well known trilateration and multilateration localization algorithms to evaluate and compare different antenna systems. Exploiting spatial diversity by using multiple antenna systems improve significantly the accuracy of the location estimation. We use three diversity combining techniques at the receiver: Maximal Ratio Combiner (MRC), Equal Gain Combining (EGC) and Selection Combining (SC). The obtained results show that the localization performance in terms of position accuracy is improved when using multiple antennas. Specifically, using multiple antennas at the both sides present better performance than using multiple antennas at the transmitter as well as the receiver side. We also conclude that MRC diversity combining technique outperforms EGC that as well outperforms SC

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Optimization of positioning capabilities in wireless sensor networks : from power efficiency to medium access

In Wireless Sensor Networks (WSN), the ability of sensor nodes to know its position is an enabler for a wide variety of applications for monitoring, control, and automation. Often, sensor data is meaningful only if its position can be determined. Many WSN are deployed indoors or in areas where Global Navigation Satellite System (GNSS) signal coverage is not available, and thus GNSS positioning cannot be guaranteed. In these scenarios, WSN may be relied upon to achieve a satisfactory degree of positioning accuracy. Typically, batteries power sensor nodes in WSN. These batteries are costly to replace. Therefore, power consumption is an important aspect, being performance and lifetime of WSN strongly relying on the ability to reduce it. It is crucial to design effective strategies to maximize battery lifetime. Optimization of power consumption can be made at different layers. For example, at the physical layer, power control and resource optimization may play an important role, as well as at higher layers through network topology and MAC protocols. The objective of this Thesis is to study the optimization of resources in WSN that are employed for positioning purposes, with the ultimate goal being the minimization of power consumption. We focus on anchor-based positioning, where a subset of the WSN nodes know their location (anchors) and send ranging signals to nodes with unknown position (targets) to assist them in estimating it through distance-related measurements. Two well known of such measurements are received signal strength (RSS) and time of arrival (TOA), in which this Thesis focuses. In order to minimize power consumption while providing a certain quality of positioning service, in this dissertation we research on the problems of power control and node selection. Aiming at a distributed implementation of the proposed techniques, we resort to the tools of non-cooperative game theory. First, transmit power allocation is addressed for RSS based ranging. Using game theory formulation, we develop a potential game leading to an iterated best response algorithm with sure convergence. As a performance metric, we introduce the geometric dilution of precision (GDOP), which is shown to help achieving a suitable geometry of the selected anchor nodes. The proposed scheme and relative distributed algorithms provide good equilibrium performance in both static and dynamic scenarios. Moreover, we present a distributed, low complexity implementation and analyze it in terms of computational complexity. Results show that performance close to that of exhaustive search is possible. We then address the transmit power allocation problem for TOA based ranging, also resorting to a game theoretic formulation. In this setup, and also considering GDOP as performance metric, a supermodular game formulation is proposed, along with a distributed algorithm with guaranteed convergence to a unique solution, based on iterated best response. We analyze the proposed algorithm in terms of the price of anarchy (PoA), that is, compared to a centralized optimum solution, and shown to have a moderate performance loss. Finally, this dissertation addresses the effect of different MAC protocols and topologies in the positioning performance. In this direction, we study the performance of mesh and cluster-tree topologies defined in WSN standards. Different topologies place different constraints in network connectivity, having a substantial impact on the performance of positioning algorithms. While mesh topology allows high connectivity with large energy consumption, cluster-tree topologies are more energy efficient but suffer from reduced connectivity and poor positioning performance. In order to improve the performance of cluster-tree topologies, we propose a cluster formation algorithm. It significantly improves connectivity with anchor nodes, achieving vastly improved positioning performance.En les xarxes de sensors sense fils (WSN), l'habilitat dels nodes sensors per conèixer la seva posició facilita una gran varietat d'aplicacions per la monitorització, el control i l'automatització. Així, les dades que proporciona un sensor tenen sentit només si la posició pot ésser determinada. Moltes WSN són desplegades en interiors o en àrees on la senyal de sistemes globals de navegació per satèl.lit (GNSS) no té prou cobertura, i per tant, el posicionament basat en GNSS no pot ésser garantitzat. En aquests escenaris, les WSN poden proporcionar una bona precisió en posicionament. Normalment, en WSN els nodes són alimentats amb bateries. Aquestes bateries són difícils de reemplaçar. Per tant, el consum de potència és un aspecte important i és crucial dissenyar estratègies efectives per maximitzar el temps de vida de la bateria. L'optimització del consum de potència pot ser fet a diferents capes del protocol. Per exemple, en la capa física, el control de potència i l'optimització dels recursos juguen un rol important, igualment que la topologia de xarxa i els protocols MAC en les capes més altes. L'objectiu d'aquesta tesi és estudiar l¿optimització de recursos en WSN que s'utilitzen per fer posicionament, amb el propòsit de minimitzar el consum de potència. Ens focalitzem en el posicionament basat en àncora, en el qual un conjunt de nodes coneixen la seva localització (nodes àncora) i envien missatges als nodes que no saben la seva posició per ajudar-los a estimar les seves coordenades amb mesures de distància. Dues classes de mesures són la potència de la senyal rebuda (RSS) i el temps d'arribada (TOA) en les quals aquesta tesi està focalitzada. Per minimitzar el consum de potència mentre que es proporciona suficient qualitat en el posicionament, en aquesta tesi estudiem els problemes de control de potència i selecció de nodes. Tenint en compte una implementació distribuïda de les tècniques proposades, utilitzem eïnes de teoria de jocs no cooperatius. Primer, l'assignació de potència transmesa és abordada pel càlcul de la distància amb RSS. Utilitzant la teoria de jocs, desenvolupem un joc potencial que convergeix amb un algoritme iteratiu basat en millor resposta (best response). Com a mètrica d'error, introduïm la dilució de la precisió geomètrica (GDOP) que mostra quant d'apropiada és la geometria dels nodes àncora seleccionats. L'esquema proposat i els algoritmes distribuïts proporcionen una bona resolució de l'equilibri en l'escenari estàtic i dinàmic. Altrament, presentem una implementació distribuïda i analitzem la seva complexitat computacional. Els resultats obtinguts són similars als obtinguts amb un algoritme de cerca exhaustiva. El problema d'assignació de la potència transmesa en el càlcul de la distància basat en TOA, també és tractat amb teoria de jocs. En aquest cas, considerant el GDOP com a mètrica d'error, proposem un joc supermodular juntament amb un algoritme distribuït basat en millor resposta amb convergència garantida cap a una única solució. Analitzem la solució proposada amb el preu de l'anarquia (PoA), és a dir, es compara la nostra solució amb una solució òptima centralitzada mostrant que les pèrdues són moderades. Finalment, aquesta tesi tracta l'efecte que causen diferents protocols MAC i topologies en el posicionament. En aquesta direcció, estudiem les topologies de malla i arbre formant clusters (cluster-tree) que estan definides als estàndards de les WSN. La diferència entre les topologies crea diferents restriccions en la connectivitat de la xarxa, afectant els resultats de posicionament. La topologia de malla permet una elevada connectivitat entre els nodes amb gran consum d'energia, mentre que les topologies d'arbre són més energèticament eficients però amb baixa connectivitat entre els nodes i baix rendiment pel posicionament. Per millorar la qualitat del posicionament en les topologies d'arbre, proposem un algoritme de formació de clústers.Postprint (published version

Wireless Positioning and Tracking for Internet of Things in GPS-denied Environments

Wireless positioning and tracking have long been a critical technology for various applications such as indoor/outdoor navigation, surveillance, tracking of assets and employees, and guided tours, among others. Proliferation of Internet of Things (IoT) devices, the evolution of smart cities, and vulnerabilities of traditional localization technologies to cyber-attacks such as jamming and spoofing of GPS necessitate development of novel radio frequency (RF) localization and tracking technologies that are accurate, energy-efficient, robust, scalable, non-invasive and secure. The main challenges that are considered in this research work are obtaining fundamental limits of localization accuracy using received signal strength (RSS) information with directional antennas, and use of burst and intermittent measurements for localization. In this dissertation, we consider various RSS-based techniques that rely on existing wireless infrastructures to obtain location information of corresponding IoT devices. In the first approach, we present a detailed study on localization accuracy of UHF RF IDentification (RFID) systems considering realistic radiation pattern of directional antennas. Radiation patterns of antennas and antenna arrays may significantly affect RSS in wireless networks. The sensitivity of tag antennas and receiver antennas play a crucial role. In this research, we obtain the fundamental limits of localization accuracy considering radiation patterns and sensitivity of the antennas by deriving Cramer-Rao Lower Bounds (CRLBs) using estimation theory techniques. In the second approach, we consider a millimeter Wave (mmWave) system with linear antenna array using beamforming radiation patterns to localize user equipment in an indoor environment. In the third approach, we introduce a tracking and occupancy monitoring system that uses ambient, bursty, and intermittent WiFi probe requests radiated from mobile devices. Burst and intermittent signals are prominent characteristics of IoT devices; using these features, we propose a tracking technique that uses interacting multiple models (IMM) with Kalman filtering. Finally, we tackle the problem of indoor UAV navigation to a wireless source using its Rayleigh fading RSS measurements. We propose a UAV navigation technique based on Q-learning that is a model-free reinforcement learning technique to tackle the variation in the RSS caused by Rayleigh fading

Indoor localisation by using wireless sensor nodes

This study is devoted to investigating and developing WSN based localisation approaches with high position accuracies indoors. The study initially summarises the design and implementation of localisation systems and WSN architecture together with the characteristics of LQI and RSSI values. A fingerprint localisation approach is utilised for indoor positioning applications. A k-nearest neighbourhood algorithm (k-NN) is deployed, using Euclidean distances between the fingerprint database and the object fingerprints, to estimate unknown object positions. Weighted LQI and RSSI values are calculated and the k-NN algorithm with different weights is utilised to improve the position detection accuracy. Different weight functions are investigated with the fingerprint localisation technique. A novel weight function which produced the maximum position accuracy is determined and employed in calculations. The study covered designing and developing the centroid localisation (CL) and weighted centroid localisation (WCL) approaches by using LQI values. A reference node localisation approach is proposed. A star topology of reference nodes are to be utilized and a 3-NN algorithm is employed to determine the nearest reference nodes to the object location. The closest reference nodes are employed to each nearest reference nodes and the object locations are calculated by using the differences between the closest and nearest reference nodes. A neighbourhood weighted localisation approach is proposed between the nearest reference nodes in star topology. Weights between nearest reference nodes are calculated by using Euclidean and physical distances. The physical distances between the object and the nearest reference nodes are calculated and the trigonometric techniques are employed to derive the object coordinates. An environmentally adaptive centroid localisation approach is proposed.Weighted standard deviation (STD) techniques are employed adaptively to estimate the unknown object positions. WSNs with minimum RSSI mean values are considered as reference nodes across the sensing area. The object localisation is carried out in two phases with respect to these reference nodes. Calculated object coordinates are later translated into the universal coordinate system to determine the actual object coordinates. Virtual fingerprint localisation technique is introduced to determine the object locations by using virtual fingerprint database. A physical fingerprint database is organised in the form of virtual database by using LQI distribution functions. Virtual database elements are generated among the physical database elements with linear and exponential distribution functions between the fingerprint points. Localisation procedures are repeated with virtual database and localisation accuracies are improved compared to the basic fingerprint approach. In order to reduce the computation time and effort, segmentation of the sensing area is introduced. Static and dynamic segmentation techniques are deployed. Segments are defined by RSS ranges and the unknown object is localised in one of these segments. Fingerprint techniques are applied only in the relevant segment to find the object location. Finally, graphical user interfaces (GUI) are utilised with application program interfaces (API), in all calculations to visualise unknown object locations indoors

Indoor wireless communications and applications

Chapter 3 addresses challenges in radio link and system design in indoor scenarios. Given the fact that most human activities take place in indoor environments, the need for supporting ubiquitous indoor data connectivity and location/tracking service becomes even more important than in the previous decades. Specific technical challenges addressed in this section are(i), modelling complex indoor radio channels for effective antenna deployment, (ii), potential of millimeter-wave (mm-wave) radios for supporting higher data rates, and (iii), feasible indoor localisation and tracking techniques, which are summarised in three dedicated sections of this chapter