Interference Mitigation in Frequency Hopping Ad Hoc Networks

Radio systems today exhibit a degree of flexibility that was unheard of only a few years ago. Software-defined radio architectures have emerged that are able to service large swathes of spectrum, covering up to several GHz in the UHF bands. This dissertation investigates interference mitigation techniques in frequency hopping ad hoc networks that are capable of exploiting the frequency agility of software-defined radio platforms

Jamming Cognitive Radios

The goal of this thesis is to identify and evaluate weaknesses in the rendezvous process for Cognitive Radio Networks (CRNs) in the presence of a Cognitive Jammer (CJ). Jamming strategies are suggested and tested for effectiveness. Methods for safe- guarding the Cognitive Radios (CRs) against a CJ are also explored. A simulation is constructed to set up a scenario of two CRs interacting with a CJ. Analysis of the simulation is conducted primarily at the waveform level. A hardware setup is constructed to analyze the system in the physical layer, verify the interactions from the simulation, and test in a low signal-to-interference and noise ratio (SINR) environment. The hardware used in this thesis is the Wireless Open-Access Research Platform. Performance metrics from open literature and independent testing are compared against those captured from the jamming tests. The goal of testing is to evaluate and quantify the ability to delay the rendezvous process of a CRN. There was some success in delaying rendezvous, even in a high SINR environment. Jamming strategies include a jammer that repeats an observed channel-hopping pattern, a jammer with random inputs using the same algorithm of the CRs, a jammer that estimates channel-hopping parameters based on observations, and a random channel-hopping jammer. Results were compared against control scenarios, consisting of no jamming and a jammer that is always jamming on the same channel as one of the CRs. The repeater, random inputs to the CR algorithm, observation-based estimation jammer, and the random channel hopping jammer were mildly successful in delaying rendezvous at about 0%, 9%, 0%, and 1%, respectively. The jammer that is always on the same channel as a CR had an overall rendezvous delay about 13% of the time

Adaptive and autonomous protocol for spectrum identification and coordination in ad hoc cognitive radio network

The decentralised structure of wireless Ad hoc networks makes them most appropriate for quick and easy deployment in military and emergency situations. Consequently, in this thesis, special interest is given to this form of network. Cognitive Radio (CR) is defined as a radio, capable of identifying its spectral environment and able to optimally adjust its transmission parameters to achieve interference free communication channel. In a CR system, Dynamic Spectrum Access (DSA) is made feasible. CR has been proposed as a candidate solution to the challenge of spectrum scarcity. CR works to solve this challenge by providing DSA to unlicensed (secondary) users. The introduction of this new and efficient spectrum management technique, the DSA, has however, opened up some challenges in this wireless Ad hoc Network of interest; the Cognitive Radio Ad Hoc Network (CRAHN). These challenges, which form the specific focus of this thesis are as follows: First, the poor performance of the existing spectrum sensing techniques in low Signal to Noise Ratio (SNR) conditions. Secondly the lack of a central coordination entity for spectrum allocation and information exchange in the CRAHN. Lastly, the existing Medium Access Control (MAC) Protocol such as the 802.11 was designed for both homogeneous spectrum usage and static spectrum allocation technique. Consequently, this thesis addresses these challenges by first developing an algorithm comprising of the Wavelet-based Scale Space Filtering (WSSF) algorithm and the Otsu's multi-threshold algorithm to form an Adaptive and Autonomous WaveletBased Scale Space Filter (AWSSF) for Primary User (PU) sensing in CR. These combined algorithms produced an enhanced algorithm that improves detection in low SNR conditions when compared to the performance of EDs and other spectrum sensing techniques in the literature. Therefore, the AWSSF met the performance requirement of the IEEE 802.22 standard as compared to other approaches and thus considered viable for application in CR. Next, a new approach for the selection of control channel in CRAHN environment using the Ant Colony System (ACS) was proposed. The algorithm reduces the complex objective of selecting control channel from an overtly large spectrum space,to a path finding problem in a graph. We use pheromone trails, proportional to channel reward, which are computed based on received signal strength and channel availability, to guide the construction of selection scheme. Simulation results revealed ACS as a feasible solution for optimal dynamic control channel selection. Finally, a new channel hopping algorithm for the selection of a control channel in CRAHN was presented. This adopted the use of the bio-mimicry concept to develop a swarm intelligence based mechanism. This mechanism guides nodes to select a common control channel within a bounded time for the purpose of establishing communication. Closed form expressions for the upper bound of the time to rendezvous (TTR) and Expected TTR (ETTR) on a common control channel were derived for various network scenarios. The algorithm further provides improved performance in comparison to the Jump-Stay and Enhanced Jump-Stay Rendezvous Algorithms. We also provided simulation results to validate our claim of improved TTR. Based on the results obtained, it was concluded that the proposed system contributes positively to the ongoing research in CRAHN

Bootstrapping Cognitive Radio Networks

Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information. To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques. To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create ariii guments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment

Enabling Ultra-Reliable and Low-Latency Communications through Unlicensed Spectrum

© 2018 IEEE. In this article, we aim to address the question of how to exploit the unlicensed spectrum to achieve URLLC. Potential URLLC PHY mechanisms are reviewed and then compared via simulations to demonstrate their potential benefits to URLLC. Although a number of important PHY techniques help with URLLC, the PHY layer exhibits an intrinsic trade-off between latency and reliability, posed by limited and unstable wireless channels. We then explore MAC mechanisms and discuss multi-channel strategies for achieving low-latency LTE unlicensed band access. We demonstrate, via simulations, that the periods without access to the unlicensed band can be substantially reduced by maintaining channel access processes on multiple unlicensed channels, choosing the channels intelligently, and implementing RTS/CTS

QF-MAC: Adaptive, Local Channel Hopping for Interference Avoidance in Wireless Meshes

The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radio access over multiple channels. For reliably mitigating the effect of interference, frequency diversity (e.g., channel hopping) and time diversity (e.g., carrier sense multiple access) are conventionally leveraged to schedule communication channels. However, multi-radio scheduling over a limited set of channels to minimize the effect of interference and maximize network performance in the presence of concurrent network flows remains a challenging problem. The state-of-the-practice in channel scheduling of multi-radios reveals not only gaps in achieving network capacity but also significant communication overhead. This paper proposes an adaptive channel hopping algorithm for multi-radio communication, QuickFire MAC (QF-MAC), that assigns per-node, per-flow ``local'' channel hopping sequences, using only one-hop neighborhood coordination. QF-MAC achieves a substantial enhancement of throughput and latency with low control overhead. QF-MAC also achieves robustness against network dynamics, i.e., mobility and external interference, and selective jamming attacker where a global channel hopping sequence (e.g., TSCH) fails to sustain the communication performance. Our simulation results quantify the performance gains of QF-MAC in terms of goodput, latency, reliability, communication overhead, and jamming tolerance, both in the presence and absence of mobility, across diverse configurations of network densities, sizes, and concurrent flows

Opportunistic Access in Frequency Hopping Cognitive Radio Networks

Researchers in the area of cognitive radio often investigate the utility of dynamic spectrum access as a means to make more efficient use of the radio frequency spectrum. Many studies have been conducted to find ways in which a secondary user can occupy spectrum licensed to a primary user in a manner which does not disrupt the primary user\u27s performance. This research investigates the use of opportunistic access in a frequency hopping radio to mitigate the interference caused by other transmitters in a contentious environment such as the unlicensed 2.4 GHz region. Additionally, this work demonstrates how dynamic spectrum access techniques can be used not only to prevent interfering with other users but also improve the robustness of a communication system