Literature Database Entry


Joana Angjo, Ali E. Pusane, H. Birkan Yilmaz, Ertugrul Basar and Tuna Tugcu, "Optimal relaying in molecular communications," Elsevier Nano Communication Networks, vol. 32-33, pp. 100404, June 2022.


Molecular communication via diffusion (MCvD) schemes are limited to short distances between the nanomachines due to the transmitted signal becoming rapidly weaker as the distance increases. Additionally, these schemes are very often affected by high inter-symbol interference, which makes them prone to errors, thus leading to unreliability. In this paper, a novel system is proposed, which aims to enhance the received signal shape and the overall performance of MCvD schemes over longer distances. A relay nanomachine is introduced between the transmitter–receiver pair, which collects the first portion of the molecules emitted from the transmitter and keeps them for some delay time , then releases them towards the receiver, such that the delayed and non-delayed portions of the molecules arrive almost at the same time. In this way, the signal’s strength is enhanced by pointing more molecules towards the intended direction, that is, the receiver node. An analytical model for the optimal relaying scheme is proposed, alongside with an optimization problem to find the most advantageous value. Comparison between the proposed scheme and the conventional single-input single-output scenario is provided by means of analytical and computer simulation results, showing a promising improvement in error rates when the relay is introduced.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Joana Angjo
Ali E. Pusane
H. Birkan Yilmaz
Ertugrul Basar
Tuna Tugcu

BibTeX reference

    author = {Angjo, Joana and Pusane, Ali E. and Yilmaz, H. Birkan and Basar, Ertugrul and Tugcu, Tuna},
    doi = {10.1016/j.nancom.2022.100404},
    title = {{Optimal relaying in molecular communications}},
    pages = {100404},
    journal = {Elsevier Nano Communication Networks},
    issn = {1878-7789},
    publisher = {Elsevier},
    month = {6},
    volume = {32-33},
    year = {2022},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.