Mathematical Foundations for Information Theory in Diffusion-Based Molecular Communications

Ya-Ping Hsieh, Ping-Cheng YeharXiv 2013 · OpenReview

Abstract

Molecular communication emerges as a promising communication paradigm for nanotechnology. However, solid mathematical foundations for information-theoretic analysis of molecular communication have not yet been built. In particular, no one has ever proven that the channel coding theorem applies for molecular communication, and no relationship between information rate capacity (maximum mutual information) and code rate capacity (supremum achievable code rate) has been established. In this paper, we focus on a major subclass of molecular communication - the diffusion-based molecular communication. We provide solid mathematical foundations for information theory in diffusion-based molecular communication by creating a general diffusion-based molecular channel model in measure-theoretic form and prove its channel coding theorems. Various equivalence relationships between statistical and operational definitions of channel capacity are also established, including the most classic information rate capacity and code rate capacity. As byproducts, we have shown that the diffusion-based molecular channel is with "asymptotically decreasing input memory and anticipation" and "d-continuous". Other properties of diffusion-based molecular channel such as stationarity or ergodicity are also proven.

Introduction: The Challenge of Molecular Diffusion

Molecular communication is an emerging paradigm for nanotechnology where information is encoded into molecules and transmitted through a fluid medium, such as the human bloodstream. Unlike classical electromagnetic communication, the movement of these molecules is governed by random diffusion, introducing a unique form of noise: the disorder of message arrivals.

Physical model of diffusion-based molecular communication in a fluid medium.

In this environment, a molecule transmitted later might arrive at the receiver before one transmitted earlier due to the stochastic nature of Brownian motion. Classical communication models, which typically handle link-layer packet drops or additive noise, lack the mathematical framework to address this infinite-variable random ordering of "first passage times." Consequently, prior to this research, there was no rigorous proof that Shannon's channel coding theorem applied to diffusion-based molecular systems. This gap meant that theoretical "channel capacity" calculations lacked a guaranteed correspondence to practical, operational data transmission limits.

Methodology: Modeling the Permutation Channel

To bridge this gap, the authors employ a rigorous measure-theoretic formulation. They introduce a novel abstraction known as the permutation channel to handle the out-of-order arrival of molecules.

Timing diagram showing transmission intervals and reception delays in a molecular channel.

As shown in the timing diagram above, molecules are released at times $T_1, T_2, \dots$ and arrive after random delays $D, D', D'', \dots$. The permutation channel models this random ordering as an infinite permutation matrix applied to the input sequence. The complete diffusion-based molecular channel is then represented as a cascade of this permutation channel and a receiver channel.

To prove the coding theorems, the authors utilize two advanced information-theoretic concepts:

  1. Asymptotically Decreasing Input Memory and Anticipation (ADIMA): This property ensures that the channel's output becomes increasingly independent of inputs that are distant in time.
  2. $\bar{d}$-continuity: A robust measure of distance between probability distributions that remains stable even under modeling approximations.

The research demonstrates that the physical properties of diffusion naturally satisfy the conditions for both ADIMA and $\bar{d}$-continuity, enabling the application of powerful ergodic and mixing theorems.

Key Insights

  • Super-exponential Decay of Overtaking: A universal physical property of diffusion processes (like Brownian motion with drift) is that the probability of a later molecule overtaking an earlier one decays super-exponentially as the release time gap increases. This justifies the "asymptotically decreasing input memory" assumption.
  • The Permutation Channel Abstraction: Modeling physical disorder as an infinite permutation matrix isolates the specific randomness of molecular communication from standard receiver noise, providing a powerful conceptual tool.
  • Robustness through $\bar{d}$-continuity: While ADIMA is sensitive to modeling errors, $\bar{d}$-continuity is preserved even under limits. This ensures that the capacity theorems hold for actual physical channels, not just idealized mathematical models.

Results and Theoretical Implications

The study establishes the Fundamental Theorem of Diffusion-Based Molecular Communication, proving that for a stationary ergodic source, six different definitions of capacity are mathematically equivalent. Crucially, the theoretical Shannon capacity ($C$) is shown to be exactly equal to the operational channel block coding capacity ($C_{cb}$).

Furthermore, the authors prove the Channel Coding Theorem for these systems: if data is transmitted at a rate $R < C$, block codes exist that can achieve an arbitrarily small error probability. Conversely, if $R > C$, the error probability is strictly bounded away from zero. The paper also formally proves that these channels are stationary, ergodic, and strongly mixing.

Limitations and Future Directions

While the proofs rely on the qualitative properties of the permutation matrix distribution, finding an explicit, closed-form solution for this distribution remains an open mathematical challenge. Additionally, this work focuses on discrete alphabets. Future research could extend these foundational results to continuous alphabets, which are relevant for transmitting information via continuous concentration waveforms in molecular systems.

Summary updated

Abstract

Molecular communication emerges as a promising communication paradigm for nanotechnology. However, solid mathematical foundations for information-theoretic analysis of molecular communication have not yet been built. In particular, no one has ever proven that the channel coding theorem applies for molecular communication, and no relationship between information rate capacity (maximum mutual information) and code rate capacity (supremum achievable code rate) has been established. In this paper, we focus on a major subclass of molecular communication - the diffusion-based molecular communication. We provide solid mathematical foundations for information theory in diffusion-based molecular communication by creating a general diffusion-based molecular channel model in measure-theoretic form and prove its channel coding theorems. Various equivalence relationships between statistical and operational definitions of channel capacity are also established, including the most classic information rate capacity and code rate capacity. As byproducts, we have shown that the diffusion-based molecular channel is with "asymptotically decreasing input memory and anticipation" and "d-continuous". Other properties of diffusion-based molecular channel such as stationarity or ergodicity are also proven.
BibTeX
@misc{hsieh2013mathematical,
  author = {Ya-Ping Hsieh and Ping-Cheng Yeh},
  title = {{Mathematical Foundations for Information Theory in Diffusion-Based Molecular Communications}},
  year = {2013},
  eprint = {1311.4431},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1311.4431},
}
Figure