Is Our Model for Contention Resolution Wrong?

Randomized binary exponential backoff (BEB) is a popular algorithm for coordinating access to a shared channel. With an operational history exceeding four decades, BEB is currently an important component of several wireless standards. Despite this track record, prior theoretical results indicate that under bursty traffic (1) BEB yields poor makespan and (2) superior algorithms are possible. To date, the degree to which these findings manifest in practice has not been resolved. To address this issue, we examine one of the strongest cases against BEB: $n$ packets that simultaneously begin contending for the wireless channel. Using Network Simulator 3, we compare against more recent algorithms that are inspired by BEB, but whose makespan guarantees are superior. Surprisingly, we discover that these newer algorithms significantly underperform. Through further investigation, we identify as the culprit a flawed but common abstraction regarding the cost of collisions. Our experimental results are complemented by analytical arguments that the number of collisions -- and not solely makespan -- is an important metric to optimize. We believe that these findings have implications for the design of contention-resolution algorithms.Comment: Accepted to the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks

From MANET to people-centric networking: Milestones and open research challenges

In this paper, we discuss the state of the art of (mobile) multi-hop ad hoc networking with the aim to present the current status of the research activities and identify the consolidated research areas, with limited research opportunities, and the hot and emerging research areas for which further research is required. We start by briefly discussing the MANET paradigm, and why the research on MANET protocols is now a cold research topic. Then we analyze the active research areas. Specifically, after discussing the wireless-network technologies, we analyze four successful ad hoc networking paradigms, mesh networks, opportunistic networks, vehicular networks, and sensor networks that emerged from the MANET world. We also present an emerging research direction in the multi-hop ad hoc networking field: people centric networking, triggered by the increasing penetration of the smartphones in everyday life, which is generating a people-centric revolution in computing and communications

Spectrum handoff strategy for cognitive radio-based Mac in industrial wirless sensor and actuator networks

In this thesis, a Cognitive Radio(CR)-based MAC for Industrial Wireless Sensor and Actuator Network (IWSAN) applications is proposed. IWSANs are typically used for closed-loop control applications, and they demand strict requirements in terms of time and robustness. Low latency and low error rates are required in order not to endanger persons or machinery. Moreover, these applications operate in industrial environments such as factories or transport scenarios (as aeronautics or railway) where multipath fading and shadowing are present due to metal surfaces. Furthermore, interference from other communication systems or industrial machinery is also common in these environments. The proposed MAC, based on the CR paradigm, is capable of ensuring time and robustness requirements in industrial channels. In the process of designing the CR-based MAC for IWSAN applications, a comparison between several non-CR-based MACs and CR-based MACs has been carried out. This comparison, which allows stating the benefits of CR for these applications, is presented in this thesis. The performance of every MAC is determined theoretically using Network Calculus, and it is validated through OPNET simulations. CR solutions, due to their adaptability characteristics, are capable of avoiding interference and ensuring robustness in industrial environments. However, none of the selected MACs are capable of ensuring robustness without comprising time requirements, since interference is avoided but not in a bounded time. On the other hand, the MAC proposed in this thesis is capable of avoiding interference ensuring time and robustness requirements at the same time. This MAC is therefore suitable for IWSAN applications. To ensure a deterministic behavior against interference, a novel handoff algorithm, which detects interference and hops to another channel, has been proposed. This algorithm has been designed to be used jointly with one of the evaluated MACs. The detection of the interference and the hop to another channel is done in a bounded time, because the proposed algorithm detects interference while the system is transmitting. The performance of this proposal is evaluated using Network Calculus and OPNET simulations, and the results are compared with the system without the proposed handoff algorithm. The comparison of the results shows how the evaluated MAC is only capable of ensuring both time and robustness requirements when the proposed handoff strategy is used. Moreover, the spectrum sensing algorithm used to obtain information about the environment is delved and its performance is measured through MATLAB simulations. An energy detector has been chosen due to its simplicity. Also, a cyclostationary Modulation Classifier is presented and a simplification has been carried out allowing its implementation on real hardware. The Modulation Classifier is capable of distinguishing between OFDM, QPSK and GFSK signals. The performance of the algorithm is presented in this thesis for different signals and for different receiver impairments such as frequency offset, DC offset and I/Q imbalance. Finally, a cognitive platform to validate the spectrum sensing algorithms is presented. This platform has been designed using a Xilinx Virtex 6 FPGA by a working group composed of researchers from IK4-Ikerlan and Mondragon Unibertsitatea. The platform, which uses both spectrum sensing algorithms, is an Ethernet-to-RF bridge. It has been designed to replace an Ethernet wired link by a wireless one for IWSAN applications. The proposed platform ensures a reliable communication link against interference. In the proposed implementation, the energy detector is used by the transmitter in order to find a free channel to transmit data, whereas the modulation classifier is used by the receiver in order to distinguish between the signal transmitted by the RF-Ethernet bridge and other signals. In this way the receiver can find the channel where the transmitter is carrying out the communication.En esta tesis se propone una MAC basada en el paradigma de la Radio Cognitiva (RC) para redes de sensores y actuadores inalámbricos industriales. Estas redes se suelen utilizar para aplicaciones de control en lazo cerrado, que exigen requisitos estrictos de tiempo y robustez. Para no poner en peligro la salud de las personas o la maquinaria es necesario que la red asegure una baja latencia y una tasa baja de errores. Además, al trabajar en ambientes industriales como fábricas o transportes (trenes, aviones, etc.), estas redes tienen que hacer frente a canales con mucho desvanecimiento por multitrayecto y efecto sombra debido a las superficies metálicas. También es común en estos entornos que haya interferencias de otros sistemas de comunicaciones o de la propia maquinaria industrial. La MAC propuesta en esta tesis es capaz de asegurar los requisitos temporales y de robustez demandados trabajando en este tipo de entornos. En el proceso de diseño de la MAC basada en RC para redes de sensores y actuadores inalámbricos industriales, se ha llevado a cabo una comparación de diferentes MACs diseñadas para estas redes. Se han evaluado tanto MACs basadas en RC como no basadas en ella, estableciendo las ventajas de la RC para estas aplicaciones. La evaluación se ha llevado a cabo haciendo un estudio teórico mediante Network Calculus, cuyos resultados se han validado mediante simulaciones en OPNET. Los resultados muestran como la RC es capaz de evitar interferencias y asegurar robustez en ambientes industriales. Sin embargo, ninguna de las MACs seleccionadas ha conseguido asegurar ambos requisitos, temporales y de robustez, al mismo tiempo; se puede evitar las interferencias pero no sin comprometer los requisitos temporales de la aplicación. Sin embargo, la MAC propuesta es capaz de evitar interferencias asegurando al mismo tiempo los requisitos temporales y de robustez. Por lo tanto, la MAC propuesta es apropiada para este tipo de redes. Para asegurar el comportamiento determinista del sistema, se ha propuesto un novedoso algoritmo de handoff que es capaz de detectar una interferencia y saltar a otro canal. Este algoritmo se ha diseñado para ser utilizado conjuntamente con una de las MACs previamente evaluadas. La detección de la interferencia y el salto a otro canal se hace en un tiempo determinado de tiempo, ya que es posible detectar interferencias mientras el sistema está transmitiendo. Su rendimiento se ha evaluado mediante Network Calculus y simulaciones en OPNET, y se ha comparado con los resultados obtenidos con la MAC cuando no se utiliza el esquema propuesto. De la comparación se deduce que el esquema de handoff añade a la MAC la capacidad de asegurar a la vez los requisitos temporales y de robustez. Además, en la tesis se explica el algoritmo de spectrum sensing que la MAC utiliza para obtener información del entorno, y su rendimiento se ha estudiado mediante simulaciones en MATLAB. Debido a su simplicidad, se ha optado por un detector de energía para este propósito. También se presenta un clasificador de modulaciones cicloestacionario. Este clasificador ha sido simplificado todo lo posible para posibilitar su implementación en hardware real. El clasificador de modulaciones es capaz de distinguir entre señales OFDM, QPSK y GFSK. Su rendimiento se detalla para diferentes señales y para diferentes deficiencias presentes en el receptor, como son offset de frecuencia, offset de continua o desequilibrios I/Q. Por último, se presenta una plataforma cognitiva que se ha utilizado para validar los algoritmos de spectrum sensing. Un grupo de trabajo compuesto por investigadores de IK4-Ikerlan y Mondragon Unibertsitatea ha diseñado esta plataforma sobre una FPGA Virtex 6 de Xilinx. La plataforma, que utiliza los dos algoritmos de spectrum sensing, es un puente Ethernet-RF. Su objetivo es reemplazar un enlace cableado de Ethernet por uno inalámbrico para aplicaciones de redes de sensores y actuadores industriales. Gracias a los algoritmos de spectrum sensing, la plataforma es capaz de asegurar un enlace robusto ante interferencias. El detector de energía se utiliza en el transmisor para encontrar los posibles canales libres donde transmitir la información. Mientras que el clasificador de modulaciones se utiliza en el receptor para distinguir entre la señal del transmisor y otras posibles señales. Esto permite al receptor saber en qué canal de todos los posibles está el transmisor.Tesi honetan proposatzen da Irrati Kognitiboaren (IK) paradigman oinarritutako MAC bat industriako haririk gabeko sentsore eta eragingailuen sareetarako. Sare horiek begizta itxiko kontrol aplikazioetarako erabili ohi dira, denbora eta sendotasunaren aldetik baldintza ugari eskatzen dute eta. Pertsonen osasuna eta makinak arriskuan ez jartzeko, beharrezkoa da sareak latentzia eta hutsegite tasa txikiak bermatzea. Gainera, industri giroetan lan egiteko direnez, esaterako, lantegietan edo garraioetan (trenak, hegazkinak, etab.), sare horiek gai izan behar dira gainazal metalikoek eragiten dituzten ibilbide aniztunaren eta itzal efektuaren ondorioz asko barreiatzen diren kanalei aurre egiteko. Ingurune horien ohiko ezaugarria da, baita ere, beste komunikazio sistema batzuen edo industriako makinen beraien interferentziak egotea. Tesi honetan proposatzen den MACa gai da honelako inguruetan lan egiteko denborari eta sendotasunari dagokienez eskatzen dituen baldintzak ziurtatzeko. IKan oinarrituta haririk gabeko sentsore eta eragingailu industrialen sareetarako MACa diseinatzeko prozesuan, horrelako sareetarako aurkeztu diren hainbat MAC alderatu dira. IKan oinarritutako MACak zein bestelakoak ebaluatu dira, eta IKak aplikazio hauetarako dituen abantailak ezarri dira. Ebaluaziorako Network Calculus erabili da, zeinaren bidez azterketa teoriko bat egin baita, eta azterketaren emaitzak OPNETen simulazioak eginda baliozkotu dira. Emaitzek erakusten dutenez, IKa gai da industriako inguruneetan interferentziak ekidin eta sendotasuna ziurtatzeko. Halere, aukeratu diren MACetatik batek ere ez du lortu baldintza biak, denborari buruzkoa zein sendotasunari buruzkoa, aldi berean ziurtatzea; interferentziak ekidin daitezke, baina ez aplikazioaren denborari buruzko baldintzak arriskuan jarri gabe. Dena dela, proposatu den MACak portaera determinista bat ziurtatzen du interferentziekiko, eta aldi berean denborari eta sendotasunari buruzko baldintzak ere ziurtatzen ditu. Hortaz, MAC hau egokia da sare mota honetarako. Sistemaren portaera determinista ziurtatzeko, handoff algoritmo berritzailea proposatu da, zeina interferentzia bat antzeman eta beste kanal bat igarotzeko gai den. Algoritmo hori aurretik ebaluatutakoa MACetako batekin batera erabiltzeko diseinatu da. Interferentzia antzeman eta beste kanal batera salto egitea denbora jakin batean egiten da, izan ere, sistema transmititzen ari dela antzeman baitaitezke interferentziak. Network Calculusen bitartez eta OPNETeko simulazioen bitartez ebaluatu da sistemaren errendimendua, eta proposatutako eskema erabiltzen ez denean MACak ematen dituen emaitzekin alderatu da. Alderaketa horretatik ondorioztatzen denez, handoff eskemak denborari eta sendotasunari buruzko baldintzak batera ziurtatzeko ahalmena ematen dio MACari. Gainera, tesiak azaltzen du inguruneari buruzko informazioa eskuratzeko MACak erabiltzen duen spectrum sensing algoritmoa, eta bere errendimendua MATLABen simulazioak eginez aztertu da. Bere sinpletasuna dela eta, energia detektore bat aukeratu da asmo honetarako. Modulazio sailkatzaile zikloegonkor bat ere aurkezten da. Sailkapen hori ahalik eta gehien sinplifikatu da benetako hardwarean inplementatu ahal izateko. Modulazioen sailkatzaileak OFDM, QPSK eta GFSK seinaleak bereizi ditzake. Bere errendimendua hargailuan dauden seinale eta akats desberdinetarako zehazten da, esaterako maiztasunaren offset-a,zuzenaren offset-a edo I/Q desorekak. Bukatzeko, spectrum sensing-eko algoritmoak baliozkotzeko erabili den plataforma kognitibo bat aurkezten da. IK4-Ikerlaneko eta Mondragon Unibertsitateko ikertzailez osatutako lantalde batek diseinatu du plataforma hori Xilinxen Virtex 6 FPGA baten oinarrutz. Plataformak spectrum sensing-eko bi algoritmo erabiltzen ditu eta Ethernet-RF zubi bat da. Bere helburua da Etherneteko kable bidezko lotura bat haririk gabeko batekin ordeztea industriako sentsore eta eragingailuen sareetan aplikatzeko. Spectrum sensing-eko algoritmoei esker, plataformak lotura sendoa bermatu dezake interferentziak gertatzen direnean. Energia detektorea transmisorean erabiltzen da informazioa transmititzeko erabilgarri egon daitezkeen kanalak aurkitzeko. Modulazioen sailkatzailea, berriz, hargailuan erabiltzen da transmisorearen seinalea eta egon daitezkeen beste seinale batzuk bereizteko. Horri esker, hargailuak badaki posible diren kanal guztietatik non dagoen transmisorea

Interference-aware adaptive spectrum management for wireless networks using unlicensed frequency bands

The growing demand for ubiquitous broadband network connectivity and continuously falling prices in hardware operating on the unlicensed bands have put Wi-Fi technology in a position to lead the way in rapid innovation towards high performance wireless for the future. The success story of Wi-Fi contributed to the development of widespread variety of options for unlicensed access (e.g., Bluetooth, Zigbee) and has even sparked regulatory bodies in several countries to permit access to unlicensed devices in portions of the spectrum initially licensed to TV services. In this thesis we present novel spectrum management algorithms for networks employing 802.11 and TV white spaces broadly aimed at efficient use of spectrum under consideration, lower contention (interference) and high performance. One of the target scenarios of this thesis is neighbourhood or citywide wireless access. For this, we propose the use of IEEE 802.11-based multi-radio wireless mesh network using omnidirectional antennae. We develop a novel scalable protocol termed LCAP for efficient and adaptive distributed multi-radio channel allocation. In LCAP, nodes autonomously learn their channel allocation based on neighbourhood and channel usage information. This information is obtained via a novel neighbour discovery protocol, which is effective even when nodes do not share a common channel. Extensive simulation-based evaluation of LCAP relative to the state-of-the-art Asynchronous Distributed Colouring (ADC) protocol demonstrates that LCAP is able to achieve its stated objectives. These objectives include efficient channel utilisation across diverse traffic patterns, protocol scalability and adaptivity to factors such as external interference. Motivated by the non-stationary nature of the network scenario and the resulting difficulty of establishing convergence of LCAP, we consider a deterministic alternative. This approach employs a novel distributed priority-based mechanism where nodes decide on their channel allocations based on only local information. Key enabler of this approach is our neighbour discovery mechanism. We show via simulations that this mechanism exhibits similar performance to LCAP. Another application scenario considered in this thesis is broadband access to rural areas. For such scenarios, we consider the use of long-distance 802.11 mesh networks and present a novel mechanism to address the channel allocation problem in a traffic-aware manner. The proposed approach employs a multi-radio architecture using directional antennae. Under this architecture, we exploit the capability of the 802.11 hardware to use different channel widths and assign widths to links based on their relative traffic volume such that side-lobe interference is mitigated. We show that this problem is NP-complete and propose a polynomial time, greedy channel allocation algorithm that guarantees valid channel allocations for each node. Evaluation of the proposed algorithm via simulations of real network topologies shows that it consistently outperforms fixed width allocation due to its ability to adapt to spatio-temporal variations in traffic demands. Finally, we consider the use of TV-white-spaces to increase throughput for in-home wireless networking and relieve the already congested unlicensed bands. To the best of our knowledge, our work is the first to develop a scalable micro auctioning mechanism for sharing of TV white space spectrum through a geolocation database. The goal of our approach is to minimise contention among secondary users, while not interfering with primary users of TV white space spectrum (TV receivers and microphone users). It enables interference-free and dynamic sharing of TVWS among home networks with heterogeneous spectrum demands, while resulting in revenue generation for database and broadband providers. Using white space availability maps from the UK, we validate our approach in real rural, urban and dense-urban residential scenarios. Our results show that our mechanism is able to achieve its stated objectives of attractiveness to both the database provider and spectrum requesters, scalability and efficiency for dynamic spectrum distribution in an interference-free manner