479 research outputs found
Novel Approaches for the Performance Enhancement of Cognitive Radio Networks
This research is dedicated to the study of the challenges faced by Cognitive Radio (CR) networks, which include self-coexistence of the networks in the spectral environment, security and performance threats from malicious entities, and fairness in spectrum contention and utilization. We propose novel channel acquisition schemes that allow decentralized CR networks to have multiple channel access with minimal spectrum contentions. The multiple channel acquisition schemes facilitate fast spectrum access especially in cases where networks cannot communicate with each other. These schemes enable CR networks to self-organize and adapt to the dynamically changing spectral environment.
We also present a self-coexistence mechanism that allows CR networks to coexist via the implementation of a risk-motivated channel selection based deference structure (DS). By forming DS coalitions, CR networks are able to have better access to preferred channels and can defer transmission to one another, thereby mitigating spectrum conflicts.
CR networks are also known to be susceptible to Sybil threats from smart malicious radios with either monopolistic or disruptive intentions. We formulate novel threat and defense mechanisms to combat Sybil threats and minimize their impact on the performance of CR networks. A dynamic reputation system is proposed that considerably minimizes the effectiveness of intelligent Sybil attacks and improves the accuracy of spectrum-based decision-making processes.
Finally, we present a distributed and cheat-proof spectrum contention protocol as an enhancement of the adaptive On-Demand Spectrum Contention (ODSC) protocol. The Modified On-Demand Spectrum Contention (MODSC) protocol enhances fairness and efficiency of spectrum access. We also show that there is substantial improvement in spectrum utilization with the incorporation of channel reuse into the MODSC protocol
Distributed Inference and Learning with Byzantine Data
We are living in an increasingly networked world with sensing networks of varying shapes and sizes: the network often comprises of several tiny devices (or nodes) communicating with each other via different topologies. To make the problem even more complicated, the nodes in the network can be unreliable due to a variety of reasons: noise, faults and attacks, thus, providing
corrupted data. Although the area of statistical inference has been an active area of research in the
past, distributed learning and inference in a networked setup with potentially unreliable components
has only gained attention recently. The emergence of big and dirty data era demands new
distributed learning and inference solutions to tackle the problem of inference with corrupted data.
Distributed inference networks (DINs) consist of a group of networked entities which acquire
observations regarding a phenomenon of interest (POI), collaborate with other entities in the network
by sharing their inference via different topologies to make a global inference. The central
goal of this thesis is to analyze the effect of corrupted (or falsified) data on the inference performance
of DINs and design robust strategies to ensure reliable overall performance for several
practical network architectures. Specifically, the inference (or learning) process can be that of detection
or estimation or classification, and the topology of the system can be parallel, hierarchical
or fully decentralized (peer to peer).
Note that, the corrupted data model may seem similar to the scenario where local decisions
are transmitted over a Binary Symmetric Channel (BSC) with a certain cross over probability,
however, there are fundamental differences. Over the last three decades, research community
has extensively studied the impact of transmission channels or faults on the distributed detection
system and related problems due to its importance in several applications. However, corrupted
(Byzantine) data models considered in this thesis, are philosophically different from the BSC or
the faulty sensor cases. Byzantines are intentional and intelligent, therefore, they can optimize
over the data corruption parameters. Thus, in contrast to channel aware detection, both the FC and
the Byzantines can optimize their utility by choosing their actions based on the knowledge of their
opponent’s behavior. Study of these practically motivated scenarios in the presence of Byzantines
is of utmost importance, and is missing from the channel aware detection and fault tolerant detection
literature. This thesis advances the distributed inference literature by providing fundamental
limits of distributed inference with Byzantine data and provides optimal counter-measures (using
the insights provided by these fundamental limits) from a network designer’s perspective. Note
that, the analysis of problems related to strategical interaction between Byzantines and network
designed is very challenging (NP-hard is many cases). However, we show that by utilizing the
properties of the network architecture, efficient solutions can be obtained. Specifically, we found
that several problems related to the design of optimal counter-measures in the inference context
are, in fact, special cases of these NP-hard problems which can be solved in polynomial time.
First, we consider the problem of distributed Bayesian detection in the presence of data falsification
(or Byzantine) attacks in the parallel topology. Byzantines considered in this thesis are those
nodes that are compromised and reprogrammed by an adversary to transmit false information to
a centralized fusion center (FC) to degrade detection performance. We show that above a certain
fraction of Byzantine attackers in the network, the detection scheme becomes completely incapable
(or blind) of utilizing the sensor data for detection. When the fraction of Byzantines is not
sufficient to blind the FC, we also provide closed form expressions for the optimal attacking strategies
for the Byzantines that most degrade the detection performance. Optimal attacking strategies
in certain cases have the minimax property and, therefore, the knowledge of these strategies has
practical significance and can be used to implement a robust detector at the FC.
In several practical situations, parallel topology cannot be implemented due to limiting factors,
such as, the FC being outside the communication range of the nodes and limited energy budget of
the nodes. In such scenarios, a multi-hop network is employed, where nodes are organized hierarchically
into multiple levels (tree networks). Next, we study the problem of distributed inference
in tree topologies in the presence of Byzantines under several practical scenarios. We analytically
characterize the effect of Byzantines on the inference performance of the system. We also look at
the possible counter-measures from the FC’s perspective to protect the network from these Byzantines.
These counter-measures are of two kinds: Byzantine identification schemes and Byzantine
tolerant schemes. Using learning based techniques, Byzantine identification schemes are designed
that learn the identity of Byzantines in the network and use this information to improve system
performance. For scenarios where this is not possible, Byzantine tolerant schemes, which use
game theory and error-correcting codes, are developed that tolerate the effect of Byzantines while
maintaining a reasonably good inference performance in the network.
Going a step further, we also consider scenarios where a centralized FC is not available. In
such scenarios, a solution is to employ detection approaches which are based on fully distributed
consensus algorithms, where all of the nodes exchange information only with their neighbors. For
such networks, we analytically characterize the negative effect of Byzantines on the steady-state
and transient detection performance of conventional consensus-based detection schemes. To avoid
performance deterioration, we propose a distributed weighted average consensus algorithm that is
robust to Byzantine attacks. Next, we exploit the statistical distribution of the nodes’ data to devise
techniques for mitigating the influence of data falsifying Byzantines on the distributed detection
system. Since some parameters of the statistical distribution of the nodes’ data might not be known
a priori, we propose learning based techniques to enable an adaptive design of the local fusion or
update rules.
The above considerations highlight the negative effect of the corrupted data on the inference
performance. However, it is possible for a system designer to utilize the corrupted data for network’s
benefit. Finally, we consider the problem of detecting a high dimensional signal based on
compressed measurements with secrecy guarantees. We consider a scenario where the network
operates in the presence of an eavesdropper who wants to discover the state of the nature being
monitored by the system. To keep the data secret from the eavesdropper, we propose to use cooperating
trustworthy nodes that assist the FC by injecting corrupted data in the system to deceive the
eavesdropper. We also design the system by determining the optimal values of parameters which
maximize the detection performance at the FC while ensuring perfect secrecy at the eavesdropper
Recommended from our members
Location Privacy-Preserving Strategies for Secondary Spectrum Use
The scarcity of wireless spectrum resources and the overwhelming demand for wireless broadband resources have prompted industry, government agencies and academia within the wireless communities to develop and come up with effective solutions that can make additional spectrum available for broadband data. As part of these ongoing efforts, cognitive radio networks (CRNs) have emerged as an essential technology for enabling and promoting dynamic spectrum access and sharing, a paradigm primarily aimed at addressing the spectrum scarcity and shortage challenges by permitting and enabling unlicensed or secondary users (SUs) to freely search, locate and exploit unused licensed spectrum opportunities. Despite their great potentials for improving
spectrum utilization efficiency and for addressing the spectrum shortage problem, CRNs suffer from serious location privacy issues, which essentially tend to disclose the location information of the SUs to other system entities during their usage of these open spectrum opportunities. Knowing that their whereabouts may be exposed, SUs can be discouraged from joining and participating in the CRNs, potentially hindering the adoption and deployment of this technology. In this thesis, we propose frameworks that are suitable for CRNs, but also preserve the location privacy information of these SU s. More specifically,
1. We propose location privacy-preserving protocols that protect the location privacy of SUs in cooperative sensing-based CRNs while allowing the SUs to perform their spectrum sensing tasks reliably and effectively. Our proposed protocols allow also the detection of malicious user activities through the adoption of reputation mechanisms.
2. We propose location privacy-preserving approaches that provide information-theoretic privacy to SU s’ location in database-driven CRNs through the exploitation of the structured nature of spectrum databases and the fact that database-driven CRNs, by design, rely on multiple spectrum databases.
3. We propose a trustworthy framework for new generation of spectrum access systems in the 3.5 GHz band that not only protects SUs’ privacy, but also ensures that they comply with the unique system requirements, while allowing the detection of misbehaving users
- …