Related papers: Zero Error Coordination
Synchronization problem for linear coupled networks is a hot topic in recent decade. However, until now, some confused concepts and results still puzzle people. To avoid further misleading researchers, it is necessary to point out these…
We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that…
Recently, information cascade prediction has attracted increasing interest from researchers, but it is far from being well solved partly due to the three defects of the existing works. First, the existing works often assume an underlying…
The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, in that they undergo a change in the statistics of their…
This paper presents a class of passivity-based cooperative control problems that have an explicit connection to convex network optimization problems. The new notion of maximal equilibrium independent passivity is introduced and it is shown…
As the world becomes more and more interconnected, our everyday objects become part of the Internet of Things, and our lives get more and more mirrored in virtual reality, where every piece of~information, including misinformation, fake…
Semantic Image Interpretation is the task of extracting a structured semantic description from images. This requires the detection of visual relationships: triples (subject,relation,object) describing a semantic relation between a subject…
We consider the detection of a correlated random process immersed in noise in a wireless sensor network. Each node has an individual energy constraint and the communication with the processing central units are affected by the path loss…
We consider a cascade network where a sequence of nodes each send a message to their downstream neighbor to enable coordination, the first node having access to an information signal. An adversary also receives all of the communication as…
Most current distributed processing research deals with improving the flexibility and convergence speed of algorithms for networks of finite size with no constraints on information sharing and no concept for expected levels of signal…
Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. For non identical elements, the lack of…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…
In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power, data rate, or…
The interaction among spreading processes on a complex network is a nontrivial phenomenon of great importance. It has recently been realized that cooperative effects among infective diseases can give rise to qualitative changes in the…
We consider the problem of reliable communication over a network containing a hidden {\it myopic} adversary who can eavesdrop on some $z_{ro}$ links, jam some $z_{wo}$ links, and do both on some $z_{rw}$ links. We provide the first…
In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a…
We present a synchronization algorithm to let nodes in a sensor network simultaneously execute a task at a given point in time. In contrast to other time synchronization algorithms we do not provide a global time basis that is shared on all…
We analyze the problem of localization algorithms for underwater sensor networks. We first characterize the underwater channel for radio communications and adjust a linear model with measurements of real transmissions. We propose an…
Coordination games with explicit spatial or relational structure are of interest to economists, ecologists, sociologists, and others studying emergent global properties in collective behavior. When assemblies of individuals seek to…