Goal-Oriented Medium Access with Distributed Belief Processing
Federico Chiariotti, Andrea Munari, Leonardo Badia, Petar Popovski
TL;DR
The paper tackles goal-oriented communication in dense sensor networks by introducing DELTA, a distributed MAC that leverages dynamic epistemic logic and common knowledge to minimize the Age of Incorrect Information ($\mathrm{AoII}$). By modeling four public-feedback-driven phases and applying Bayes-like belief updates, DELTA achieves collision-aware access with provable collision-resolution optimization and scalable belief management, including the DELTA+ variant and belief-threshold strategies. Simulation results show substantial improvements over random access and competitive gains over centralized scheduling, especially as the network scales, and the framework demonstrates resilience to imperfect feedback. The approach offers a principled, scalable path toward efficient anomaly reporting in large sensor networks and lays groundwork for richer epistemic-model extensions and more complex anomaly dynamics.
Abstract
Goal-oriented communication entails the timely transmission of updates related to a specific goal defined by the application. In a distributed setup with multiple sensors, each individual sensor knows its own observation and can determine its freshness, as measured by Age of Incorrect Information (AoII). This local knowledge is suited for distributed medium access, where the transmission strategies have to deal with collisions. We present Dynamic Epistemic Logic for Tracking Anomalies (DELTA), a medium access protocol that limits collisions and minimizes AoII in anomaly reporting over dense networks. Each sensor knows its own AoII, while it can compute the belief about the AoII for all other sensors, based on their Age of Information (AoI), which is inferred from the acknowledgments. This results in a goal-oriented approach based on dynamic epistemic logic emerging from public information. We analyze the resulting DELTA protocol both from a theoretical standpoint and with Monte Carlo simulations, showing that it is significantly more efficient and robust than classical random access, while outperforming state-of-the-art scheduled schemes by at least 30%, even with imperfect feedback.
