808 research outputs found

    General analytical framework for cooperative sensing and access trade-off optimization

    Full text link
    In this paper, we investigate the joint cooperative spectrum sensing and access design problem for multi-channel cognitive radio networks. A general heterogeneous setting is considered where the probabilities that different channels are available, SNRs of the signals received at secondary users (SUs) due to transmissions from primary users (PUs) for different users and channels can be different. We assume a cooperative sensing strategy with a general a-out-of-b aggregation rule and design a synchronized MAC protocol so that SUs can exploit available channels. We analyze the sensing performance and the throughput achieved by the joint sensing and access design. Based on this analysis, we develop algorithms to find optimal parameters for the sensing and access protocols and to determine channel assignment for SUs to maximize the system throughput. Finally, numerical results are presented to verify the effectiveness of our design and demonstrate the relative performance of our proposed algorithms and the optimal ones.Comment: arXiv admin note: text overlap with arXiv:1404.167

    Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel Cognitive Radio Networks

    Get PDF
    In this paper, we propose a semi-distributed cooperative spectrum sen sing (SDCSS) and channel access framework for multi-channel cognitive radio networks (CRNs). In particular, we c onsider a SDCSS scheme where secondary users (SUs) perform sensing and exchange sensing outcomes with ea ch other to locate spectrum holes. In addition, we devise the p -persistent CSMA-based cognitive MAC protocol integrating the SDCSS to enable efficient spectrum sharing among SUs. We then perform throughput analysis and develop an algorithm to determine the spectrum sensing and access parameters to maximize the throughput for a given allocation of channel sensing sets. Moreover, we consider the spectrum sensing set optimization problem for SUs to maxim ize the overall system throughput. We present both exhaustive search and low-complexity greedy algorithms to determine the sensing sets for SUs and analyze their complexity. We also show how our design and analysis can be extended to consider reporting errors. Finally, extensive numerical results are presented to demonstrate the sig nificant performance gain of our optimized design framework with respect to non-optimized designs as well as the imp acts of different protocol parameters on the throughput performance.Comment: accepted for publication EURASIP Journal on Wireless Communications and Networking, 201

    Smart Sensing and Performance Analysis for Cognitive Radio Networks

    Get PDF
    Static spectrum access policy has resulted in spectrum scarcity as well as low spectrum utility in today\u27s wireless communications. To utilize the limited spectrum more efficiently, cognitive radio networks have been considered a promising paradigm for future network. Due to the unique features of cognitive radio technology, cognitive radio networks not only raise new challenges, but also bring several fundamental problems back to the focus of researchers. So far, a number of problems in cognitive radio networks have remained unsolved over the past decade. The work presented in this dissertation attempts to fill some of the gaps in the research area of cognitive radio networks. It focuses primarily on spectrum sensing and performance analysis in two architectures: a single cognitive radio network and multiple co-existing cognitive radio networks. Firstly, a single cognitive radio network with one primary user is considered. A weighted cooperative spectrum sensing framework is designed, to increase the spectrum sensing accuracy. After studying the architecture of a single cognitive radio network, attention is shifted to co-existing multiple cognitive radio networks. The weakness of the conventional two-state sensing model is pointed out in this architecture. To solve the problem, a smart sensing model which consists of three states is designed. Accordingly, a method for a two-stage detection procedure is developed to accurately detect each state of the three. In the first stage, energy detection is employed to identify whether a channel is idle or occupied. If the channel is occupied, received signal is further analyzed at the second stage to determine whether the signal originates from a primary user or an secondary user. For the second stage, a statistical model is developed, which is used for distance estimation. The false alarm and miss detection probabilities for the spectrum sensing technology are theoretically analyzed. Then, how to use smart sensing, coupled with a designed media access control protocol, to achieve fairness among multiple CRNs is thoroughly investigated. The media access control protocol fully takes the PU activity into account. Afterwards, the significant performance metrics including throughput and fairness are carefully studied. In terms of fairness, the fairness dynamics from a micro-level to macro-level is evaluated among secondary users from multiple cognitive radio networks. The fundamental distinctions between the two-state model and the three-state sensing model are also addressed. Lastly, the delay performance of a cognitive radio network supporting heterogeneous traffic is examined. Various delay requirements over the packets from secondary users are fully considered. Specifically, the packets from secondary users are classified into either delay-sensitive packets or delay-insensitive packets. Moreover, a novel relative priority strategy is designed between these two types of traffic by proposing a transmission window strategy. The delay performance of both a single-primary user scenario and a multiple-primary user scenario is thoroughly investigated by employing queueing theory

    Strength is in numbers: Can concordant artificial listeners improve prediction of emotion from speech?

    Get PDF
    Humans can communicate their emotions by modulating facial expressions or the tone of their voice. Albeit numerous applications exist that enable machines to read facial emotions and recognize the content of verbal messages, methods for speech emotion recognition are still in their infancy. Yet, fast and reliable applications for emotion recognition are the obvious advancement of present 'intelligent personal assistants', and may have countless applications in diagnostics, rehabilitation and research. Taking inspiration from the dynamics of human group decision-making, we devised a novel speech emotion recognition system that applies, for the first time, a semi-supervised prediction model based on consensus. Three tests were carried out to compare this algorithm with traditional approaches. Labeling performances relative to a public database of spontaneous speeches are reported. The novel system appears to be fast, robust and less computationally demanding than traditional methods, allowing for easier implementation in portable voice-analyzers (as used in rehabilitation, research, industry, etc.) and for applications in the research domain (such as real-time pairing of stimuli to participants' emotional state, selective/differential data collection based on emotional content, etc.)

    Towards Thompson Sampling for Complex Bayesian Reasoning

    Get PDF
    Paper III, IV, and VI are not available as a part of the dissertation due to the copyright.Thompson Sampling (TS) is a state-of-art algorithm for bandit problems set in a Bayesian framework. Both the theoretical foundation and the empirical efficiency of TS is wellexplored for plain bandit problems. However, the Bayesian underpinning of TS means that TS could potentially be applied to other, more complex, problems as well, beyond the bandit problem, if suitable Bayesian structures can be found. The objective of this thesis is the development and analysis of TS-based schemes for more complex optimization problems, founded on Bayesian reasoning. We address several complex optimization problems where the previous state-of-art relies on a relatively myopic perspective on the problem. These includes stochastic searching on the line, the Goore game, the knapsack problem, travel time estimation, and equipartitioning. Instead of employing Bayesian reasoning to obtain a solution, they rely on carefully engineered rules. In all brevity, we recast each of these optimization problems in a Bayesian framework, introducing dedicated TS based solution schemes. For all of the addressed problems, the results show that besides being more effective, the TS based approaches we introduce are also capable of solving more adverse versions of the problems, such as dealing with stochastic liars.publishedVersio
    • …
    corecore