218 research outputs found

    Dynamic Multi-Arm Bandit Game Based Multi-Agents Spectrum Sharing Strategy Design

    Full text link
    For a wireless avionics communication system, a Multi-arm bandit game is mathematically formulated, which includes channel states, strategies, and rewards. The simple case includes only two agents sharing the spectrum which is fully studied in terms of maximizing the cumulative reward over a finite time horizon. An Upper Confidence Bound (UCB) algorithm is used to achieve the optimal solutions for the stochastic Multi-Arm Bandit (MAB) problem. Also, the MAB problem can also be solved from the Markov game framework perspective. Meanwhile, Thompson Sampling (TS) is also used as benchmark to evaluate the proposed approach performance. Numerical results are also provided regarding minimizing the expectation of the regret and choosing the best parameter for the upper confidence bound

    Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

    Full text link
    The Byzantine attack in cooperative spectrum sensing (CSS), also known as the spectrum sensing data falsification (SSDF) attack in the literature, is one of the key adversaries to the success of cognitive radio networks (CRNs). In the past couple of years, the research on the Byzantine attack and defense strategies has gained worldwide increasing attention. In this paper, we provide a comprehensive survey and tutorial on the recent advances in the Byzantine attack and defense for CSS in CRNs. Specifically, we first briefly present the preliminaries of CSS for general readers, including signal detection techniques, hypothesis testing, and data fusion. Second, we analyze the spear and shield relation between Byzantine attack and defense from three aspects: the vulnerability of CSS to attack, the obstacles in CSS to defense, and the games between attack and defense. Then, we propose a taxonomy of the existing Byzantine attack behaviors and elaborate on the corresponding attack parameters, which determine where, who, how, and when to launch attacks. Next, from the perspectives of homogeneous or heterogeneous scenarios, we classify the existing defense algorithms, and provide an in-depth tutorial on the state-of-the-art Byzantine defense schemes, commonly known as robust or secure CSS in the literature. Furthermore, we highlight the unsolved research challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral

    A Survey on Dynamic Spectrum Access Techniques in Cognitive Radio Networks

    Get PDF
    The idea of Cognitive Radio (CR) is to share the spectrum between a user called primary, and a user called secondary. Dynamic Spectrum Access (DSA) is a new spectrum sharing paradigm in cognitive radio that allows secondary users to access the abundant spectrum holes in the licensed spectrum bands. DSA is an auspicious technology to alleviate the spectrum scarcity problem and increase spectrum utilization. While DSA has attracted many research efforts recently, in this paper, a survey of spectrum access techniques using cooperation and competition to solve the problem of spectrum allocation in cognitive radio networks is presented

    Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study

    Full text link
    Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence off-sets the benefits. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we present experimental and analytical results derived from a mathematical model. We model a system operating at capacity serving requests for bandwidth by assigning a collection of gaps (sub-channels) with no limitations on the fragment size. Our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Within the very difficult class of dynamic fragmentation models (including models of storage fragmentation), this result appears to be the first of its kind. Extensive experimental results describe behavior, at times unexpected, of fragmentation under different algorithms. Our model also applies to dynamic linked-list storage allocation, and provides a novel analysis in that domain. We prove that, interestingly, the 50% rule of the classical (non-fragmented) allocation model carries over to our model. Overall, the paper provides insights into the potential behavior of practical fragmentation algorithms

    On Myopic Sensing for Multi-Channel Opportunistic Access: Structure, Optimality, and Performance

    Full text link
    We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elliot channel model). A user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on numerical results. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, and resource-constrained jamming and anti-jamming.Comment: To appear in IEEE Transactions on Wireless Communications. This is a revised versio

    Sensing or Transmission: Causal Cognitive Radio Strategies with Censorship

    Get PDF
    This paper introduces a novel opportunistic transmission strategy for cognitive radios (CRs). The primary user (PU) is assumed to transmit in a time-slotted manner according to a two-state Markov model, and the CR is either sensing, that is, obtaining a causal, noisy observation of a primary user (PU) state, or transmitting, but not both at the same time. In other words, the CR observations of the PU are censored whenever the CR is transmitting. The objective of the CR transmission strategy is to maximize the utilization ratio (UR), i.e., the relative number of the PU-idle slots that are used by the CR, subject to that the interference ratio (IR), i.e., the relative number of the PU-active slots that are used by the CR, is below a certain level. We introduce an a-posteriori LLR-based CR transmission strategy, called CLAPP, and evaluate this strategy in terms of the achievable UR for different PU model parameters and received signal-to-noise ratios (SNRs). The performance of CLAPP is compared with a simple censored energy detection scheme. Simulation results show that CLAPP has 52% gain in UR over the best censored energy detection scheme for a maximum IR level of 10% and an SNR of -2dB. \ua9 2002-2012 IEEE
    corecore