相关论文: Making Evildoers Pay: Resource-Competitive Broadca…
We consider a system of multiple sources, a single communication channel, and a single monitoring station. Each source measures a time-varying quantity with varying levels of accuracy and one of them sends its update to the monitoring…
We address the problem of reaching consensus in the presence of Byzantine faults. In particular, we are interested in investigating the impact of messages relay on the network connectivity for a correct iterative approximate Byzantine…
Wireless sensor networks (WSN) are characterized by a network of small, battery powered devices, operating remotely with no pre-existing infrastructure. The unique structure of WSN allow for novel approaches to data reduction and energy…
We study a multi-agent resilient consensus problem, where some agents are of the Byzantine type and try to prevent the normal ones from reaching consensus. In our setting, normal agents communicate with each other asynchronously over…
The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any…
We propose a novel covert communication system in which a ground user, Alice, transmits unauthorized message fragments to Bob, a low-Earth orbit satellite (LEO), and an unmanned aerial vehicle (UAV) warden (Willie) attempts to detect these…
The study of the fundamental limits of covert communications, where a transmitter Alice wants to send information to a desired recipient Bob without detection of that transmission by an attentive and capable warden Willie, has emerged…
Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve performance goals in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a…
We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic…
We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in…
This work considers resilient, cooperative state estimation in unreliable multi-agent networks. A network of agents aims to collaboratively estimate the value of an unknown vector parameter, while an {\em unknown} subset of agents suffer…
We consider the problem of fault-tolerant parallel search on an infinite line by $n$ robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed $1$ and can…
Today's cyber-physical systems face various impediments to achieving their intended goals, namely, communication uncertainties and faults, relative to the increased integration of networked and wireless devices, hinder the synchronism…
In this letter, we investigate the security of a single-antenna rechargeable source node in the presence of a multi-antenna rechargeable cooperative jammer and a potential single-antenna eavesdropper. The batteries at the legitimate…
Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with…
The capacity of symmetric private information retrieval with $K$ messages, $N$ servers (out of which any $T$ may collude), and an omniscient Byzantine adversary (who can corrupt any $B$ answers) is shown to be $1 - \frac{T+2B}{N}$ [1],…
Linear precoding and cooperative jamming for multiuser broadcast channel is studied to enhance the physical layer security. We consider the system where multiple independent data streams are transmitted from the base station to multiple…
The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…
We investigate the problem of reliable communication in the presence of active adversaries that can tamper with the transmitted data. We consider a legitimate transmitter-receiver pair connected over multiple communication paths (routes).…
The ordered transmission (OT) scheme reduces the number of transmissions needed in the network to make the final decision, while it maintains the same probability of error as the system without using OT scheme. In this paper, we investigate…