English
Related papers

Related papers: Null Messages, Information and Coordination

200 papers

Multi-robot coordination is crucial for autonomous systems, yet real-world deployments often encounter various failures. These include both temporary and permanent disruptions in sensing and communication, which can significantly degrade…

Robotics · Computer Science 2025-08-11 Peihan Li , Jiazhen Liu , Yuwei Wu , Lifeng Zhou

Zero-Error communication investigates communication without any error. By defining channels without probabilities, results from Elias can be used to completely characterize which channel can simulate which other channels. We introduce the…

Information Theory · Computer Science 2016-11-18 Jürg Wullschleger

This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel.…

Computer Science and Game Theory · Computer Science 2015-01-07 Penelope Hernandez , Bernhard von Stengel

We consider scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

Low-power wireless communication is a central building block of Cyber-physical Systems and the Internet of Things. Conventional low-power wireless protocols make avoiding packet collisions a cornerstone design choice. The concept of…

Networking and Internet Architecture · Computer Science 2020-01-27 Marco Zimmerling , Luca Mottola , Silvia Santini

A key concern in modern distributed systems is to avoid the cost of coordination while maintaining consistent semantics. Until recently, there was no answer to the question of when coordination is actually required. In this paper we present…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-29 Joseph M. Hellerstein , Peter Alvaro

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach,…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-09-29 Sylvie Delaët , Stéphane Devismes , Mikhail Nesterenko , Sébastien Tixeuil

Noiseless subsystems offer a general and efficient method for protecting quantum information in the presence of noise that has symmetry properties. A paradigmatic class of error models displaying non-trivial symmetries emerges under…

In this paper, we propose a new framework for synchronization of heterogeneous multi agent system which we refer to as weak synchronization. This new framework of synchronization is based on achieving the network stability in the absence of…

Systems and Control · Electrical Eng. & Systems 2025-02-04 Anton A. Stoorvogel , Ali Saberi , Zhenwei Liu

We present initial results on a comprehensive model of structured communications, in which self- adaptation and security concerns are jointly addressed. More specifically, we propose a model of self-adaptive, multiparty communications with…

Logic in Computer Science · Computer Science 2014-08-27 Ilaria Castellani , Mariangiola Dezani-Ciancaglini , Jorge A. Pérez

Concurrent C0 is an imperative programming language in the C family with session-typed message-passing concurrency. The previously proposed semantics implements asynchronous (non-blocking) output; we extend it here with non-blocking input.…

Logic in Computer Science · Computer Science 2017-01-19 Miguel Silva , Mário Florido , Frank Pfenning

We introduce a novel blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), to reliably transmit short binary packets over unknown finite impulse response systems as used, for example, to model…

Information Theory · Computer Science 2018-05-22 Philipp Walk , Peter Jung , Babak Hassibi

We present an algorithm for synchronous deterministic Byzantine consensus, tolerant to links failures and links asynchrony. It cares for a class of networks with specific needs, where both safety and liveness are essential, and timely…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-24 Ivan Klianev

Shannon's theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly, and in the presence of various resources that are all classes of non-signalling correlations:…

Quantum Physics · Physics 2016-11-17 Toby S. Cubitt , Debbie Leung , William Matthews , Andreas Winter

Vehicle-to-vehicle communication is a fundamental requirement in cooperative vehicular systems to achieve high performance while keeping high safety standards. Vehicles periodically exchange critical information with nearby vehicles to…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-02 Oscar Morales-Ponce , Elad M. Schiller , Paolo Falcone

Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…

Data Structures and Algorithms · Computer Science 2008-11-25 Stéphane Devismes , Toshimitsu Masuzawa , Sébastien Tixeuil

Load balancing across parallel servers is an important class of congestion control problems that arises in service systems. An effective load balancer relies heavily on accurate, real-time congestion information to make routing decisions.…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-24 Gal Mendelson , Xu Kuang

Communication systems to date primarily aim at reliably communicating bit sequences. Such an approach provides efficient engineering designs that are agnostic to the meanings of the messages or to the goal that the message exchange aims to…

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in…

Information Theory · Computer Science 2013-07-30 Ilia Levi , Dan Vilenchik , Michael Langberg , Michelle Effros

This paper studies the organization of communication between biased senders and a receiver. Senders can misreport their private information at a cost. Efficiency is achieved by clearing information asymmetries without incurring costs.…

Theoretical Economics · Economics 2025-02-04 Federico Vaccari