Search arXivSearch

arXiv · 2104.11864

Membrane Fusion-Based Transmitter Design for Static and Diffusive Mobile Molecular Communication Systems

Abstract

This paper proposes a novel imperfect transmitter (TX) model, namely the membrane fusion (MF)-based TX, that adopts MF between a vesicle and the TX membrane to release molecules encapsulated within the vesicle. For the MF-based TX, the molecule release probability and the fraction of molecules released from the TX membrane are derived. Incorporating molecular degradation and a fully-absorbing receiver (RX), the channel impulse response (CIR) is derived for two scenarios: 1) Both TX and RX are static, and 2) both TX and RX are diffusion-based mobile. Moreover, a sequence of bits transmitted from the TX to the RX is considered. The average bit error rate (BER) is obtained for both scenarios, wherein the probability mass function (PMF) of the number of molecules absorbed in the mobile scenario is derived. Furthermore, a simulation framework is proposed for the MF-based TX, based on which the derived analytical expressions are validated. Simulation results show that a low MF probability or low vesicle mobility slows the release of molecules and reduces the molecule hitting probability at the RX. Simulation results also indicate the difference between the MF-based TX and an ideal point TX in terms of the inter-symbol interference (ISI).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinyu Huang, Yuting Fang, Adam Noel, Nan Yang. 2021-10-24. Membrane Fusion-Based Transmitter Design for Static and Diffusive Mobile Molecular Communication Systems. https://arxiv.org/abs/2104.11864

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