Adversarial Robustness in Cognitive Radio Networks
Makan Zamanipour

TL;DR
This paper introduces a novel online algorithm, OBRDHT, for assessing the resilience of cognitive radio networks against adversarial attacks using byzantine resilience distributed hypothesis testing, with evaluations based on false alarm and miss detection probabilities.
Contribution
It proposes a new generic online algorithm, OBRDHT, for measuring network resilience in adversarial settings within cognitive radio networks, extending to other network types.
Findings
The algorithm effectively measures resilience through false alarm and miss detection probabilities.
Simulation results demonstrate the algorithm's accuracy in various sensing times.
The approach generalizes to different network configurations and attack scenarios.
Abstract
\textit{When an adversary gets access to the data sample in the adversarial robustness models and can make data-dependent changes, how has the decision maker consequently, relying deeply upon the adversarially-modified data, to make statistical inference? How can the resilience and elasticity of the network be literally justified if there exists a tool to measure the aforementioned elasticity?} The principle of byzantine resilience distributed hypothesis testing (BRDHT) is considered in this paper for cognitive radio networks (CRNs) without-loss-of-generality, something that can be extended to any type of homogeneous or heterogeneous networks while the byzantine primary user (PU) has a signal-to-noise-ratio (SNR) including the coefficient of which is in relation to the temporal rate of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Sensor Networks and Detection Algorithms · Wireless Communication Security Techniques · Adversarial Robustness in Machine Learning
