Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors,
modeled as nodes of an underlying directed communication graph. We study the problem of …

We consider a graph-theoretic property known as r-robustness which plays a key role in a
class of consensus (or opinion) dynamics where each node ignores its most extreme …

With the emergence of the Internet of Things (IoT) and machine to machine (M2M)
communications, massive growth in the IoT-enabled wireless sensor node deployment is …

The problem of consensus in the presence of misbehaving agents has increasingly attracted
attention in the literature. Prior results have established algorithms and graph structures for …

Wireless sensor networks (WSNs) are composed of a large number of sensor nodes that are
deployed at target locations. Topology control (TC) is one of the significant fundamental …

This paper considers the Byzantine consensus problem for nodes with binary inputs. The
nodes are interconnected by a network represented as an undirected graph, and the system …

This article presents a novel method for a class of multirobot networks to resiliently
propagate vector messages from a set of leaders to all followers within the network in the …

The Byzantine tolerant reliable communication primitive is a fundamental building block in
distributed systems that guarantees the authenticity, integrity, and delivery of information …

We explore the correctness of the Certified Propagation Algorithm (CPA)[6],[1],[8],[5] in
solving broadcast with locally bounded Byzantine faults. CPA allows the nodes to use only …

Broadcast is one of the fundamental primitives to enable large-scale networks such as
sensor networks and IoT. There is a rich study on achieving reliable broadcast under various …