English
Related papers

Related papers: A Message Passing Approach for Decision Fusion in …

200 papers

The Byzantine distributed quickest change detection (BDQCD) is studied, where a fusion center monitors the occurrence of an abrupt event through a bunch of distributed sensors that may be compromised. We first consider the binary hypothesis…

Information Theory · Computer Science 2019-09-09 Yu-Chih Huang , Yu-Jui Huang , Shih-Chun Lin

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-28 Petr Kuznetsov , Andrei Tonkikh , Yan X Zhang

This paper proposes an energy-efficient counting rule for distributed detection by ordering sensor transmissions in wireless sensor networks. In the counting rule-based detection in an $N-$sensor network, the local sensors transmit binary…

Information Theory · Computer Science 2018-09-12 N. Sriranga , K. G. Nagananda , R. S. Blum , A. Saucan , P. K. Varshney

In this letter, we consider the problem of distributed Bayesian detection in the presence of data falsifying Byzantines in the network. The problem of distributed detection is formulated as a binary hypothesis test at the fusion center (FC)…

Applications · Statistics 2015-06-22 Bhavya Kailkhura , Yunghsiang S. Han , Swastik Brahma , Pramod K. Varshney

The essential of navigation, perception, and decision-making which are basic tasks for intelligent robots, is to estimate necessary system states. Among them, navigation is fundamental for other upper applications, providing precise…

Robotics · Computer Science 2024-01-12 Feng Zhu , Zhuo Xu , Xveqing Zhang , Yuantai Zhang , Weijie Chen , Xiaohong Zhang

We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-15 Timothé Albouy , Davide Frey , Ran Gelles , Carmit Hazay , Michel Raynal , Elad Michael Schiller , François Taïani , Vassilis Zikas

This paper explores an old problem, {\em Byzantine fault-tolerant Broadcast} (BB), under a new model, {\em selective broadcast model}. The new model "interpolates" between the two traditional models in the literature. In particular, it…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-02-03 Lewis Tseng , Nitin Vaidya

Byzantine reliable broadcast is a fundamental problem in distributed computing, which has been studied extensively over the past decades. State-of-the-art algorithms are predominantly based on the approach to share encoded fragments of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-06 Thomas Locher

We consider a power-constrained sensor network, consisting of multiple sensor nodes and a fusion center (FC), that is deployed for the purpose of estimating a common random parameter of interest. In contrast to the distributed framework,…

Information Theory · Computer Science 2012-05-16 Swarnendu Kar , Pramod K. Varshney

This paper develops a mathematical and computational framework for analyzing the expected performance of Bayesian data fusion, or joint statistical inference, within a sensor network. We use variational techniques to obtain the posterior…

Statistics Theory · Mathematics 2016-02-23 Gaurav Thakur

We consider the federated learning problem where data on workers are not independent and identically distributed (i.i.d.). During the learning process, an unknown number of Byzantine workers may send malicious messages to the central node,…

Machine Learning · Computer Science 2021-08-31 Jie Peng , Zhaoxian Wu , Qing Ling , Tianyi Chen

This paper proposes a new method for solving Bayesian decision problems. The method consists of representing a Bayesian decision problem as a valuation-based system and applying a fusion algorithm for solving it. The fusion algorithm is a…

Artificial Intelligence · Computer Science 2013-03-26 Prakash P. Shenoy

We study the problem of Byzantine fault tolerance in a distributed optimization setting, where there is a group of $N$ agents communicating with a trusted centralized coordinator. Among these agents, there is a subset of $f$ agents that may…

Optimization and Control · Mathematics 2023-12-19 Amit Dutta , Thinh T. Doan , Jeffrey H. Reed

In this paper, the error performance achieved by cooperative detection among K distributed receivers in a diffusion-based molecular communication (MC) system is analyzed and optimized. In this system, the receivers first make local hard…

Information Theory · Computer Science 2024-10-30 Yuting Fang , Adam Noel , Nan Yang , Andrew W. Eckford , Rodney A. Kennedy

This paper presents a framework to evaluate the probability that a decision error event occurs in wireless sensor networks, including sensing and communication errors. We consider a scenario where sensors need to identify whether a given…

Information Theory · Computer Science 2016-02-17 Pedro H. J. Nardelli , Iran Ramezanipour , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho

In this paper, we consider a min-max optimization problem under adversarial manipulation, where there are $n$ cost functions, up to $f$ of which may be replaced by arbitrary faulty functions by an adversary. The goal is to minimize the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-19 Shuo Liu , Nitin Vaidya

This paper presents a two-phase cooperative communication strategy and an optimal power allocation strategy to transmit sensor observations to a fusion center in a large-scale sensor network. Outage probability is used to evaluate the…

Networking and Internet Architecture · Computer Science 2012-08-23 Li Li , Kamesh Namuduri , Shengli Fu

This paper addresses a detection problem where several spatially distributed sensors independently observe a time-inhomogeneous stochastic process. The task is to decide between two hypotheses regarding the statistics of the observed…

Probability · Mathematics 2012-10-05 Chetan D. Pahlajani , Ioannis Poulakakis , Herbert G. Tanner

We study a class of binary detection problems involving a single fusion center and a large or countably infinite number of sensors. Each sensor acts under a decentralized information structure, accessing only a local noisy observation…

Optimization and Control · Mathematics 2025-09-29 Sina Sanjari , Naci Saldi , Sinan Gezici , Serdar Yüksel

We consider the problem of distributed binary hypothesis testing in a parallel network topology where sensors independently observe some phenomenon and send a finite rate summary of their observations to a fusion center for the final…

Information Theory · Computer Science 2016-06-29 Alla Tarighati , Joakim Jalden