Message Identification for Task-Oriented Communications: Exploiting an Exponential Increase in the Number of Connected Devices

Torres-Figueroa, Luis; Ferrara, Roberto; Deppe, Christian; Boche, Holger

doi:10.1109/iotm.001.2300166

Cited by 1 publication

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…which is the closure of the inner bound. Therefore, since the closure of the inner bound region calculated in (24) coincides with the outer bound region given in (25), we obtain a closed form formula for the DI capacity of the BSC as follows:…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results

Salariseddigh,

Dabbabi,

Deppe

et al. 2024

Future Internet

Self Cite

View full text Add to dashboard Cite

Numerous applications of the Internet of Things (IoT) feature an event recognition behavior where the established Shannon capacity is not authorized to be the central performance measure. Instead, the identification capacity for such systems is considered to be an alternative metric, and has been developed in the literature. In this paper, we develop deterministic K-identification (DKI) for the binary symmetric channel (BSC) with and without a Hamming weight constraint imposed on the codewords. This channel may be of use for IoT in the context of smart system technologies, where sophisticated communication models can be reduced to a BSC for the aim of studying basic information theoretical properties. We derive inner and outer bounds on the DKI capacity of the BSC when the size of the goal message set K may grow in the codeword length n. As a major observation, we find that, for deterministic encoding, assuming that K grows exponentially in n, i.e., K=2nκ, where κ is the identification goal rate, then the number of messages that can be accurately identified grows exponentially in n, i.e., 2nR, where R is the DKI coding rate. Furthermore, the established inner and outer bound regions reflects impact of the input constraint (Hamming weight) and the channel statistics, i.e., the cross-over probability.

show abstract

Section: Resultsmentioning

confidence: 99%

“…These applications often ignore a reliable transmission of bits/symbols, and instead are alarm-triggered and demand to convey the semantic aspects of the messages. Potential applications of the K-identification problem for IoT systems are considered in [25].…”

Section: Iot Needs and Impact Of The Deterministic K-identificationmentioning

confidence: 99%

Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results

Salariseddigh,

Dabbabi,

Deppe

et al. 2024

Future Internet

Self Cite

View full text Add to dashboard Cite

show abstract

Message Identification for Task-Oriented Communications: Exploiting an Exponential Increase in the Number of Connected Devices

Cited by 1 publication

References 12 publications

Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results

Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results

Contact Info

Product

Resources

About