Vahid Jamali

Bastian Heinlein, Timo Jakumeit, Robert Schober et al.

In nature, estimating the location of a molecule source in turbulent airflow is a central, and yet highly challenging problem for mate search and foraging. Recently, it has also received increasing attention in synthetic molecular communication (SMC), e.g., for leakage detection. One important aspect of source localization is to estimate the distance to the molecule source, e.g., to determine whether it is worth to travel to a potential mating partner or food source, or to decide whether a leak is close enough for inspection. In this study, based on realistic simulations, we show that the diversity induced by molecule mixtures can aid source localization. In particular, when different molecule types in a mixture are subject to atmospheric degradation with different degradation rates, the relative abundance of the different species observed at the receiver enables low-complexity estimation of the source distance. Furthermore, this feature can be combined with already established concentration-based and temporal features of observed molecular signals to further increase estimation accuracy. Thereby, we show that molecule degradation diversity of molecule mixtures can help to realize one of the important envisioned SMC applications, namely source localization, even in turbulent airflow, opening new opportunities for the exploitation of SMC to solve real-world problems.

Bastian Heinlein, Nuria Zurita Jiménez, Kaikai Zhu et al.

In this paper, we introduce an autoencoder (AE)-based scheme for end-to-end optimization of a multi-user molecule mixture communication system. In the proposed scheme, each transmitter leverages an encoder network that maps the user symbol to a molecule mixture. The mixtures then propagate through the channel to the receiver, which samples the channel using a non-linear, cross-reactive sensor array. A decoder network then estimates the symbol transmitted by each user based on the sensor observations. The proposed scheme achieves, for a given signal-to-noise ratio, lower symbol error rates than a baseline scheme from the literature in a single-user setting with full channel state information. We additionally demonstrate that the proposed AE-based scheme allows reliable communication when the channel is unknown or changing. Finally, we show that for multiple access the system can account for different user priorities. In summary, the proposed AE-based scheme enables end-to-end system optimization in complex scenarios unsuitable for analytical treatment and thereby brings molecular communication systems closer to real-world deployment.

Timo Jakumeit, Bastian Heinlein, Vukašin Spasojević et al.

Synthetic molecular communication (MC) has emerged as a powerful framework for modeling, analyzing, and designing communication systems where information is encoded into properties of molecules. Among the envisioned applications of MC is the localization of molecule sources in pipe networks (PNs) like the human cardiovascular system (CVS), sewage networks (SNs), and industrial plants. While existing algorithms mostly focus on simplified scenarios, in this paper, we propose the first framework for source localization in complex PNs with known topology, by leveraging the mixture of inverse Gaussians for hemodynamic transport (MIGHT) model as a closed-form representation for advection-diffusion-driven MC in PNs. We propose a matched filter (MF)-based approach to identify molecule sources under realistic conditions such as unknown release times, random numbers of released molecules, sensor noise, and limited sensor sampling rate. We apply the algorithm to localize a source of viral markers in a real-world SN and show that the proposed scheme outperforms randomly guessing sources even at low signal-to-noise ratios (SNRs) at the sensor and achieves error-free localization under favorable conditions, i.e., high SNRs and sampling rates. Furthermore, by identifying clusters of frequently confused sources, reliable cluster-level localization is possible at substantially lower SNRs and sampling rates.

Vahid Jamali, Antonia Tulino, Jaime Llorca et al.

Semi-supervised classification, one of the most prominent fields in machine learning, studies how to combine the statistical knowledge of the often abundant unlabeled data with the often limited labeled data in order to maximize overall classification accuracy. In this context, the process of actively choosing the data to be labeled is referred to as active learning. In this paper, we initiate the non-asymptotic analysis of the optimal policy for semi-supervised classification with actively obtained labeled data. Considering a general Bayesian classification model, we provide the first characterization of the jointly optimal active learning and semi-supervised classification policy, in terms of the cost-performance tradeoff driven by the label query budget (number of data items to be labeled) and overall classification accuracy. Leveraging recent results on the Rényi Entropy, we derive tight information-theoretic bounds on such active learning cost-performance tradeoff.