A Survey on the Communication Protocols and Security in Cognitive Radio Networks

A cognitive radio (CR) is a radio that can change its transmission parameters based on the perceived availability of the spectrum bands in its operating environment. CRs support dynamic spectrum access and can facilitate a secondary unlicensed user to efficiently utilize the available underutilized spectrum allocated to the primary licensed users. A cognitive radio network (CRN) is composed of both the secondary users with CR-enabled radios and the primary users whose radios need not be CR-enabled. Most of the active research conducted in the area of CRNs has been so far focused on spectrum sensing, allocation and sharing. There is no comprehensive review paper available on the strategies for medium access control (MAC), routing and transport layer protocols, and the appropriate representative solutions for CRNs. In this paper, we provide an exhaustive analysis of the various techniques/mechanisms that have been proposed in the literature for communication protocols (at the MAC, routing and transport layers), in the context of a CRN, as well as discuss in detail several security attacks that could be launched on CRNs and the countermeasure solutions that have been proposed to avoid or mitigate them. This paper would serve as a good comprehensive review and analysis of the strategies for MAC, routing and transport protocols and security issues for CRNs as well as would lay a strong foundation for someone to further delve onto any particular aspect in greater depth

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

Cognitive Radio Network with a distributed control channel and quality-of-service solution

The proliferation of wireless access and applications to the Internet and the advent of a myriad of highly evolved portable communication devices; creates the need for an efficiently utilized radio spectrum. This is paramount in the licensed and unlicensed radio frequency bands, that spawn an exponential growth in Dynamic Spectrum Access (DSA) research, Cognitive Radio (CR) and Cognitive Radio Networks (CRN) research. DSA research has given way to the paradigm shift toward CR with its dynamic changes in transmission schemas. This paradigm shift from a fixed and centralized frequency spectrum environment has morphed into a dynamic and decentralized one. CR provides wireless nodes the capability to adapt and exploit the frequency spectrum. The spectrum information obtained is scanned and updated to determine the channel quality for viability and a utilization/availability by the licensed (primary) user. To take advantage of the CR capabilities, previous research has focused on a Common Control Channel(CCC) for the control signals to be used for spectrum control. This utilization generates channel saturation, extreme transmission overhead of control information, and a point of vulnerability. The traditional designs for wireless routing protocols do not support an ad hoc multi-hop cognitive radio network model. This research focuses on a real world implementation of a heterogeneous ad hoc multi-hop Cognitive Radio Network. An overall model, coined Emerald, has been designed to address the architecture; the Medium Access Control layer, E-MAC; and the network layer, E-NET. First, a Medium Access Control(MAC) layer protocol is provided to avoid the pitfalls of a common control channel. This new design provides CRNs with network topology and channel utilization information. Spectrum etiquette, in turn, addresses channel saturation, control overhead, and the single point of vulnerability. Secondly, a routing model is proposed that will address the efficiency of an ad hoc multi-hop CRN with a focus on the Quality-of-Service(QoS) of the point-to-point as well as end-to-end communication. This research has documented weaknesses in spectrum utilization; it has been expanded to accommodate a distributed control environment. Subsets of the model will be validated through Network Simulator-2(NS/2) and MatLab© simulations to determine point-to-point and end-to-end communications

Communication Primitives in Cognitive Radio Networks

Cognitive radio networks are a new type of multi-channel wireless network in which different nodes can have access to different sets of channels. By providing multiple channels, they improve the efficiency and reliability of wireless communication. However, the heterogeneous nature of cognitive radio networks also brings new challenges to the design and analysis of distributed algorithms. In this paper, we focus on two fundamental problems in cognitive radio networks: neighbor discovery, and global broadcast. We consider a network containing $n$ nodes, each of which has access to $c$ channels. We assume the network has diameter $D$, and each pair of neighbors have at least $k\geq 1$, and at most $k_{max}\leq c$, shared channels. We also assume each node has at most $\Delta$ neighbors. For the neighbor discovery problem, we design a randomized algorithm CSeek which has time complexity $\tilde{O}((c^2/k)+(k_{max}/k)\cdot\Delta)$. CSeek is flexible and robust, which allows us to use it as a generic "filter" to find "well-connected" neighbors with an even shorter running time. We then move on to the global broadcast problem, and propose CGCast, a randomized algorithm which takes $\tilde{O}((c^2/k)+(k_{max}/k)\cdot\Delta+D\cdot\Delta)$ time. CGCast uses CSeek to achieve communication among neighbors, and uses edge coloring to establish an efficient schedule for fast message dissemination. Towards the end of the paper, we give lower bounds for solving the two problems. These lower bounds demonstrate that in many situations, CSeek and CGCast are near optimal

SmartDR: A Device-to-Device Communication for Post-Disaster Recovery

Natural disasters, such as earthquakes, can cause severe destruction and create havoc in the society.Buildings and other structures may collapse during disaster incidents causing injuries and deaths to victims trapped under debris and rubble. Immediately after a natural disaster incident, it becomes extremely difficult for first responders and rescuers to find and save trapped victims. Often searches are carried out blindly in random locations, which delay the rescue of the victims. This paper introduces a Smartphone Assisted Disaster Recovery (SmartDR) method for post-disaster communication using Smartphones. SmartDR utilizes the device-to-device (D2D) communication technology in Fifth Generation (5G) networks, which enables direct communication between proximate devices without the need of relaying through a network infrastructure, such as mobile access points or mobile base stations. We examine a scenario of multi-hop D2D communication where smartphones carried by trapped victims and other people in disaster affected areas can self-detect the occurrence of a disaster incident by monitoring the radio environment and then can self-switch to a disaster mode to transmit emergency help messages with their location coordinates to other nearby smartphones. To locate other nearby smartphones also operating in the disaster mode and in the same channel, each smartphone runs a rendezvous process. The emergency messages are thus relayed to the functional base station or rescue centre. To facilitate routing of the emergency messages, we propose a path selection algorithm, which considers both delay and the leftover energy of a device (a smartphone in this case). Thus, the SmartDR method includes: (i) a multi-channel channel hopping rendezvous protocol to improve the victim localization or neighbor discovery, and (ii) an energy-aware multi-path routing (Energy-aware ad-hoc on-demand distance vector or E-AODV) protocol to overcome the higher energy depletionrate at devices associated with single shortest path routing. The SmartDR method can guide search and rescue operations and increase the possibility of saving lives immediately aftermath a disasterincident. A simulation-based performance study is conducted to evaluate the protocol performance in post-disaster scenario. Simulation results show that a significant performance gain is achievable when a device utilises the channel information for the rendezvous process and the leftover energy