Distributed Detection over Blockchain-aided Internet of Things in the Presence of Attacks

05/08/2023
by   Yiming Jiang, et al.
0

Distributed detection over a blockchain-aided Internet of Things (BIoT) network in the presence of attacks is considered, where the integrated blockchain is employed to secure data exchanges over the BIoT as well as data storage at the agents of the BIoT. We consider a general adversary model where attackers jointly exploit the vulnerability of IoT devices and that of the blockchain employed in the BIoT. The optimal attacking strategy which minimizes the Kullback-Leibler divergence is pursued. It can be shown that this optimization problem is nonconvex, and hence it is generally intractable to find the globally optimal solution to such a problem. To overcome this issue, we first propose a relaxation method that can convert the original nonconvex optimization problem into a convex optimization problem, and then the analytic expression for the optimal solution to the relaxed convex optimization problem is derived. The optimal value of the relaxed convex optimization problem provides a detection performance guarantee for the BIoT in the presence of attacks. In addition, we develop a coordinate descent algorithm which is based on a capped water-filling method to solve the relaxed convex optimization problem, and moreover, we show that the convergence of the proposed coordinate descent algorithm can be guaranteed.

READ FULL TEXT

page 1

page 9

research
05/04/2018

A Convex Approximation of the Relaxed Binaural Beamforming Optimization Problem

The recently proposed relaxed binaural beamforming (RBB) optimization pr...
research
08/07/2018

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension

We describe a factor-revealing convex optimization problem for the integ...
research
03/05/2021

Energy-Efficient Task Offloading and Resource Allocation for Multiple Access Mobile Edge Computing

In this paper, the problem of joint radio and computation resource manag...
research
12/01/2022

Top-k data selection via distributed sample quantile inference

We consider the problem of determining the top-k largest measurements fr...
research
11/04/2015

Dictionary descent in optimization

The problem of convex optimization is studied. Usually in convex optimiz...
research
04/16/2018

Using Convex Optimization of Autocorrelation with Constrained Support and Windowing for Improved Phase Retrieval Accuracy

In imaging modalities recording diffraction data, the original image can...
research
05/24/2019

On the Performance Analysis of Binary Hypothesis Testing with Byzantine Sensors

We investigate the impact of Byzantine attacks in distributed detection ...

Please sign up or login with your details

Forgot password? Click here to reset