An analysis on decentralized adaptive MAC protocols for Cognitive Radio networks

The scarcity of bandwidth in the radio spectrum has become more vital since the demand for more and more wireless applications has increased. Most of the spectrum bands have been allocated although many studies have shown that these bands are significantly underutilized most of the time. The problem of unavailability of spectrum and inefficiency in its utilization has been smartly addressed by the Cognitive Radio (CR) Technology which is an opportunistic network that senses the environment, observes the network changes, and then using knowledge gained from the prior interaction with the network, makes intelligent decisions by dynamically adapting their transmission characteristics. In this paper some of the decentralized adaptive MAC protocols for CR networks have been critically analyzed and a novel adaptive MAC protocol for CR networks, DNG-MAC which is decentralized and non-global in nature, has been proposed. The results show the DNG-MAC out performs other CR MAC protocols in terms of time and energy efficiency

A novel multi-fold security framework for cognitive radio wireless ad-hoc networks

Cognitive Radio (CR) Technology has emerged as a smart and intelligent technology to address the problem of spectrum scarcity and its under-utilization. CR nodes sense the environment for vacant channels, exchange control information, and agree upon free channels list (FCL) to use for data transmission and conclusion. CR technology is heavily dependent on the control channel to dialogue on the exchanged control information which is usually in the Industrial-Scientific-Medical (ISM) band. As the ISM band is publically available this makes the CR network more prone to security vulnerabilities and flaws. In this paper a novel multi-fold security framework for cognitive radio wireless ad-hoc networks has been proposed. Multiple security levels, such as, encryption of beacon frame and privately exchanging the FCL, and the dynamic and adaptive behaviour of the framework makes the proposed protocol more resilient and secure against the traditional security attacks when compared with existing protocols

To Stay Or To Switch: Multiuser Dynamic Channel Access

In this paper we study opportunistic spectrum access (OSA) policies in a multiuser multichannel random access cognitive radio network, where users perform channel probing and switching in order to obtain better channel condition or higher instantaneous transmission quality. However, unlikely many prior works in this area, including those on channel probing and switching policies for a single user to exploit spectral diversity, and on probing and access policies for multiple users over a single channel to exploit temporal and multiuser diversity, in this study we consider the collective switching of multiple users over multiple channels. In addition, we consider finite arrivals, i.e., users are not assumed to always have data to send and demand for channel follow a certain arrival process. Under such a scenario, the users' ability to opportunistically exploit temporal diversity (the temporal variation in channel quality over a single channel) and spectral diversity (quality variation across multiple channels at a given time) is greatly affected by the level of congestion in the system. We investigate the optimal decision process in this case, and evaluate the extent to which congestion affects potential gains from opportunistic dynamic channel switching

DDH-MAC: a novel dynamic de-centralized hybrid MAC protocol for cognitive radio networks

The radio spectrum (3kHz - 300GHz) has become saturated and proven to be insufficient to address the proliferation of new wireless applications. Cognitive Radio Technology which is an opportunistic network and is equipped with fully programmable wireless devices that empowers the network by OODA cycle and then make intelligent decisions by adapting their MAC and physical layer characteristics such as waveform, has appeared to be the only solution for current low spectrum availability and under utilization problem. In this paper a novel Dynamic De-Centralized Hybrid “DDH-MAC” protocol for Cognitive Radio Networks has been presented which lies between Global Common Control Channel (GCCC) and non-GCCC categories of cognitive radio MAC protocols. DDH-MAC is equipped with the best features of GCCC MAC protocols but also overcomes the saturation and security issues in GCCC. To the best of authors' knowledge, DDH-MAC is the first protocol which is hybrid between GCCC and non-GCCC family of protocols. DDH-MAC provides multiple levels of security and partially use GCCC to transmit beacon which sets and announces local control channel for exchange of free channel list (FCL) sensed by the co-operatively communicating cognitive radio nodes, subsequently providing secure transactions among participating nodes over the decided local control channel. This paper describes the framework of the DDH-MAC protocol in addition to its pseudo code for implementation; it is shown that the pre-transmission time for DDH-MAC is on average 20% better while compared to other cognitive radio MAC protocols

Medium access control design for distributed opportunistic radio networks

Existing wireless networks are characterized by a fixed spectrum assignment policy. However, the scarcity of available spectrum and its inefficient usage demands for a new communication paradigm to exploit the existing spectrum opportunistically. Future Cognitive Radio (CR) devices should be able to sense unoccupied spectrum and will allow the deployment of real opportunistic networks. Still, traditional Physical (PHY) and Medium Access Control (MAC) protocols are not suitable for this new type of networks because they are optimized to operate over fixed assigned frequency bands. Therefore, novel PHY-MAC cross-layer protocols should be developed to cope with the specific features of opportunistic networks. This thesis is mainly focused on the design and evaluation of MAC protocols for Decentralized Cognitive Radio Networks (DCRNs). It starts with a characterization of the spectrum sensing framework based on the Energy-Based Sensing (EBS) technique considering multiple scenarios. Then, guided by the sensing results obtained by the aforementioned technique, we present two novel decentralized CR MAC schemes: the first one designed to operate in single-channel scenarios and the second one to be used in multichannel scenarios. Analytical models for the network goodput, packet service time and individual transmission probability are derived and used to compute the performance of both protocols. Simulation results assess the accuracy of the analytical models as well as the benefits of the proposed CR MAC schemes

An Online Approach to Dynamic Channel Access and Transmission Scheduling

Making judicious channel access and transmission scheduling decisions is essential for improving performance as well as energy and spectral efficiency in multichannel wireless systems. This problem has been a subject of extensive study in the past decade, and the resulting dynamic and opportunistic channel access schemes can bring potentially significant improvement over traditional schemes. However, a common and severe limitation of these dynamic schemes is that they almost always require some form of a priori knowledge of the channel statistics. A natural remedy is a learning framework, which has also been extensively studied in the same context, but a typical learning algorithm in this literature seeks only the best static policy, with performance measured by weak regret, rather than learning a good dynamic channel access policy. There is thus a clear disconnect between what an optimal channel access policy can achieve with known channel statistics that actively exploits temporal, spatial and spectral diversity, and what a typical existing learning algorithm aims for, which is the static use of a single channel devoid of diversity gain. In this paper we bridge this gap by designing learning algorithms that track known optimal or sub-optimal dynamic channel access and transmission scheduling policies, thereby yielding performance measured by a form of strong regret, the accumulated difference between the reward returned by an optimal solution when a priori information is available and that by our online algorithm. We do so in the context of two specific algorithms that appeared in [1] and [2], respectively, the former for a multiuser single-channel setting and the latter for a single-user multichannel setting. In both cases we show that our algorithms achieve sub-linear regret uniform in time and outperforms the standard weak-regret learning algorithms.Comment: 10 pages, to appear in MobiHoc 201