Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

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

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

A modified energy detection based dynamic spectrum sharing technique and its real time implementation on wireless platform for cognitive radio networks

Cognitive radio offers a flexible and efficient utilization of radio frequency resources by dynamic spectrum sharing as required in next gen (5G) architecture of wireless communication. The channel allocation time, probability of false alarm detection and spectral efficiency are the major performance parameters to characterize a spectrum sharing technique. This paper presents modified energy detection based dynamic channel allocation technique based on sensing the power spectral density of idle spectrum bands i.e. spectrum hole. Receiver operating characteristics (ROC) curves have been used to analyze the detector performance of sensing with respect to probability false alarm at different values of SNR. Allocation of unoccupied bands to the SUs has been done by coalition based cooperative game, which provides SUs with an incentive to cooperate. Based on their worth, SUs get payoffs which have been computed using Shapely values as a one-point solution. Vickrey–Clarke–Groves (VCG) auction mechanism has been used to allocate the spectrum resources fairly to each user. On the basis of allocation time, the present model for dynamic spectrum access appears to be more efficient as compared to the conventional opportunistic spectrum access model

A modified energy detection based dynamic spectrum sharing technique and its real time implementation on wireless platform for cognitive radio networks

1043-1052Cognitive radio offers a flexible and efficient utilization of radio frequency resources by dynamic spectrum sharing as required in next gen (5G) architecture of wireless communication. The channel allocation time, probability of false alarm detection and spectral efficiency are the major performance parameters to characterize a spectrum sharing technique. This paper presents modified energy detection based dynamic channel allocation technique based on sensing the power spectral density of idle spectrum bands i.e. spectrum hole. Receiver operating characteristics (ROC) curves have been used to analyze the detector performance of sensing with respect to probability false alarm at different values of SNR. Allocation of unoccupied bands to the SUs has been done by coalition based cooperative game, which provides SUs with an incentive to cooperate. Based on their worth, SUs get payoffs which have been computed using Shapely values as a one-point solution. Vickrey–Clarke–Groves (VCG) auction mechanism has been used to allocate the spectrum resources fairly to each user. On the basis of allocation time, the present model for dynamic spectrum access appears to be more efficient as compared to the conventional opportunistic spectrum access model

Smart Sensing and Performance Analysis for Cognitive Radio Networks

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

コグニティブネットワークとヘテロジニアスネットワークの協調によるスペクトルの効率的利用に関する研究

学位の種別: 課程博士審査委員会委員 : （主査）東京大学教授 瀬崎 薫, 東京大学教授 浅見 徹, 東京大学教授 江崎 浩, 東京大学准教授 川原 圭博, 東京大学教授 森川 博之, 東京大学教授 相田 仁University of Tokyo(東京大学