Abstract—We investigate the consensus problem in a network where nodes communicate via diffusion-based molecular communication (DbMC). In DbMC, messages are conveyed via the vari...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
In previous works, Juba and Sudan [6] and Goldreich, Juba and Sudan [4] considered the idea of "semantic communication", wherein two players, a user and a server, attemp...
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
In this paper we propose a system that will allow people to communicate their status with friends and family when they find themselves caught up in a large disaster (e.g., sending...
Abstract-- This paper presents a framework for generating time-optimal velocity profiles for a group of pathconstrained vehicle robots that have fixed and known initial and goal lo...
Protecting users' privacy is becoming one of the rising issues for the success of future communications. The Internet in particular, with its open architecture, presents sever...
The Internet has become a place of refuge for individuals with autism spectrum disorders (ASD). In particular, weblogs are a popular option for personal expression via the Interne...
A. Taylor Newton, Adam D. I. Kramer, Daniel N. McI...
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...