Related papers: Information transmission bounds between moving ter…
We consider a two-way data exchanging system where a master node transfers energy and data packets to a slave node alternatively. The slave node harvests the transferred energy and performs information transmission as long as it has…
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered…
A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between the source and the destination, and the relay…
While externally driven information engines are well understood, the thermodynamic constraints of their autonomous counterparts remain an open question. Here, we investigate the finite-time operation of an autonomous machine functioning as…
Modern sensing and monitoring applications typically consist of sources transmitting updates of different sizes, ranging from a few bytes (position, temperature, etc.) to multiple megabytes (images, video frames, LIDAR point scans, etc.).…
The idea that the velocity of transmitting substance/energy trough space-time is to be bounded is a fundamental concept in the science. To the most surprise, it turns out that it is not always met. We demonstrate that the existing…
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement…
As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…
We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…
A key measure of performance and comfort in a road traffic network is the travel time that the users of the network experience to complete their journeys. Travel times on road traffic networks are stochastic, highly variable, and dependent…
The architectural semantics of \emph{Information-Centric Networking} bring in interesting features in regards to mobility management: Information-Centric Networking is content-oriented, connection-less, and receiver-driven. Despite such…
Shannon's Capacity Theorem is the main concept behind the Theory of Communication. It says that if the amount of information contained in a signal is smaller than the channel capacity of a physical media of communication, it can be…
Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange which increases the communication size in steps…
In this paper, we study the consensus problem for continuous-time and discrete-time multi-agent systems in state-dependent switching networks. In each case, we first consider the networks with fixed connectivity, in which the communication…
Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class…
In this article, we present a finite time stopping criterion for consensus algorithms in networks with dynamic communication topology. Recent results provide asymptotic convergence to the consensus algorithm. However, the asymptotic…
We address the problem of message transfer in a communication network. The network consists of nodes and links, with the nodes lying on a two dimensional lattice. Each node has connections with its nearest neighbours, whereas some special…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the…
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple…