Alexander Wietfeld;Sebastian Schmidt;Wolfgang Kellerer
{"title":"Error Probability Optimization for Non-Orthogonal Multiple Access in DBMC Networks","authors":"Alexander Wietfeld;Sebastian Schmidt;Wolfgang Kellerer","doi":"10.1109/TMBMC.2024.3420739","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3420739","url":null,"abstract":"Non-orthogonal multiple access (NOMA) represents a promising option for differentiating multiple transmitters using only a single molecule type in a future diffusion-based molecular communication (DBMC) network. This paper addresses the bit error probability optimization of a DBMC-NOMA network with bio-nano-machines incapable of complex computations for classical optimization methods. We propose a pilot-symbol-based algorithm to approximate the optimal detection threshold and emitted number of transmitted molecules. Our solution is based on two algorithms for the separate optimization of thresholds and the number of molecules, which are applied alternatingly. Our Monte-Carlo simulation results show that the algorithm reliably approaches the global optimum parameter values regardless of initial values and signaling-molecule-to-noise ratio. Since it is composed of only a few basic operations, such as comparisons and additions, there is potential for an implementation using stochastic chemical reaction networks in future work.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10577441","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lisa Y. Debus;Pit Hofmann;Jorge Torres Gómez;Frank H. P. Fitzek;Falko Dressler
{"title":"Synchronized Relaying in Molecular Communication: An AI-Based Approach Using a Mobile Testbed Setup","authors":"Lisa Y. Debus;Pit Hofmann;Jorge Torres Gómez;Frank H. P. Fitzek;Falko Dressler","doi":"10.1109/TMBMC.2024.3420792","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3420792","url":null,"abstract":"Relay mechanisms are an important part of communication systems and, therefore, naturally occurring molecular communication (MC) links. Multiple techniques have been proposed for designing MC relay-aided setups, assuming synchronous operation and perfect timing during the decoding process. In this paper, we propose using a reinforcement learning (RL)-based synchronizer to continually adapt a decoding threshold and detect transmitted synchronization frames in a dynamic MC environment. We implement our approach in a two-hop MC link model with mobility and show its advantages compared to filter-based maximum likelihood (ML) synchronization. Thereby, we utilized a macroscale, air-based MC testbed for the experimental determination of the channel impulse response (CIR) for a more realistic channel model. Our simulation results exhibit the potential of an RL-based synchronizer with a similarly high detection rate, a false positive rate one order of magnitude lower, and a misalignment several bit times lower compared to the state of the art.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QL-Based Adaptive Transceivers for the IoBNT Communications","authors":"Roya Khanzadeh;Stefan Angerbauer;Jorge Torres Gomez;Andreas Springer;Falko Dressler;Werner Haselmayr","doi":"10.1109/TMBMC.2024.3420749","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3420749","url":null,"abstract":"This paper introduces an adaptive transceiver scheme for bio-nano things (NTs) situated within blood vessels communicating through a time-varying molecular channel. The proposed scheme employs a Q-learning-based adaptive transceiver (a so-called QL-ADT), wherein an agent gradually learns how to adapt the transmission parameters to the current state of the channel. A real heart rate dataset is used to estimate the blood flow velocities over time, based on which a time-varying molecular channel is modelled. In the practical implementation of the QL-ADT, an external gateway, situated on the skin, monitors the body’s heart rate over time and interfaces with the NTs through implantable nano devices. The gateway dynamically adjusts the communication parameters of the NTs based on the measured heart rate and what it has learned during the training phase. The proposed QL-ADT scheme showed significant improvement in the achievable raw bit rate (RBR) and error performance for a real heart rate dataset.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10577429","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Communications Society Information","authors":"","doi":"10.1109/TMBMC.2024.3401513","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3401513","url":null,"abstract":"","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10562045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141422490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Guest Editorial Plenty of Room at at Bottom: Ten Years of DNA-Based Data Storage","authors":"Han Mao Kiah;Paul H. Siegel;Eitan Yaakobi","doi":"10.1109/TMBMC.2024.3408174","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3408174","url":null,"abstract":"This special issue places the spotlight on the coding problems and solutions related to storing digital information on synthetic DNA strands and we are fortunate to present a collection of 9 outstanding manuscripts showcasing new developments in this area. The articles contain exciting recent results covering all aspects of the DNA data storage system: from synthesis to sequencing. We extend our gratitude to the authors of all submitted manuscripts, the anonymous referees, editorial staff Christina Keller and the Editor-in-Chief Sasitharan Balasubramaniam. We are excited about this issue and hope it will serve as both a useful reference and an inspiration for future work in this area.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10562196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141422541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications Publication Information","authors":"","doi":"10.1109/TMBMC.2024.3401509","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3401509","url":null,"abstract":"","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10562044","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141422578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhen Cheng;Jun Yan;Jie Sun;Shubin Zhang;Kaikai Chi
{"title":"Resource Allocation Optimization in Mobile Multiuser Molecular Communication by Deep Neural Network","authors":"Zhen Cheng;Jun Yan;Jie Sun;Shubin Zhang;Kaikai Chi","doi":"10.1109/TMBMC.2024.3412669","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3412669","url":null,"abstract":"Mobile molecular communication (MMC) is expected to be a promising technology for drug delivery. This paper studies a multiuser MMC system in a three-dimensional diffusive environment, which is composed of multiple transmitter nanomachines and one receiver nanomachine. Considering that all transmitter nanomachines release the same type of molecules for information transmission, the mechanism of time division multiple access (TDMA) is employed in this system. Under the release resource constraint which requires that the total number of released molecules of all transmitter nanomachines is fixed, the resource allocation optimization plays a significant role in the performance of this system. When the environmental variables in this multiuser MMC system change, the traditional optimization algorithms need to reoptimize the resource allocation to minimize the average bit error probability (BEP) of this system, which results in more run time. In order to reduce the run time, we propose an algorithm designed based on deep neural network (DNN) to obtain the optimal resource allocation scheme. For the trained DNN, once the input is given, it does not need to re-execute the optimization process and the output can be instantaneously obtained. The numerical results show that the proposed algorithm has a shorter run time and lower average BEP compared with other existing traditional optimization algorithms used in MMC, including bisection algorithm and genetic algorithm. The optimization results are approximate to the optimal solutions obtained by the exhaustive search. These analysis results can provide help in designing a multiuser MMC with optimal resource allocation.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bounds on the Maximum Cardinality of Indel and Substitution Correcting Codes","authors":"Ward J. P. Spee;Jos H. Weber","doi":"10.1109/TMBMC.2024.3388971","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3388971","url":null,"abstract":"Recent advances in DNA data storage have attracted renewed attention towards deletion, insertion and substitution correcting codes. Compared to codes aimed at correcting either substitution errors or deletion and insertion (indel) errors, the understanding of codes that correct combinations of substitution and indel errors lags behind. In this paper, we focus on the maximal size of q-ary t-indel s-substitution correcting codes.Our main contributions include two Gilbert-Varshamov inspired lower bounds on this size. On the upper bound side, we prove a Singleton-like bound, a family of sphere-packing upper bounds and an integer linear programming bound. Several of these bounds are shown to improve upon existing results. Moreover, we use these bounds to derive a lower bound and an upper bound on the asymptotic redundancy of maximally sized t-indel s-substitution correcting codes.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141422495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling Diffusion Between Regions With Different Diffusion Coefficients","authors":"Steven S. Andrews","doi":"10.1109/TMBMC.2024.3388977","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3388977","url":null,"abstract":"Biological systems often include spatial regions with different diffusion coefficients. Explicitly simulating their physical causes is computationally intensive, so it is typically preferable to simply vary the coefficients. This raises the question of how to address the boundaries between the regions. Making them fully permeable in both directions seems intuitively reasonable, but causes molecular motion to be simulated as active diffusion, meaning that it arises from energy that is continuously added to the system; in this case, molecules accumulate on the slow-diffusing side. However, molecular motion in most biochemical systems is better described as thermal diffusion, meaning that it occurs even at equilibrium. This can be simulated by reducing the transmission probability into the slow-diffusing side, which yields the correct result that spatially varying diffusion coefficients that arise from macromolecular crowding, changes in viscosity, or other energy-neutral influences do not affect equilibrium molecular concentrations. This work presents transmission coefficients and transmission probability equations for simulating thermal diffusion, including for cases with free energy differences and/or volume exclusion by crowders. They have been implemented in the Smoldyn particle-based simulation software.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sequencing Coverage Analysis for Combinatorial DNA-Based Storage Systems","authors":"Inbal Preuss;Ben Galili;Zohar Yakhini;Leon Anavy","doi":"10.1109/TMBMC.2024.3408053","DOIUrl":"https://doi.org/10.1109/TMBMC.2024.3408053","url":null,"abstract":"This study introduces a novel model for analyzing and determining the required sequencing coverage in DNA-based data storage, focusing on combinatorial DNA encoding. We seek to characterize the distribution of the number of sequencing reads required for message reconstruction. We use a variant of the coupon collector distribution for this purpose. For any given number of observed reads, \u0000<inline-formula> <tex-math>$Rin mathbb {N}$ </tex-math></inline-formula>\u0000, we use a Markov Chain representation of the process to compute the probability of error-free reconstruction. We develop theoretical bounds on the decoding probability and use empirical simulations to validate these bounds and assess tightness. This work contributes to understanding sequencing coverage in DNA-based data storage, offering insights into decoding complexity, error correction, and sequence reconstruction. We provide a Python package, with its input being the code design and other message parameters, all of which are denoted as \u0000<inline-formula> <tex-math>$boldsymbol {Theta }$ </tex-math></inline-formula>\u0000, and a desired confidence level \u0000<inline-formula> <tex-math>$1-delta $ </tex-math></inline-formula>\u0000. This package computes the required read coverage, guaranteeing the message reconstruction \u0000<inline-formula> <tex-math>$R=R(delta,boldsymbol {Theta })$ </tex-math></inline-formula>\u0000.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543138","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141422488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}