Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2105.01590

Area Rate Efficiency in Molecular Communications

Lukas Brand·Sebastian Lotter·Vahid Jamali·Robert Schober
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a multiuser diffusion-based molecular communication (MC) system where multiple spatially distributed transmitter (TX)-receiver (RX) pairs establish point-to-point communication links employing the same type of signaling molecules. To realize the full potential of such a system, an in-depth understanding of the interplay between the spatial user density and inter-user interference (IUI) and its impact on system performance in an asymptotic regime with large numbers of users is needed. In this paper, we adopt a three-dimensional (3-D) system model with multiple independent and spatially distributed point-to-point transmission links, where both the TXs and RXs are positioned according to a regular hexagonal grid, respectively. Based on this model, we first derive an expression for the channel impulse responses (CIRs) of all TX-RX links in the system. Then, we provide the maximum likelihood (ML) decision rule for the RXs and show that it reduces to a threshold-based detector. We derive an analytical expression for the corresponding detection threshold which depends on the statistics of the MC channel and the statistics of the IUI. Furthermore, we derive an analytical expression for the bit error rate (BER) and the achievable rate of a single transmission link. Finally, we propose a new performance metric, which we refer to as area rate efficiency (ARE), that captures the tradeoff between the user density and IUI. The ARE characterizes how efficiently given TX and RX areas are used for information transmission and is given in terms of bits per area unit. We show that there exists an optimal user density for maximization of the ARE. Results from particle-based and Monte Carlo simulations validate the accuracy of the expressions derived for the CIR, optimal detection threshold, BER, and ARE.

Explore related subjects

cs.ITcs.ETmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lukas Brand, Sebastian Lotter, Vahid Jamali, Robert Schober. 2021-05-04. Area Rate Efficiency in Molecular Communications. https://arxiv.org/abs/2105.01590

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

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗