Detection performance and mitigation techniques in CR networks

Pervasive wireless communications rely enormously on spectrum utilization; the increase in demand for new wireless services and their application has led to spectrum scarcity. Spectrum limitations can be resolved by cognitive radio (CR) which is a technology that allows secondary users (SUs) to use the spectrum when it is not occupied by primary users (PUs). In this thesis, the security issues that decrease CR performance are discussed; there are two major threats i.e. primary user emulation attack (PUEA) and spectrum sensing data falsification attack (SSDF). Firstly, the CR network (CRN) is simulated whereby PUs and SUs are presented in the system with the presence of multiple malicious users that are randomly located within a circle of radius (R). The simulation results, based on an analytical model, show that the false alarm probability is significantly affected by the network radius Rand malicious users' number, and it is proved that there is a range of R over which the PUEAs are most successful. Secondly, a transmitter verification scheme (direct scheme) and indirect trust scheme that considers the users' history are presented; the results proved that if the signal to noise ratio (SNR) is raised, correspondingly the t:rnstworthiness of the PU is considerably increased. Based on these two schemes, the trnstworthiness of the PU is much higher than that of the malicious user and because the indirect scheme considers the historical behaviour of the user, it improves the user's trustworthiness.Finally, cooperative spectrum sensing (CSS) approaches are proposed, namely, a trust based approach, a punishment based approach and a dedicated punishment based approach. It is proved that these proposed CSS approaches outperform the traditional majority scheme despite a high number of malicious users. In addition, the dedicated punishment approaches which punish only the malicious users outperform the other approaches

Data Aggregation Scheduling in Wireless Networks

Data aggregation is one of the most essential data gathering operations in wireless networks. It is an efficient strategy to alleviate energy consumption and reduce medium access contention. In this dissertation, the data aggregation scheduling problem in different wireless networks is investigated. Since Wireless Sensor Networks (WSNs) are one of the most important types of wireless networks and data aggregation plays a vital role in WSNs, the minimum latency data aggregation scheduling problem for multi-regional queries in WSNs is first studied. A scheduling algorithm is proposed with comprehensive theoretical and simulation analysis regarding time efficiency. Second, with the increasing popularity of Cognitive Radio Networks (CRNs), data aggregation scheduling in CRNs is studied. Considering the precious spectrum opportunity in CRNs, a routing hierarchy, which allows a secondary user to seek a transmission opportunity among a group of receivers, is introduced. Several scheduling algorithms are proposed for both the Unit Disk Graph (UDG) interference model and the Physical Interference Model (PhIM), followed by performance evaluation through simulations. Third, the data aggregation scheduling problem in wireless networks with cognitive radio capability is investigated. Under the defined network model, besides a default working spectrum, users can access extra available spectrum through a cognitive radio. The problem is formalized as an Integer Linear Programming (ILP) problem and solved through an optimization method in the beginning. The simulation results show that the ILP based method has a good performance. However, it is difficult to evaluate the solution theoretically. A heuristic scheduling algorithm with guaranteed latency bound is presented in our further investigation. Finally, we investigate how to make use of cognitive radio capability to accelerate data aggregation in probabilistic wireless networks with lossy links. A two-phase scheduling algorithm is proposed, and the effectiveness of the algorithm is verified through both theoretical analysis and numerical simulations

Cognitive radio adaptive rendezvous protocols to establish network services for a disaster response

Disasters are catastrophic events that cause great damage or loss of life. In disasters, communication services might be disrupted due to damage to the existing network infrastructure. Temporary systems are required for victims and first responders, but installing them requires information about the radio environment and available spectrum. A cognitive radio (CR) can be used to provide a flexible and rapidly deployable temporary system due to its sensing, learning and decision-making capabilities. This thesis initially examines the potential of CR technology for disaster response networks (DRN) and shows that they are ideally suited to fulfill the requirements of a DRN. A software defined radio based prototype for multiple base transceiver stations based cellular network is proposed and developed. It is demonstrated that system can support a large number of simultaneous calls with sufficient call quality, but only when the background interference is low. It is concluded that to provide call quality with acceptable latency and packet losses, the spectrum should be used dynamically for backhaul connectivity. The deployment challenges for such a system in a disaster include the discovery of the available spectrum, existing networks, and neighbours. Furthermore, to set up a network and to establish network services, initially CR nodes are required to establish a rendezvous. However, this can be challenging due to unknown spectrum information, primary radio (PR) activity, nodes, and topology. The existing rendezvous strategies do not fulfill the DRN requirements and their time to rendezvous (TTR) is long. Therefore, we propose an extended modular clock algorithm (EMCA) which is a multiuser blind rendezvous protocol, considers the DRN requirements and has short TTR. For unknown nodes and topologies, a general framework for self-organizing multihop cooperative fully blind rendezvous protocol is also proposed, which works in different phases, can terminate when sufficient nodes are discovered, and is capable of disseminating the information of nodes which enter or leave a network. A synchronization mechanism is presented for periodic update of rendezvous information. An information exchange mechanism is also proposed which expedites the rendezvous process. In both single and multihop networks, EMCA provides up to 80% improvement in terms of TTR over the existing blind rendezvous strategies while considering the PR activity. A simple Random strategy, while being poorer than EMCA, is also shown to outperform existing strategies on average. To achieve adaptability in the presence of unknown PR activity, different CR operating policies are proposed which avoid the channels detected with PR activity to reduce the harmful interference, provide free channels to reduce the TTR, and can work with any rendezvous strategy. These policies are evaluated over different PR activities and shown to reduce the TTR and harmful interference significantly over the basic Listen before Talk approach. A proactive policy, which prefers to return to channels with recent lower PR activity, is shown to be best, and to improve the performance of all studied rendezvous strategies

Performance evaluation of channel aggregation strategies in cognitive radio networks with queues

With the growing usage of wireless communication devices, demand for the spectrum access is rapidly increasing. Therefore, an efficient spectrum management and spectrum access techniques are necessary and critical. However, studies on spectrum usage have revealed that most of the allotted spectrum is not used efficiently due to the static frequency allocation methods. With the evolution of cognitive radio, spectrum access techniques shift from static spectrum allocation to dynamic allocation with enhanced features such as spectrum sensing and spectrum adaptation. In the first part of this thesis, we study several spectrum access techniques in cognitive radio networks, which have been developed with spectrum adaptation. The performance of cognitive radio systems are evaluated in terms of capacity, blocking probability and forced termination probability of the secondary network. Due to the strict priority over primary users, the performance of the secondary network is restricted. One of the successful solutions to further improve the system performance by increasing the capacity and decreasing the blocking and forced termination probabilities is the integration of a queuing model. Most of already designed queuing models for cognitive radio systems have been designed with certain limitations of performance. Therefore in this thesis, a bunch of techniques of performance improvement have been taken into account when designing the queuing model. The features: channel aggregation, spectrum handover, channel sharing, priority based queuing and heterogeneous traffic are considered together in order to model the queuing system as much as more realistic way which can further enhance the overall system performance. In the second part of this thesis, we propose a queuing system referred to as Priority based Multiple Queue System (PMQS) which is designed with two queues separately for the real time and non-real time secondary user services. Channel access opportunities are distributed between two queues such a way that the real time services have the higher priority than elastic services. Two queuing approaches are introduced based on the queuing ability of the interrupted non-real time services. Continuous time Markov chain models are developed to evaluate the system performance in terms of capacity, blocking and forced termination probabilities of the secondary network. In addition, we explore the cost analysis of the proposed queuing model in terms of mean queuing delay. Other than that, spectrum utilization of the cognitive radio system is also evaluated. In order to minimize the associated queuing delay, a maximum value for the number of waiting lines inside a queue is set instead of an infinite queue size . Analytical results reveal that integration of the proposed queuing model could increase the capacity of the secondary network while decreasing the blocking probability. And also one of the proposed queuing methods can further decrease the forced termination rate of non-real time traffic. Associated queuing delay is controlled by proper selection of maximum queue sizes. For these reasons, it can be concluded that the proposed queuing model can be used to improve the system performance of multi-channel cognitive radio networks

Channel Access and Reliability Performance in Cognitive Radio Networks:Modeling and Performance Analysis

Doktorgradsavhandling ved Institutt for Informasjons- og kommunikasjonsteknologi, Universitetet i AgderAccording to the facts and figures published by the international telecommunication union (ITU) regarding information and communication technology (ICT) industry, it is estimated that over 3.2 billion people have access to the Internet in 2015 [1]. Since 2000, this number has been octupled. Meanwhile, by the end of 2015, there were more than 7 billion mobile cellular subscriptions in the world, corresponding to a penetration rate of 97%. As the most dynamic segment in ICT, mobile communication is providing Internet services and consequently the mobile broadband penetration rate has reached 47% globally. Accordingly, capacity, throughput, reliability, service quality and resource availability of wireless services become essential factors for future mobile and wireless communications. Essentially, all these wireless technologies, standards, services and allocation policies rely on one common natural resource, i.e., radio spectrum. Radio spectrum spans over the electromagnetic frequencies between 3 kHz and 300 GHz. Existing radio spectrum access techniques are based on the fixed allocation of radio resources. These methods with fixed assigned bandwidth for exclusive usage of licensed users are often not efficient since most of the spectrum bands are under-utilized, either/both in the space domain or/and in the time domain. In reality, it is observed that many spectrum bands are largely un-occupied in many places [2], [3]. For instance, the spectrum bands which are exclusively allocated for TV broadcasting services in USA remain un-occupied from midnight to early morning according to the real-life measurement performed in [4]. In addition to the wastage of radio resources, spectrum under-utilization constraints spectrum availability for other intended users. Furthermore, legacy fixed spectrum allocation techniques are not capable of adapting to the changes and interactions in the system, leading to degraded network performance. Unlike in the static spectrum allocation, a fraction of the radio spectrum is allocated for open access as license-free bands, e.g., the industrial, scientific and medical (ISM) bands (902-928, 2400-2483.5, 5725-5850 MHz). In 1985, the federal communications commission (FCC) permitted to use the ISM bands for private and unlicensed occupancy, however, under certain restrictions on transmission power [5]. Consequently, standards like IEEE 802.11 for wireless local area networks (WLANs) and IEEE 802.15 for wireless personal area networks (WPAN) have grown rapidly with open access spectrum policies in the 2.4 GHz and 5 GHz ISM bands. With the co-existence of both similar and dissimilar radio technologies, 802.11 networks face challenges for providing satisfactory quality of service (QoS). This and the above mentioned spectrum under-utilization issues motivate the spectrum regulatory bodies to rethink about more flexible spectrum access for licenseexempt users or more efficient radio spectrum management. Cognitive radio (CR) is probably the most promising technology for achieving efficient spectrum utilization in future wireless networks

Physical-Layer Security in Cognitive Radio Networks

The fifth-generation (5G) communications and beyond are expected to serve a huge number of devices and services. However, due to the fixed spectrum allocation policies, the need for cognitive radio networks (CRNs) has increased accordingly. CRNs have been proposed as a promising approach to address the problem of under-utilization and scarcity of the spectrum. In CRNs, secondary users (SUs) access the licensed spectrum of the primary users (PUs) using underlay, overlay, or interweave paradigms. SUs can access the spectrum band simultaneously with the PUs in underlay access mode provided that the SUs’ transmission power does not cause interference to the PUs’ communication. In this case, SUs should keep monitoring the interference level that the PU receiver can tolerate and adjust the transmission power accordingly. However, varying the transmission power may lead to some threats to the privacy of the information transfer of CRNs. Therefore, securing data transmission in an underlay CRN is a challenge that should be addressed. Physical-layer security (PLS) has recently emerged as a reliable method to protect the confidentiality of the SUs’ transmission against attacks, especially for the underlay model with no need for sharing security keys. Indeed, PLS has the advantage of safeguarding the data transmission without the necessity of adding enormous additional resources, specifically when there are massively connected devices. Apart from the energy consumed by the various functions carried out by SUs, enhancing security consumes additional energy. Therefore, energy harvesting (EH) is adopted in our work to achieve both; energy efficiency and spectral efficiency. EH is a significant breakthrough for green communication, allowing the network nodes to reap energy from multiple sources to lengthen battery life. The energy from various sources, such as solar, wind, vibration, and radio frequency (RF) signals, can be obtained through the process of EH. This accumulated energy can be stored to be used for various processes, such as improving the users’ privacy and prolonging the energy-constrained devices’ battery life. In this thesis, for the purpose of realistic modelling of signal transmission, we explicitly assume scenarios involving moving vehicles or nodes in networks that are densely surrounded by obstacles. Hence, we begin our investigations by studying the link performance under the impact of cascaded κ−μ fading channels. Moreover, using the approach of PLS, we address the privacy of several three-node wiretap system models, in which there are two legitimate devices communicating under the threat of eavesdroppers. We begin by a three-node wiretap system model operating over cascaded κ − μ fading channels and under worst-case assumptions. Moreover, assuming cascaded κ − μ distributions for all the links, we investigate the impact of these cascade levels, as well as the impact of multiple antennas employed at the eavesdropper on security. Additionally, the PLS is examined for two distinct eavesdropping scenarios: colluding and non-colluding eavesdroppers. Throughout the thesis, PLS is mainly evaluated through the secrecy outage probability (SOP), the probability of non-zero secrecy capacity (Pnzcr ), and the intercept probability (Pint). Considering an underlay CRN operating over cascaded Rayleigh fading channel, with the presence of an eavesdropper, we explore the PLS for SUs in the network. This study is then extended to investigate the PLS of SUs in an underlay single-input-multiple-output (SIMO) CRN over cascaded κ-μ general fading channels with the presence of a multi-antenna eavesdropper. The impact of the constraint over the transmission power of the SU transmitter due to the underlay access mode is investigated. In addition, the effects of multiple antennas and cascade levels over security are well-explored. In the second part of our thesis, we propose an underlay CRN, in which an SU transmitter communicates with an SU destination over cascaded κ-μ channels. The confidentiality of the shared information between SUs is threatened by an eavesdropper. Our major objective is to achieve a secured network, while at the same time improving the energy and spectrum efficiencies with practical modeling for signals’ propagation. Hence, we presume that the SU destination harvests energy from the SU transmitter. The harvested energy is used to produce jamming signals to be transmitted to mislead the eavesdropper. In this scenario, a comparison is made between an energy-harvesting eavesdropper and a non-energy harvesting one. Additionally, we present another scenario in which cooperative jamming is utilized as one of the means to boost security. In this system model, the users are assumed to communicate over cascaded Rayleigh channels. Moreover, two scenarios for the tapping capabilities of the eavesdroppers are presented; colluding and non-colluding eavesdroppers. This study is then extended for the case of non-colluding eavesdroppers, operating over cascaded κ-μ channels. Finally, we investigate the reliability of the SUs and PUs while accessing the licensed bands using the overlay mode, while enhancing the energy efficiency via EH techniques. Hence, we assume that multiple SUs are randomly distributed, in which one of the SUs is selected to harvest energy from the PUs’ messages. Then, utilizing the gathered energy, this SU combines its own messages with the amplified PUs messages and forwards them to the destinations. Furthermore, we develop two optimization problems with the potential of maximizing the secondary users’ rate and the sum rate of both networks

Journal of Telecommunications and Information Technology

kwartalni

Synoptic analysis techniques for intrusion detection in wireless networks

Current system administrators are missing intrusion alerts hidden by large numbers of false positives. Rather than accumulation more data to identify true alerts, we propose an intrusion detection tool that e?ectively uses select data to provide a picture of ?network health?. Our hypothesis is that by utilizing the data available at both the node and cooperative network levels we can create a synoptic picture of the network providing indications of many intrusions or other network issues. Our major contribution is to provide a revolutionary way to analyze node and network data for patterns, dependence, and e?ects that indicate network issues. We collect node and network data, combine and manipulate it, and tease out information about the state of the network. We present a method based on utilizing the number of packets sent, number of packets received, node reliability, route reliability, and entropy to develop a synoptic picture of the network health in the presence of a sinkhole and a HELLO Flood attacker. This method conserves network throughput and node energy by requiring no additional control messages to be sent between the nodes unless an attacker is suspected. We intend to show that, although the concept of an intrusion detection system is not revolutionary, the method in which we analyze the data for clues about network intrusion and performance is highly innovative

Doctor of Philosophy

dissertationWireless communications pervade all avenues of modern life. The rapid expansion of wireless services has increased the need for transmission schemes that are more spectrally efficient. Dynamic spectrum access (DSA) systems attempt to address this need by building a network where the spectrum is used opportunistically by all users based on local and regional measurements of its availability. One of the principal requirements in DSA systems is to initialize and maintain a control channel to link the nodes together. This should be done even before a complete spectral usage map is available. Additionally, with more users accessing the spectrum, it is important to maintain a stable link in the presence of significant interference in emergency first-responders, rescue, and defense applications. In this thesis, a new multicarrier spread spectrum (MC-SS) technique based on filter banks is presented. The new technique is called filter bank multicarrier spread spectrum (FB-MC-SS). A detailed theory of the underlying properties of this signal are given, with emphasis on the properties that lend themselves to synchronization at the receiver. Proposed algorithms for synchronization, channel estimation, and detection are implemented on a software-defined radio platform to complete an FB-MC-SS transceiver and to prove the practicality of the technique. FB-MC-SS is shown through physical experimentation to be significantly more robust to partial band interference compared to direct sequence spread spectrum. With a higher power interfering signal occupying 90% of its band, FB-MC-SS maintains a low bit error rate. Under the same interference conditions, DS-SS fails completely. This experimentation leads to a theoretical analysis that shows in a frequency selective channel with additive white noise, the FB-MC-SS system has performance that equals that obtained by a DS-SS system employing an optimal rake receiver. This thesis contains a detailed chapter on implementation and design, including lessons learned while prototyping the system. This is to assist future system designers to quickly gain proficiency in further development of this technology