Search arXivSearch

arXiv · 2311.14917

Consolidate Viability and Information Theories for Task-Oriented Communications: A Homeostasis Solution

Abstract

The next generation of cellular networks, 6G, is expected to offer a range of exciting applications and services, including holographic communication, machine-to-machine communication, and data sensing from millions of devices. There is an incremental exhaustion of the spectral resources. It is crucial to efficiently manage these resources through value-driven approaches that eliminate waste and continually enhance the communication process. These management principles align with the Task-Oriented Communications (TOC) philosophy. The aim is to allocate the minimum necessary communication resource according to the receiver's objective and continuously improve the communication process. However, it is currently unclear how to build knowledge of the receiver's goal and operate accordingly for efficient-resource utilization. Our management approach combines viability theory and transfer entropy to ensure that the actor remains within a viable space as per their goal and to gradually reduce the information exchange through knowledge accumulation. We discuss these theories in the context of TOC and examine their application in the plant process control case. Finally, we provide insights into future research directions from computational, performance, and protocol perspectives.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ozgur Ercetin, Mohaned Chraiti, Rustu Erciyes Karakaya. 2023-11-25. Consolidate Viability and Information Theories for Task-Oriented Communications: A Homeostasis Solution. https://arxiv.org/abs/2311.14917

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT