Distance Bounding Protocols on TH-UWB Link and their Analysis over Noisy Channels

Relay attacks represent nowadays a critical threat to authentication protocols. They cab be thwarted by deploying distance bounding protocols on an UWB radio. Exploiting the characteristics of time-hopping UWB radios to enhance distance bounding protocols leads to two design strategies. The first one is based on a secret time-hopping code while the mapping code is public. The second strategy exploits a secret mapping code with a public time-hopping code. The merits of each strategy are established over noise-free and noist channels as well as for different radio parameters

Reliable and Energy Efficient Network Protocols for Wireless Body Area Networks

In a wireless Body Area Network (WBAN) various sensors are attached on clothing, on the body or are even implanted under the skin. The wireless nature of the network and the wide variety of sensors offers numerous new, practical and innovative applications. A motivating example can be found in the world of health monitoring. The sensors of the WBAN measure for example the heartbeat, the body temperature or record a prolonged electrocardiogram. Using a WBAN, the patient experiences a greater physical mobility and is no longer compelled to stay in a hospital. A WBAN imposes the networks some strict and specific requirements. The devices are tiny, leaving only limited space for a battery. It is therefore of uttermost importance to restrict the energy consumption in the network. A possible solution is the development of energy efficient protocols that regulate the communication between the radios. Further, it is also important to consider the reliability of the communication. The data sent contains medical information and one has to make sure that it is correctly received at the personal device. It is not allowed that a critical message gets lost. In addition, a WBAN has to support the heterogeneity of its devices. This thesis focuses on the development of energy efficient and reliable network protocols for WBANs. Considered solutions are the use of multi-hop communication and the improved interaction between the different network layers. Mechanisms to reduce the energy consumption and to grade up the reliability of the communication are presented. In a first step, the physical layer of the communication near the human body is studied and investigated. The probability of a connection between two nodes on the body is modeled and used to investigate which network topologies can be considered as the most energy efficient and reliable. Next, MOFBAN, a lightweight framework for network architecture is presented. Finally, CICADA is presented: a new cross layer protocol for WBANs that both handles channel medium access and routing

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

Doctor of Philosophy

dissertationThe wireless radio channel is typically thought of as a means to move information from transmitter to receiver, but the radio channel can also be used to detect changes in the environment of the radio link. This dissertation is focused on the measurements we can make at the physical layer of wireless networks, and how we can use those measurements to obtain information about the locations of transceivers and people. The first contribution of this work is the development and testing of an open source, 802.11b sounder and receiver, which is capable of decoding packets and using them to estimate the channel impulse response (CIR) of a radio link at a fraction of the cost of traditional channel sounders. This receiver improves on previous implementations by performing optimized matched filtering on the field-programmable gate array (FPGA) of the Universal Software Radio Peripheral (USRP), allowing it to operate at full bandwidth. The second contribution of this work is an extensive experimental evaluation of a technology called location distinction, i.e., the ability to identify changes in radio transceiver position, via CIR measurements. Previous location distinction work has focused on single-input single-output (SISO) radio links. We extend this work to the context of multiple-input multiple-output (MIMO) radio links, and study system design trade-offs which affect the performance of MIMO location distinction. The third contribution of this work introduces the "exploiting radio windows" (ERW) attack, in which an attacker outside of a building surreptitiously uses the transmissions of an otherwise secure wireless network inside of the building to infer location information about people inside the building. This is possible because of the relative transparency of external walls to radio transmissions. The final contribution of this dissertation is a feasibility study for building a rapidly deployable radio tomographic (RTI) imaging system for special operations forces (SOF). We show that it is possible to obtain valuable tracking information using as few as 10 radios over a single floor of a typical suburban home, even without precise radio location measurements

On Random Sampling for Compliance Monitoring in Opportunistic Spectrum Access Networks

In the expanding spectrum marketplace, there has been a long term evolution towards more market€“oriented mechanisms, such as Opportunistic Spectrum Access (OSA), enabled through Cognitive Radio (CR) technology. However, the potential of CR technologies to revolutionize wireless communications, also introduces challenges based upon the potentially non€“deterministic CR behaviour in the Electrospace. While establishing and enforcing compliance to spectrum etiquette rules are essential to realization of successful OSA networks in the future, there has only been recent increased research activity into enforcement. This dissertation presents novel work on the spectrum monitoring aspect, which is crucial to effective enforcement of OSA. An overview of the challenges faced by current compliance monitoring methods is first presented. A framework is then proposed for the use of random spectral sampling techniques to reduce data collection complexity in wideband sensing scenarios. This approach is recommended as an alternative to Compressed Sensing (CS) techniques for wideband spectral occupancy estimation, which may be difficult to utilize in many practical congested scenarios where compliance monitoring is required. Next, a low€“cost computational approach to online randomized temporal sensing deployment is presented for characterization of temporal spectrum occupancy in cognitive radio scenarios. The random sensing approach is demonstrated and its performance is compared to CS€“based approach for occupancy estimation. A novel frame€“based sampling inversion technique is then presented for cases when it is necessary to track the temporal behaviour of individual CRs or CR networks. Parameters from randomly sampled Physical Layer Convergence Protocol (PLCP) data frames are used to reconstruct occupancy statistics, taking account of missed frames due to sampling design, sensor limitations and frame errors. Finally, investigations into the use of distributed and mobile spectrum sensing to collect spatial diversity to improve the above techniques are presented, for several common monitoring tasks in spectrum enforcement. Specifically, focus is upon techniques for achieving consensus in dynamic topologies such as in mobile sensing scenarios