This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Detection Interval for Diffusion Molecular Communication: How Long is Enough?

Xuan Chen, Miaowen Wen, Senior Member, IEEE, Fei Ji, Member, IEEE,
Yu Huang, Yuankun Tang, Andrew W. Eckford, Senior Member, IEEE
X. Chen is with the School of Electronics and Information Engineering, South China University of Technology, Guangzhou 510641, China, and also with the Department of Electrical Engineering and Computer Science, York University, Toronto M3J 1P3, Canada (Email:[email protected]). F. Ji, M. Wen, and Y. Tang are with the School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, China (Email: {eefeiji, eemwwen}@scut.edu.cn, [email protected]). Y. Huang is with the School of Electronics and Communication Engineering, Guangzhou University, Guangzhou 510006, China (Email: [email protected]). A. W. Eckford is with the Department of Electrical Engineering and Computer Science, York University, Toronto M3J 1P3, Canada (Email: [email protected]).
Abstract

Molecular communication has a key role to play in future medical applications, including detecting, analyzing, and addressing infectious disease outbreaks. Overcoming inter-symbol interference (ISI) is one of the key challenges in the design of molecular communication systems. In this paper, we propose to optimize the detection interval to minimize the impact of ISI while ensuring the accurate detection of the transmitted information symbol, which is suitable for the absorbing and passive receivers. For tractability, based on the signal-to-interference difference (SID) and signal-to-interference-and-noise amplitude ratio (SINAR), we propose a modified-SINAR (mSINAR) to measure the bit error rate (BER) performance for the molecular communication system with a variable detection interval. Besides, we derive the optimal detection interval in closed form. Using simulation results, we show that the BER performance of our proposed mSINAR scheme is superior to the competing schemes, and achieves similar performance to optimal intervals found by exhaustive search.

Index Terms:
Molecular communication, ISI, mSINAR, detection interval optimization

I Introduction

On a global scale, the COVID-19 pandemic is threatening the overall population health and economic well-being. Due to its rapid spread, how to offer fast disease detection along with “on-site” results is a major challenge to medical care. In this context, the Internet of Medical Things (IoMT), an extension and specialization of IoT in the medical industry, was proposed to realize remote health diagnosis and monitoring in the time of COVID-19 [1, 2, 3, 4]. In general, the IoMT network is composed of body sensors, local devices, and edge servers, in which the sensor is the basis of the entire network since it enables the collection of various health signals for the subsequent health assessment. Constrained by the volume and bio-compatibility of sensors, nano bio-sensors are considered a promising technology for the construction of IoMT. Besides, researchers also proposed using nano bio-sensors to facilitate various disease diagnoses and treatment, thus forming the Internet of Bio-Nano Things (IoBNT) [5, 6, 7]. At this point, we can regard the IoBNT as a special realization of IoMT in each individual.

To collect all monitored medical data from patients, the connection of sensors located in different tissues is a key issue to be solved for IoBNT or IoMT. In the literature, a series of communication technologies for biological nano-sensors, such as molecular communication (MC), electromagnetic communication, and acoustic communication, has been proposed. Unlike the conventional communication methods, MC is a bio-inspired communication paradigm, and its carrier of information is chemical signals. Accordingly, MC has the following properties: small size, energy efficiency, and excellent bio-compatibility [8]. Based on the above advantages, MC is believed to have the potential to connect larger groups of nano bio-sensors in IoBNT [5, 6, 7]. On the other hand, as an interdisciplinary communication mode, MC is capable of serving the biomedical field, in applications such as targeted drug delivery [9], [10], disease diagnosis [11], [12], and health monitoring [13, 14]. Moreover, during the outbreak of COVID-19 or other pandemics, MC can also be employed as an effective tool to model the spread of infections and diseases via aerosols [15, 16, 17, 18]. Against this background, MC can pave the way for the connection of sensors all over the body in IoMT.

Molecular communication via diffusion (MCvD) is a highly popular MC method that uses the free diffusion of carrier molecules to transfer information at the nanoscale. However, considering the diffusion channel, the inter-symbol interference (ISI) caused by the long delay of molecular diffusion is a great challenge for the MCvD system. The existence of ISI will adversely affect subsequent signal recovery and further lead to error propagation. At present, there are many proposed solutions to overcome ISI, mainly divided into the following three types: modulation-based [19, 20, 21]; equalization-based [22, 23, 24]; and channel-based, i.e., introducing an external factor, such as flow [25] or enzyme [26], into the channel. Generally, these methods come at some increased cost, for example, more types of molecules/receptors [19, 21, 24]; additional computational complexity [22, 23, 24]; additional memory at nano-machines [27]; and specific channel [20, 25, 26]. Notably, the MCvD system requires simple implementation. However, the above prevailing ISI mitigation schemes inevitably increase the system complexity, though they can achieve better performance. Then a question naturally arises whether we can effectively mitigate the impact of ISI by simple yet effective techniques such as sampling.

In the literature, there are already some efforts toward eliminating the ISI on varying the detection interval. Particularly, these methods can be divided into three categories according to their characteristics: the shift-τ\tau method; truncating the symbol duration in advance; and extracting a small portion of the symbol duration. First, the shift-τ\tau method means that the receiver can shift its absorbing/counting interval backward by τ\tau seconds so as to avoid the strong ISI region [28, 29, 30]. The optimal reception delay of the absorbing receiver was approximately derived in [28], thus providing a reliable guide for receiver design. Second, truncating the symbol interval in advance means that the detection process will be terminated ahead of the end of a symbol period, as proposed in [31] for the MCvD system comprised of a transmitter, an absorbing receiver, and an interference source. The authors of [31] found a proper detection interval, which can effectively overcome the interference from unintended transmitters. Third, extracting a portion of the symbol duration means that the detection process will start late and end early. Compared with the previous schemes, this method considers the impact of ISI on the entire signal transmission process, rather than a specific time slot. Therefore, it can eliminate much of the interference caused by the ISI. In [32, 33], via the simulation, Ntouni et al. proved that this method can improve the system performance regardless of whether the flow is considered for the absorbing and passive receivers.

Against the background, not only to overcome the incompleteness of the interference analysis in [28, 29, 30, 31] but also to provide rigorous theoretical analysis for how to achieve the optimal change of the detection interval, we propose to optimize the detection interval from the theoretical perspective in this paper. Different from [32, 33], we will derive the analytic solution of the optimal detection interval, even when the number of transmitted molecules 𝒬\cal Q and the ISI length LL is not fixed. Specifically, the contributions of this paper are summarized as follows:

  • Given that the bit error rate (BER) expression in MCvD systems is generally intractable, we propose a performance metric, namely modified signal-to-interference and noise amplitude ratio (mSINAR), to formulate the objective functions and then quantify the impact of the detection interval on BER performance. Compared with the existing performance metrics investigated in [34], mSIANR can be a good alternative to measure the BER performance for the MCvD system with a variable detection interval.

  • Based on the proposed mSIANR, we derive a theoretical detection interval for the absorbing and passive receivers. Constrained by the high computational complexity arising from the summation of numerous ISI signals and noise, we split the objective function generated from mSINAR as two sub-problems to deduce the optimal detection interval for all considered 𝒬\cal Q and LL. Besides, we provide valuable insight into the convergence of this interval with respect to 𝒬\cal Q.

  • We verify the accuracy of our analysis and compare the BER performance of the proposed mSINAR scheme with that of the existing schemes, such as the shift-τ\tau method proposed in [28], via computer simulations. Simulation results show that the BER curve with mSINAR significantly outperforms that of the existing schemes when the ISI length is greater than 1 and asymptotically approaches the best BER curve obtained from the exhaustive search.

The remainder of this paper is organized as follows. In Section II, we review the fundamental of a typical MCvD system and introduce an optimization problem related to the detection interval. Section III details the optimization analysis and derives the theoretical detection interval for the absorbing and passive receivers. The performance of the proposed mSINAR is evaluated in Section IV, and finally, the conclusion is drawn in Section V.

Notation: (,){\cal B}\left({\cdot\,,\cdot}\right), 𝒩(,){\cal N}\left({\cdot\,,\cdot}\right), and 𝒫(){\cal P}\left(\cdot\right) denote the Bernoulli distribution, Gaussian distribution, and Poisson distribution, respectively. Q()Q(\cdot) and erf(){\rm{erf}}\left(\cdot\right) are the Gaussian QQ-function and the error function, respectively.

II System Model and Problem Statement

II-A System Model

In this paper, we consider a typical MCvD system consisting of a point transmitter and a spherical receiver, which can be a fully absorbing or passive receiver. As can be seen from Fig. 1, the transmitter is placed in an unbounded 3-dimensional (3D) environment, in which the distance from the transmitter to the closest point of the receiver’s surface is dd and the receiver’s radius is rr. For implementation, we assume that a transmitter can store (or generate) a certain number of information molecules with the diffusion coefficient DD, and the corresponding receiver can recognize and distinguish these molecules. It is also assumed that the ON/OFF keying (OOK) modulation is applied to map the transmitted information to channel inputs. Specifically, the transmitter releases 𝒬\cal Q molecules to convey symbol “1”, while releasing no molecules to convey symbol “0”. Moreover, perfect time synchronization is assumed to ensure the detection interval scheduling. For clarity, in the following, we review the preliminary conceptual framework for MCvD systems, where the fully absorbing receiver and passive receiver are considered, respectively.

Refer to caption
Figure 1: Schematic diagram of the MCvD system.

II-A1 Fundamentals of Absorbing Receiver

Following Fick’s law of diffusion, the probability of a molecule, released from a point transmitter at t=0t=0, reaching a spherical receiver at time tt is

h(t)=rd+rd4πDt3exp(d24Dt).\displaystyle h(t)=\frac{r}{d+r}\frac{d}{\sqrt{4\pi Dt^{3}}}\exp\left(-\frac{d^{2}}{4Dt}\right). (1)

Then we can express the expected fraction of molecules, absorbed by the receiver in [t1,t2][t_{1},t_{2}] with t1,t2[0,Ts]t_{1},t_{2}\in[0,T_{s}] and t2>t1t_{2}>t_{1}, as

Fab(t1,t2)=rd+r[erf(d4Dt1)erf(d4Dt2)],\displaystyle F_{\mathrm{ab}}\left(t_{1},t_{2}\right)=\frac{r}{d+r}\left[\operatorname{erf}\left(\frac{d}{\sqrt{4Dt_{1}}}\right)-\operatorname{erf}\left(\frac{d}{\sqrt{4Dt_{2}}}\right)\right], (2)

where TsT_{s} denotes the symbol duration. Let us define xkx_{k} and YkY_{k} as the kk-th transmitted bit and the number of received molecules corresponding to the kk-th transmission, respectively. Then we have

Yki=0L(𝒬xki,Fab(t1+iTs,t2+iTs)),\displaystyle Y_{k}\sim\sum\limits_{i=0}^{L}{\mathcal{B}\left({{\cal Q}{x_{k-i}},{F_{ab}}\left({{t_{1}}+iT_{s},{t_{2}}+iT_{s}}\right)}\right)}, (3)

where LL is the ISI length. Following [31], we use the Gaussian distribution rather than the Poisson distribution to approximate (3) as

Yki=0L𝒬xki𝒩(Fabi,Fabi(1Fabi)),\displaystyle Y_{k}\sim\sum\limits_{i=0}^{L}{\cal Q}{x_{k-i}}\mathcal{N}\left({F_{ab}^{i},F_{ab}^{i}\left({1-F_{ab}^{i}}\right)}\right), (4)

where Fabi=Fab(t1+iTs,t2+iTs)F_{ab}^{i}={F_{ab}}\left({{t_{1}}+iT_{s},{t_{2}}+iT_{s}}\right). Moreover, we assume that the energy detection is used for the absorbing receiver.

From the above, we can write the average bit error probability as [32]

Pe=12+12LxLL(Q(ξμ0(xL)σ0(xL))Q(ξμ1(xL)σ1(xL))),\displaystyle{P_{e}}=\frac{1}{2}+\frac{1}{{{2^{L}}}}\sum\limits_{{\emph{{x}}_{L}}\in{{\cal M}^{L}}}{\left({Q\left({\frac{{\xi-{\mu_{0}}\left({{\emph{{x}}_{L}}}\right)}}{{{\sigma_{0}}\left({{\emph{{x}}_{L}}}\right)}}}\right)-Q\left({\frac{{\xi-{\mu_{1}}\left({{\emph{{x}}_{L}}}\right)}}{{{\sigma_{1}}\left({{\emph{{x}}_{L}}}\right)}}}\right)}\right)}, (5)

where ξ{\xi} is the detection threshold; μxk(xL){\mu_{x_{k}}}\left({{\emph{{x}}_{L}}}\right) and σxk2(xL)\sigma_{x_{k}}^{2}\left({{\emph{{x}}_{L}}}\right) are the expectation and variance of YkY_{k} when xk{0,1}{x_{k}}\in\{0,1\}, expressed as

μxk(xL)=i=0L𝒬xkiFabi,σxk2(xL)=i=0L𝒬xkiFabi(1Fabi),\displaystyle{\mu_{{x_{k}}}}\left({{\emph{{x}}_{L}}}\right)=\sum\limits_{i=0}^{L}{{\cal Q}{x_{k-i}}F_{ab}^{i}},~{}\sigma_{{x_{k}}}^{2}\left({{\emph{{x}}_{L}}}\right)=\sum\limits_{i=0}^{L}{{\cal Q}{x_{k-i}}F_{ab}^{i}\left({1-F_{ab}^{i}}\right)}, (6)

and xL{\emph{{x}}_{L}} is the ISI sequence with length LL. For the kk-th transmitted bit, xL={xkL,,xk2,xk1}{\emph{{x}}_{L}}=\left\{{{x_{k-L}},\cdots,{x_{k-2}},{x_{k-1}}}\right\} and xki{x_{k-i}}\in{\cal M} with i{1,,L}i\in\left\{{1,\cdots,L}\right\} and {0,1}{\cal M}\in\{0,1\}. For clarity, in the sequel, we will ignore (xL)\left({{\emph{{x}}_{L}}}\right) for μxk(xL){\mu_{{x_{k}}}}\left({{\emph{{x}}_{L}}}\right) and σxk2(xL)\sigma_{{x_{k}}}^{2}\left({{\emph{{x}}_{L}}}\right). Besides, in (5), we also assume that the probabilities of transmitting bit “0” and bit “1” are 1/2{1\mathord{\left/{\vphantom{12}}\right.\kern-1.2pt}2}.

II-A2 Fundamentals of Passive Receiver

Similar to the absorbing receiver, we can define when rr+d<0.15\frac{r}{r+d}<0.15, the probability of observing a given molecule, emitted from the point transmitter at t=0t=0, inside VV at time tt as [35]

p(t)=V(4πDt)3/2exp((d+r)24Dt),\displaystyle p\left(t\right)=\frac{V}{{{{\left({4\pi Dt}\right)}^{3/2}}}}\exp\left({-\frac{{{{\left({d+r}\right)}^{2}}}}{{4Dt}}}\right), (7)

where VV is the volume of the passive receiver. First, we assume that NN samples are taken by the receiver at a symbol duration given by f(n)[0,Ts]f(n)\in\left[{0,{T_{s}}}\right] where n=0,1,2,,Nn=0,1,2,\cdots,N, and that they are equally summed up before the single threshold detection. The number of received molecules corresponding to the nn-th sample taken within the kk-th symbol duration can be expressed as

Yn,k𝒫(Λn,k=i=0L𝒬xkip(f(n)+iTs)),\displaystyle Y_{n,k}\sim{\cal P}\left({{\Lambda_{n,k}}=\sum\limits_{i=0}^{L}{{\cal Q}}{{x_{k-i}}p\left({f\left(n\right)+i{T_{s}}}\right)}}\right), (8)

where xkx_{k} is the kk-th transmitted bit and Λn,k{\Lambda_{n,k}} is defined as the average of the number of received molecules in this sample. Following most of the research works that have been conducted so far, we also sample the signals at equal intervals, i.e., f(n)=ntsf(n)=nt_{s} and ts=Ts/Nt_{s}=T_{s}/N where n=0,1,2,,Nn=0,1,2,\cdots,N. Moreover, for clarity, we define pn,i=p(f(n)+iTs)p_{n,i}=p\left({f\left(n\right)+i{T_{s}}}\right). Considering the fact that if the Poisson parameter Λn,k{\Lambda_{n,k}} is sufficiently large, e.g., Λn,k>20{\Lambda_{n,k}}>20, we use the Gaussian distribution to approximate (8) as

Yn,k𝒩(Λn,k,Λn,k).\displaystyle Y_{n,k}\sim{\cal N}\left({{\Lambda_{n,k}},{\Lambda_{n,k}}}\right). (9)

At this point, the average error bit probability for the passive receiver can be expressed as (5), where μxk\mu_{x_{k}} and σxk\sigma_{x_{k}} are replaced by n=n1n2μxk(n)\sum\limits_{n=n_{1}}^{n_{2}}{{\mu_{x_{k}}}\left(n\right)} and n=n1n2μxk(n){\sqrt{\sum\limits_{n=n_{1}}^{n_{2}}{{\mu_{x_{k}}}\left(n\right)}}} for xk{0,1}{x_{k}}\in\left\{{0,1}\right\}; n1n_{1} and n2n_{2} denote the first sample and the last sample, respectively, with 0n1,n2N{0\leq{n_{1}},{n_{2}}\leq N}. Further, μxk(n){\mu_{x_{k}}}\left(n\right) is the expectation of Yn,kY_{n,k}. Therefore, we have

μxk(n)=i=0L𝒬xkipn,i.\displaystyle{\mu_{{x_{k}}}}\left(n\right)=\sum\limits_{i=0}^{L}{{\cal Q}{x_{k-i}}p_{n,i}}. (10)

II-B Problem Statement

In most of the research works related to the MCvD system, it is generally assumed that the detection interval is equal to the transmission symbol duration. However, some researchers have noted that the variable detection interval could have a great potential to improve the BER performance, especially when the ISI is relatively serious. Based on this fact, we propose to determine the optimal detection interval from the theoretical perspective, mathematically expressed as

[t1,t2]\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}} =argmin0t1,t2TsPe\displaystyle=\mathop{\arg\min}\limits_{0\leq{t_{1}},{t_{2}}\leq T_{s}}{P_{e}}
=argmin0t1,t2TsxLL[Q(ξμ0σ0)Q(ξμ1σ1)],\displaystyle=\mathop{\arg\min}\limits_{0\leq{t_{1}},{t_{2}}\leq T_{s}}\sum_{{\emph{{x}}_{L}}\in{{\cal M}^{L}}}\left[{Q\left({\frac{{\xi-{\mu_{0}}}}{{{\sigma_{0}}}}}\right)-Q\left({\frac{{\xi-{\mu_{1}}}}{{{\sigma_{1}}}}}\right)}\right], (11)

where the absorbing receiver is considered. The above function is also suitable for the passive receiver, in which [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} is replaced by [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} with 0n1,n2N0\leq{n_{1}},{n_{2}}\leq N. From (II-B), it is difficult to directly obtain the optimal [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]} except with the aid of the exhaustive search. Thus, it is essential to determine how to obtain an exact or approximate [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}. In the literature, using the different performance metrics as alternatives of BER has been proposed in the MC field [34]. For clarity, in the following, we will take the absorbing receiver as an example to review these performance metrics:

1) Signal-to-interference ratio (SIR), which is the ratio of the amount of desired signal molecules to interference molecules:

SIR=𝒬Fab0k=1L𝒬Fabk.\displaystyle\textrm{{{SIR}}}=\frac{{{\cal Q}F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{\cal Q}F_{ab}^{k}}}. (12)

2) Signal-to-interference difference (SID), which is the difference between the number of desired signal molecules and interference molecules:

SID=𝒬Fab0k=1L𝒬Fabk.\displaystyle\textrm{{{SID}}}={\cal Q}F_{ab}^{0}-\sum\limits_{k=1}^{L}{\cal Q}F_{ab}^{k}. (13)

3) Signal-to-interference and noise amplitude ratio (SINAR), which means in addition to the interference sources, the noise source is also included in the calculation, having a form of

SINAR=𝒬Fab0k=1L𝒬Fabk+k=0L𝒬Fabk(1Fabk).\displaystyle\textrm{{SINAR}}=\frac{{{\cal Q}F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{\cal Q}F_{ab}^{k}+\sum\limits_{k=0}^{L}{\sqrt{{\cal Q}F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}}}. (14)

Notice that the strongest ISI has been considered for all performance metrics, i.e., the ISI signals are assumed to be as “111L\underbrace{1\cdots 1\cdots 1}_{L}”. Moreover, we can see that only SINAR involves the impact from the noise (i.e., the variation of signals). Therefore, SINAR is more realistic than the other metrics. Besides, SIR can be regarded as a limit of SINAR, expressed as follows

lim𝒬SINAR\displaystyle\mathop{\lim}\limits_{{\cal Q}\to\infty}{\mathop{\textrm{{SINAR}}}\nolimits} =lim𝒬Fab0k=1LFabk+k=0LFabk(1Fabk)𝒬\displaystyle=\mathop{\lim}\limits_{{\cal Q}\to\infty}\frac{{F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{F_{ab}^{k}}+\sum\limits_{k=0}^{L}{\sqrt{\frac{{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}{\cal Q}}}}}
=SIR.\displaystyle={\textrm{{SIR}}}. (15)

Specially, in cases where the signal is not strong, but the unexpected ISI signal is very weak (i.e., nearly zero), SIR has extremely high values, which may cause an inaccurate analysis. As for SID, it is formulated by the difference between the numerator and denominator of SIR such that it can avoid the above extreme case. Therefore, in [34], SID is considered to be a more reliable performance metric than SIR. Besides, according to the previous research, maximizing SINAR and SID can yield close-to-optimal results in terms of minimizing BER.

In view of the foregoing, it seems feasible to use SINAR and SID to calculate the approximate [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}. However, it is worth mentioning that this is the first time to use variable [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]} with t2t1Ts{t_{2}}-{t_{1}}\neq{T_{s}} in these indicators, so their applicability is still an open issue. First, we notice that in SINAR, when Fabk{F_{ab}^{k}} with k=0,1,Lk=0,1,\cdots L varies with the change of the candidate [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}, the peak value of SINAR is always nearby tmaxt_{\max} or saying that [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} eventually converges near tmaxt_{\max}, as 𝒬\cal Q increases, where tmax{t_{\max}} represents the peak time for the molecule concentration when an impulse of molecules is emitted at t=0t=0, formulated as tmax=(d+r)26Dt_{\max}=\frac{\left(d+r\right)^{2}}{6D} for the absorbing receiver. This phenomenon can be explained as follows: since the influence of noise is inversely proportional to 𝒬\cal Q, all interference (i.e., the denominator of SINAR) can be approximately regarded as linearly related to the desired signal, when 𝒬\cal Q is large enough; while in this case, the peak value of the ratio between the expected signals and the unexpected part should be near tmaxt_{\max}, due to the property of the diffusion channel. Yet, from the passive receiver, we know that the threshold detection with the multi-sampling is generally superior to that of the single sampling, which suggests that SINAR may not provide an accurate quantification for BER with a variable [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}. Moreover, as for SID, this metric assumes the influence of noise as 0, resulting in the deduced [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} being independent of 𝒬\cal Q. Clearly, this assumption is unreasonable, since only the noise with an infinite 𝒬\cal Q may go to zero.

Based on the above metrics, we propose a modified performance metric, namely modified-SINAR (mSINAR), which can be mathematically defined as

mSINAR=12Fab0k=1L12Fabk+k=0LFabk(1Fabk)2𝒬.\displaystyle{\textrm{mSINAR}}=\frac{{\frac{1}{2}F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{\frac{1}{2}}F_{ab}^{k}+\sum\limits_{k=0}^{L}{\sqrt{\frac{{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}{{2{\cal Q}}}}}}}. (16)

First, we can see that mSINAR has a similar expression with SINAR except with the introduction of the transmission probability, where it is assumed that the probabilities of transmitting bit “0” and bit “1” are equivalent. Moreover, given the fact that [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from SIANR is gradually closer to tmaxt_{\max} with an increasing 𝒬\cal Q, we need to define a valid range for mSINAR. It is clear from (16) that the impact from the noise will play a dominant role when 𝒬\cal Q is relatively small, suggesting that the initial value of mSINAR infinitely approaches 0 with an infinitesimal 𝒬\cal Q; while as 𝒬\cal Q goes larger, the expected signal progressively shows its advantage in mSINAR, causing the increase of mSINAR until it reaches or exceeds 1. Therefore, we have 0<mSINAR10<{\textrm{mSINAR}}\leq{{1}}. Furthermore, we regular the usage strategy of mSINAR for the derivation of [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}: when mSINAR is located in the valid range, we use mSINAR to derive the optimal detection interval; while as for mSINAR>1{\text{mSINAR}}>1, we continue to employ the [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from this metric with mSINAR=1\textrm{mSINAR}=1. In the sequel, we will employ the proposed mSINAR to simplify the objective function in (II-B) and then optimize the detection interval.

Moreover, we also modify the SID to simplify the derivation of the optimal [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]} in the next section. Specifically, we convert mSINAR to modified-SID (mSID), which is defined as the difference between the number of desired molecules and undesired molecules contributing by the ISI signal and noise, mathematically expressed as

mSID=Fab0k=1LFabk2𝒬k=0LFabk(1Fabk).\displaystyle{\textrm{mSID}}=F_{ab}^{0}-\sum\limits_{k=1}^{L}{F_{ab}^{k}}-\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}. (17)

Compared with the original SID, mSID further includes the impact from the noise.

III Optimization Analysis

In this section, we use the above mSINAR-based approximation methods to solve the optimal detection interval, where a fully absorbing receiver and a passive receiver are both considered.

III-A Detection Interval Optimization for Absorbing Receiver

First, we discuss how to obtain [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} for the absorbing receiver when mSINAR is used. Based on the usage strategy of mSINAR described previously, the objective function in (II-B) can be rewritten as

[t1,t2]\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}} =argmin0t1,t2TsPe\displaystyle=\mathop{\arg\min}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}{P_{e}}
{argmax0t1,t2TsFab0k=1LFabk+k=0L2Fabk(1Fabk)𝒬,if0<𝒬<𝒬^argmax0t1,t2TsFab0k=1LFabk+k=0L2Fabk(1Fabk)𝒬^,if𝒬𝒬^.\displaystyle\approx\left\{\begin{array}[]{l}\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\frac{{F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{F_{ab}^{k}}+\sum\limits_{k=0}^{L}{\sqrt{\frac{{2F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}{{\cal Q}}}}}},~{}\textrm{if}~{}0<{\cal Q}<\hat{\cal Q}\\ \mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\frac{{F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{F_{ab}^{k}}+\sum\limits_{k=0}^{L}{\sqrt{\frac{{2F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}{{\hat{\cal Q}}}}}}},~{}\textrm{if}~{}{\cal Q}\geq\hat{\cal Q}\end{array}\right.. (20)

Here, 𝒬^=2(k=0LFabk(1Fabk)Fab0k=1LFabk)2\hat{\cal Q}=\left\lceil{2{{\left({\frac{{\sum\limits_{k=0}^{L}{\sqrt{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}}}{{F_{ab}^{0}-\sum\limits_{k=1}^{L}{F_{ab}^{k}}}}}\right)}^{2}}}\right\rceil , calculated from (16) when assuming mSINAR = 1, where [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} is also assumed to be used. According to the valid range of mSINAR, we split (III-A) into the following two sub-problems to derive [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}, respectively.

III-A1 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}

First, provided that FabkF_{ab}^{k} is a decreasing function with respect to kk and the value of FabkF_{ab}^{k} is relatively small, we approximate (1Fabk)\left({1-F_{ab}^{k}}\right) as 1. Thus, (III-A) can be re-written as

[t1,t2]argmax0t1,t2TsFab0k=1LFabk+2𝒬k=0LFabk,0<𝒬<𝒬^.\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}\approx\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\frac{{F_{ab}^{0}}}{{\sum\limits_{k=1}^{L}{F_{ab}^{k}}+\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{F_{ab}^{k}}}}},~{}0<{\cal Q}<\hat{\cal Q}. (21)

Considering that (21) is related to t1t_{1}^{*} and t2t_{2}^{*}, we can resort to the second partial derivative test to find a maximum value of mSINAR. Taking the first derivative of (21) with respect to t1t_{1} and t2t_{2}, we can obtain

mSINARti=\displaystyle\frac{{\partial\textrm{mSINAR}}}{{\partial{t_{i}}}}= (1)i[h(ti){k=1Lt1t2h(kTs+t)dt+k=0L2𝒬t1t2h(kTs+t)𝑑t}\displaystyle{\left({-1}\right)^{i}}\left[h\left({{t_{i}}}\right){\left\{{\sum\limits_{k=1}^{L}{\int_{{t_{1}}}^{{t_{2}}}{h\left({k{T_{s}}+t}\right)dt}+}\sum\limits_{k=0}^{L}{\sqrt{\frac{2}{\cal Q}}\sqrt{\int_{{t_{1}}}^{{t_{2}}}{h\left({k{T_{s}}+t}\right)dt}}}}\right\}}\right.
t1t2h(t)dt{k=1Lh(kTs+ti)+k=0Lh(kTs+ti)2𝒬t1t2h(kTs+t)𝑑t}]\displaystyle\left.-\int_{{t_{1}}}^{{t_{2}}}{h\left(t\right)dt}{\left\{{\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+{t_{i}}}\right)}+\sum\limits_{k=0}^{L}{\frac{{h\left({k{T_{s}}+{t_{i}}}\right)}}{{\sqrt{2{\cal Q}\int_{{t_{1}}}^{{t_{2}}}{h\left({k{T_{s}}+t}\right)dt}}}}}}\right\}}\right]
÷(k=1Lt1t2h(kTs+t)dt+2𝒬k=0Lt1t2h(kTs+t)𝑑t)2,i=1,2.\displaystyle\div{\left({\sum\limits_{k=1}^{L}{\int_{{t_{1}}}^{{t_{2}}}{h\left({k{T_{s}}+t}\right)dt}}+\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{\int_{{t_{1}}}^{{t_{2}}}{h\left({k{T_{s}}+t}\right)dt}}}}\right)^{2}},~{}i=1,2. (22)

From the above equation, we find that it is almost unavailable to solve the [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} by making mSINARti=0\frac{{\partial\textrm{mSINAR}}}{{\partial{t_{i}}}}=0. Therefore, we decide to seek an alternative optimization objective function for (21). First, it is worth noting that compared with t2t_{2}^{*}, t1t_{1}^{*} is almost slightly affected by the noise, due to t1[0,tmax]t_{1}^{*}\in\left[{0,{t_{\max}}}\right] and tmaxTs{t_{\max}}\ll T_{s}. Based on this assumption, we decompose the joint optimization problem of [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} as two independent problems. For t1t_{1}^{*}, we resort to SID to solve it when assuming t2=Tst_{2}^{*}=T_{s}, where the impact from the noise has been ignored. At this point, we have the following problem formulation

t1\displaystyle t_{1}^{*} =argminPe\displaystyle=\arg\min{P_{e}}
argmax0t1tmaxt1Ts[h(t)k=1Lh(kTs+t)]𝑑t.\displaystyle\approx\mathop{\arg\max}\limits_{0\leq{t_{1}}\leq{t_{\max}}}\int_{{t_{1}}}^{T_{s}}{\left[{h\left(t\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}. (23)

As for t2t_{2}^{*}, we can re-write (21) as

t2argmaxtmax<t2Tst1t2h(t)𝑑tf(t2),\displaystyle t_{2}^{*}\approx\mathop{\arg\max}\limits_{{t_{\max}}<{t_{2}}\leq{T_{s}}}\frac{{\int_{t_{1}^{*}}^{{t_{2}}}{h\left(t\right)dt}}}{{f\left({{t_{2}}}\right)}}, (24)

where for clarity, let f(t2)=k=1Lt1t2h(kTs+t)𝑑t+2𝒬k=0Lt1t2h(kTs+t)𝑑tf\left({{t_{2}}}\right)=\sum\limits_{k=1}^{L}{\int_{t_{1}^{*}}^{{t_{2}}}{h\left({k{T_{s}}+{t}}\right)dt}}+\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{\int_{t_{1}^{*}}^{{t_{2}}}{h\left({k{T_{s}}+{t}}\right)dt}}}. However, after taking the first and second derivative of t1t2h(t)𝑑tf(t2)\frac{{\int_{t_{1}^{*}}^{{t_{2}}}{h\left(t\right)dt}}}{{f\left({{t_{2}}}\right)}}, we find that it is highly involved to directly determine the sign of the second derivative of t1t2h(t)𝑑tf(t2)\frac{{\int_{t_{1}^{*}}^{{t_{2}}}{h\left(t\right)dt}}}{{f\left({{t_{2}}}\right)}}, suggesting that we cannot resort to the second partial derivative test to find a t2t_{2}^{*} for (21). Hence, we decide to obtain a close-to-optimal t2{t_{2}} with a closed-form expression by using the similar method in (III-A1), i.e., assuming that there is no impact from the noise. Here, combining (III-A1), we can re-write (21) with 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} as

[t1,t2]\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}} =argminPe\displaystyle=\arg\min{P_{e}}
argmax0t1,t2Tst1t2[h(t)k=1Lh(kTs+t)]𝑑t.\displaystyle\approx\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\int_{{t_{1}}}^{{t_{2}}}{\left[{h\left(t\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}. (25)

In (III-A1), we find that h(t)h\left(t\right) is a function that rises sharply and falls slowly, while k=1Lh(kTs+t)\sum\limits_{k=1}^{L}{h\left({kT_{s}+t}\right)} is a decreasing function. This means that (III-A1) is equivalent to collecting all of intervals satisfying h(t)k=1Lh(kTs+t)0h{\left(t\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\geq 0, and we have

h(ti)k=1Lh(kTs+ti)=0,i=1,2.\displaystyle h{\left(t_{i}^{*}\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t_{i}^{*}}\right)}}=0,i=1,2. (26)

However, note that (III-A1) and (26) are valid when there is always a [t1,t2]\left[{{t_{1}},{t_{2}}}\right] to satisfy

t1t2[h(t)k=1Lh(kTs+t)]𝑑t>0,\displaystyle\int_{{t_{1}}}^{{t_{2}}}{\left[{h\left(t\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}>0,

since when the above condition is false, the monotonicity of h(t)h\left(t\right) and k=1Lh(kTs+t)\sum\limits_{k=1}^{L}{h\left({kT_{s}+t}\right)} indicates that the solution of (III-A1) is either t1=t2=tmaxt_{1}^{*}=t_{2}^{*}={t_{\max}} or no solution. Furthermore, we can see that it is still relatively tough to directly solve (26), due to the summation caused by LL ISI signals. Therefore, according to different LL, we decompose (26) as two cases, i.e., L=1L=1 and L>1L>1, to calculate the approximate [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}, respectively. Besides, it is clear from (26) that [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} solved by SID is independent of 𝒬\cal Q, since the impact of noise has been neglected in SID. For clarity, the derived [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} for all possible LL is described below.

Proposition 1: Assuming that the approximation for (26) with L=1L=1 is exact, the solution of (26) with L=1L=1 and 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} can be solved as,

[t1,t2]=[28m2Ts120Ts74m2,Ts],\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}=\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-74{m^{2}}}},{T_{s}}}\right], (27)

where m=d4Dm=\frac{d}{{\sqrt{4D}}}.

Proof: See Appendix A.

Proposition 2: Assuming that the approximation for (26) with L>1L>1 is exact, the solution of (26) with L>1L>1 and 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} can be expressed as

[t1,t2]={[28m2Ts120Ts28Tsln74m2,Ts],ifk=1L1(1+k)3exp(k(1+k)m2Ts)1{[28m2Ts120Ts28Tsln74m2,3+(s13+s23)3Ts],ifΔ1<0[28m2Ts120Ts28Tsln74m2,γ+Δ26ln𝒱Ts],ifΔ10,Δ20,[28m2Ts120Ts28Tsln74m2,γ6ln𝒱Ts],ifΔ10,Δ2<0others\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}=\left\{{\begin{array}[]{*{20}{c}}{\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}-74{m^{2}}}},{T_{s}}}\right],~{}{\rm{if}}~{}\sum\limits_{k=1}^{L}{\frac{1}{{\sqrt{{{\left({1+k}\right)}^{3}}}}}}\exp\left({\frac{k}{{\left({1+k}\right)}}\frac{{{m^{2}}}}{{{T_{s}}}}}\right)\leq 1}\\ \vspace{-0.1cm}\hfil\\ {\left\{\begin{array}[]{l}\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}-74{m^{2}}}},\frac{{-3+\left({\sqrt[3]{{{s_{1}}}}+\sqrt[3]{{{s_{2}}}}}\right)}}{3}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}<0\\ \vspace{-0.5cm}\\ \left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}-74{m^{2}}}},\frac{{-\gamma+\sqrt{{\Delta_{2}}}}}{6{\ln{\mathcal{V}}}}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}\geq 0,{\Delta_{2}}\geq 0,\\ \vspace{-0.5cm}\\ \left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}-74{m^{2}}}},-\frac{{\gamma}}{6{\ln{\mathcal{V}}}}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}\geq 0,{\Delta_{2}}<0\\ \end{array}\right.}~{}{\rm others}\\ \vspace{-0.5cm}\hfil\\ \end{array}}\right. (37)

where the above symbols, such as \mathcal{I} and 𝒱\mathcal{V}, have defined in Appendix B.

Proof: See Appendix B.

Note that the results in Propositions 1&\&2 give an approximate but good solution for the optimal [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}, which has been validated via the numerical simulation in Section IV-B.

III-A2 𝒬𝒬^{\cal Q}\geq{\hat{\cal Q}}

In this subsection, we will derive an optimal [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]} when 𝒬𝒬^{\cal Q}\geq{\hat{\cal Q}}. However, how to determine the exact value of 𝒬^{\hat{\cal Q}} is a key problem. In the previous subsection, [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}^{*} with 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} has been obtained and it is independent of 𝒬\cal Q. Hence, we assume that [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}^{*} is also fit for 𝒬^{\hat{\cal Q}}, and then 𝒬^{\hat{\cal Q}} can be determined directly. Next, we focus on how to calculate [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}^{*}. Constrained by the computational complexity of (III-A), we convert mSINAR to mSID defined earlier to simplify the optimization procedure. When 𝒬𝒬^{\cal Q}\geq{\hat{\cal Q}}, (III-A) can be transformed into

[t1,t2]\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}} argmax0t1,t2TsFab0k=1LFabk2𝒬k=0LFabk\displaystyle\approx\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}F_{ab}^{0}-\sum\limits_{k=1}^{L}{F_{ab}^{k}}-\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{{{F_{ab}^{k}}}{}}}
=argmax0t1,t2Tst1t2[h(t)k=1Lh(kTs+t)]𝑑t2𝒬k=0LFabk(1Fabk).\displaystyle=\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\int_{{t_{1}}}^{{t_{2}}}{\left[{h\left(t\right)-\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}-\sqrt{\frac{2}{\cal Q}}\sum\limits_{k=0}^{L}{\sqrt{{{F_{ab}^{k}}\left({1-F_{ab}^{k}}\right)}{}}}. (38)

It is considered that the expected signal plays a leading role in (III-A2), since the true maximum of mSINAR is greater than 1 for 𝒬𝒬^{\cal Q}\geq{\hat{\cal Q}}. Followed by the above fact, we assume that mSID can have a certain tolerance threshold for the change of the standard variance of the noise. Therefore, for Fabk(1Fabk){\sqrt{F_{ab}^{k}}}\left({1-F_{ab}^{k}}\right), we have

Fab0(1Fab0)α1Fab0,Fabk(1Fabk)α2Fabk,\displaystyle\sqrt{F_{ab}^{0}\left({1-F_{ab}^{0}}\right)}\approx{\alpha_{1}}F_{ab}^{0},~{}~{}\sqrt{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}\approx{\alpha_{2}}F_{ab}^{k}, (39)

To ensure that the above approximations are feasible for any possible [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}, we define α1{\alpha_{1}} and α2{\alpha_{2}} as the minimum of all possible Fab0(1Fab0)Fab0\frac{{\sqrt{F_{ab}^{0}\left({1-F_{ab}^{0}}\right)}}}{{F_{ab}^{0}}} and Fabk(1Fabk)Fabk\frac{{\sqrt{F_{ab}^{k}\left({1-F_{ab}^{k}}\right)}}}{{F_{ab}^{k}}} with k=1,Lk=1,\cdots L, respectively, i.e.,

α1=10Tsh(t)𝑑t0Tsh(t)𝑑t,α2=10Tsh(t+Ts)𝑑t0Tsh(t+Ts)𝑑t.\displaystyle{\alpha_{1}}=\sqrt{\frac{{1-\int_{0}^{{T_{s}}}{h\left(t\right)}dt}}{{\int_{0}^{{T_{s}}}{h\left(t\right)}dt}}},~{}{\alpha_{2}}=\sqrt{\frac{{1-\int_{0}^{{T_{s}}}{h\left({t+{T_{s}}}\right)}dt}}{{\int_{0}^{{T_{s}}}{h\left({t+{T_{s}}}\right)}dt}}}. (40)

At this point, (III-A2) can be simplified as

[t1,t2]argmax0t1,t2Tst1t2[h(t)𝒢(𝒬)k=1Lh(kTs+t)]𝑑t,\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}\approx\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\int_{{t_{1}}}^{{t_{2}}}{\left[{h\left(t\right)-{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}, (41)

where 𝒢(𝒬)=𝒬+2α2𝒬2α1{\cal G}\left({\cal Q}\right)={\frac{{\sqrt{\cal Q}+\sqrt{2}{\alpha_{2}}}}{{\sqrt{\cal Q}-\sqrt{2}{\alpha_{1}}}}}. As can be observed from (III-A), we have 𝒬=𝒬^{\cal Q}={\hat{\cal Q}} when calculating [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} for 𝒬𝒬^{\cal Q}\geq{\hat{\cal Q}}. Certainly, [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]}^{*} with 𝒬=𝒬^{\cal Q}={\hat{\cal Q}} is suitable for all possible 𝒬\cal Q in the range of [𝒬^,)\left[{\hat{\cal Q},\infty}\right). However, if 𝒬=𝒬^{\cal Q}={\hat{\cal Q}} is true for mSID, (41) can be rewritten as

argmax0t1,t2Tst1t2[h(t)𝒢(𝒬^)k=1Lh(kTs+t)]𝑑t=0.\displaystyle\mathop{\arg\max}\limits_{0\leq{t_{1}},{t_{2}}\leq{T_{s}}}\int_{{t_{1}}}^{{t_{2}}}{\left[{h\left(t\right)-{\cal G}\left({\cal{\hat{Q}}}\right)\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\right]dt}=0. (42)

Here, for the same reason clarified earlier, the solution of (42) is either t1=t2=tmaxt_{1}^{*}=t_{2}^{*}={t_{\max}} or no solution. To construct a function where [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} can be approximately solved from (41), we decide to slightly enlarge the maximum of mSINAR to obtain a new 𝒬{{\cal Q}} and then make (41) greater than 0. Therefore, we define 𝒬=𝒢(𝒬^)𝒬^{\cal Q}={\cal G}\left({\cal{\hat{Q}}}\right){\hat{\cal Q}}. Here, (41) is equivalent to collecting all of intervals satisfying h(t)𝒢(𝒬)k=1Lh(kTs+t)0h{\left(t\right)-{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}\geq 0, and we have

h(t)𝒢(𝒬)k=1Lh(kTs+t)=0,i=1,2.\displaystyle h{\left(t\right)-{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{h\left({k{T_{s}}+t}\right)}}=0,i=1,2. (43)

For clarity, the [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from (43) has been described in the following proposition.

Proposition 3: Assuming that the approximation for (43) for all considered LL is exact, the solution of (43) with L>1L>1 and 𝒬𝒬^\cal Q\geq{\hat{\cal Q}} can be written as

[t1,t2]=[28m2Ts120Ts28Tsln𝒢(𝒬)74m2,Ts].\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}=\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal G}\left({\cal Q}\right)-74{m^{2}}}},{T_{s}}}\right]. (44)

As for L>1L>1 and 𝒬𝒬^\cal Q\geq{\hat{\cal Q}}, the solution of (43) can be expressed as

[t1,t2]={[28m2Ts120Ts28Tsln𝒢(𝒬)74m2,Ts],if𝒢(𝒬)k=1L1(1+k)3exp(k(1+k)m2Ts)1{[28m2Ts120Ts28Tsln𝒢(𝒬)74m2,3+(s13+s23)3Ts],ifΔ1<0[28m2Ts120Ts28Tsln𝒢(𝒬)74m2,γ+Δ26ln𝒱𝒢(𝒬)Ts],ifΔ10,Δ20,[28m2Ts120Ts28Tsln𝒢(𝒬)74m2,γ6ln𝒱𝒢(𝒬)Ts],ifΔ10,Δ2<0others\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}=\left\{{\begin{array}[]{*{20}{c}}{\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}{\cal G}\left({\cal Q}\right)-74{m^{2}}}},{T_{s}}}\right],~{}{\rm{if}}~{}{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{\frac{1}{{\sqrt{{{\left({1+k}\right)}^{3}}}}}}\exp\left({\frac{k}{{\left({1+k}\right)}}\frac{{{m^{2}}}}{{{T_{s}}}}}\right)\leq 1}\\ \vspace{-0.1cm}\hfil\\ {\left\{\begin{array}[]{l}\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}{\cal G}\left({\cal Q}\right)-74{m^{2}}}},\frac{{-3+\left({\sqrt[3]{{{s_{1}}}}+\sqrt[3]{{{s_{2}}}}}\right)}}{3}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}<0\\ \vspace{-0.5cm}\\ \left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}{\cal G}\left({\cal Q}\right)-74{m^{2}}}},\frac{{-\gamma+\sqrt{{\Delta_{2}}}}}{6{\ln{\mathcal{V}}{\cal G}\left({\cal Q}\right)}}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}\geq 0,{\Delta_{2}}\geq 0,\\ \vspace{-0.5cm}\\ \left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}{\cal G}\left({\cal Q}\right)-74{m^{2}}}},-\frac{{\gamma}}{6{\ln{\mathcal{V}}{\cal G}\left({\cal Q}\right)}}{T_{s}}}\right],~{}{\rm{if}}~{}{\Delta_{1}}\geq 0,{\Delta_{2}}<0\\ \end{array}\right.}~{}{\rm others}\\ \vspace{-0.5cm}\hfil\\ \end{array}}\right. (54)

Proof: Since the calculation of (43) is similar to (26) in addition to the introduction of 𝒢(𝒬){\cal G}\left({\cal Q}\right), please see Appendix B about the detailed derivation of [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}. Moreover, it is worth noting that \cal I and 𝒱\cal V are replaced by 𝒢(𝒬){\cal I}{\cal G}\left({\cal Q}\right) and 𝒱𝒢(𝒬){\cal V}{\cal G}\left({\cal Q}\right), respectively, in γ\gamma, Δ1{\Delta_{1}}, and Δ2{\Delta_{2}}. Furthermore, t^1\hat{t}_{1}^{*} in (77) and t^2\hat{t}_{2}^{*} in (84) are updated as t^1=t1\hat{t}_{1}^{*}={t_{1}^{*}} and t^2=12(t2+tmax)\hat{t}_{2}^{*}=\frac{1}{2}\left({t_{2}^{*}+t_{\textrm{max}}}\right), where t1t_{1}^{*} and t1t_{1}^{*} are generated from the derived [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} with 0<𝒬<𝒬^0<\cal Q<{\hat{\cal Q}}.

III-B Detection Interval Optimization for Passive Receiver

In this subsection, we focus on the optimal detection interval for the passive receiver. According to the description on the 3D absorbing receiver, the objective function can be written as

[n1,n2]\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}} =argmin0n1,n2NPe\displaystyle=\mathop{\arg\min}\limits_{0\leq{n_{1}},{n_{2}}\leq N}{P_{e}}
{argmax0n1,n2Nn=n1n2pn,0k=1Ln=n1n2pn,k+k=0L2𝒬n=n1n2pn,k,if0<𝒬<𝒬^argmax0n1,n2Nn=n1n2pn,0k=1Ln=n1n2pn,k+k=0L2𝒬^n=n1n2pn,k,if𝒬𝒬^,\displaystyle\approx\left\{\begin{array}[]{l}\mathop{\arg\max}\limits_{0\leq{n_{1}},{n_{2}}\leq N}\frac{{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}}}}{{\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}+\sum\limits_{k=0}^{L}{\sqrt{\frac{2}{{\cal Q}}\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}}},~{}{\textrm{if}}~{}0<{\cal Q}<\hat{\cal Q}\\ \mathop{\arg\max}\limits_{0\leq{n_{1}},{n_{2}}\leq N}\frac{{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}}}}{{\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}+\sum\limits_{k=0}^{L}{\sqrt{\frac{2}{{\hat{\cal Q}}}\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}}},~{}{\textrm{if}}~{}{\cal Q}\geq\hat{\cal Q}\end{array}\right., (57)

where 𝒬^=2(k=0Ln=n1n2pn,kn=n1n2pn,0k=1Ln=n1n2pn,k)2\hat{\cal Q}=\left\lceil{2{{\left({\frac{{\sum\limits_{k=0}^{L}{\sqrt{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}}}{{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}}-\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}}}\right)}^{2}}}\right\rceil, calculated from (III-B) when assuming mSINAR = 1, where [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} is also assumed to be used. Subsequently, we will show the detailed derivation for the optimal [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]}.

III-B1 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}

In this subsection, we use the SID to obtain an approximate [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} with 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}, when there is always a [n1,n2]\left[{{n_{1}},{n_{2}}}\right] to make

n=n1n2pn,0k=1Ln=n1n2pn,k>0\displaystyle\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}}-\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}>0

hold. Here, the corresponding objective function can be re-written as

[n1,n2]argmax0n1,n2Nn=n1n2pn,0k=1Ln=n1n2pn,k.\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}}\approx\mathop{\arg\max}\limits_{0\leq{n_{1}},{n_{2}}\leq N}\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}-\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}. (58)

It is clear from (58) that the condition for maximizing n=n1n2pn,0k=1Ln=n1n2pn,k\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}-\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}} is to ensure (pn,0k=1Lpn,k)>0\left({p_{n,0}}-\sum\limits_{k=1}^{L}{{p_{n,k}}}\right)>0, for n[n1,n2]n\in{\left[{{n_{1}},{n_{2}}}\right]^{*}}. This means if

pnj,0=k=1Lpnj,k,j=1,2\displaystyle{p_{n_{j}^{*},0}}=\sum\limits_{k=1}^{L}{{p_{n_{j}^{*},k}}},~{}j=1,2 (59)

can be solved, we can obtain [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}}. For clarity, (59) can be re-arranged as

k=1L1(njts+kTs)3/2exp((d+r)24D(njts+kTs))1(njts)3/2exp((d+r)24Dnjts)=0,\displaystyle\sum\limits_{k=1}^{L}\frac{1}{{{{\left({{n_{j}^{*}}{t_{s}}+k{T_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{(d+r)}^{2}}}}{{4D\left({{n_{j}^{*}}{t_{s}}+k{T_{s}}}\right)}}}\right)-\frac{1}{{{{\left({{n_{j}^{*}}{t_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{(d+r)}^{2}}}}{{4D{n_{j}^{*}}{t_{s}}}}}\right)=0, (60)

where j=1,2j=1,2. Constrained by the computational complexity, we also solve (60) according to the ISI length LL.

Proposition 4: Assuming that the approximation for (60) for all considered LL is exact, the solution of (60) with L=1L=1 and 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} can be solved as

[n1,n2]=[28m^2Ts(120Ts74m^2)ts,N].\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}}=\left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,N}\right]. (61)

When L>1L>1 and 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}, the solution of (60) can be stated as

[n1,n2]={[28m^2Ts(120Ts28Tsln𝒲74m^2)ts,N],ifk=1L1(1+k)3exp(k(1+k)m^2Ts)1[28m^2Ts(120Ts28Tsln𝒲74m^2)ts,3+(s^13+s^23)3N],ifΔ^1<0[28m^2Ts(120Ts28Tsln𝒲74m^2)ts,γ^+Δ^26ln𝒜N],ifΔ^10,Δ^20[28m^2Ts(120Ts28Tsln𝒲74m^2)ts,γ^6ln𝒜N],ifΔ^10,Δ^2<0.\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}}=\left\{\begin{array}[]{l}\left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-28{T_{s}}\ln{\cal{W}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,N}\right],~{}{\rm{if}}~{}\sum\limits_{k=1}^{L}{\frac{1}{{\sqrt{{{\left({1+k}\right)}^{3}}}}}}\exp\left({\frac{k}{{\left({1+k}\right)}}\frac{{{{\hat{m}}^{2}}}}{{{T_{s}}}}}\right)\leq 1\\ \vspace{-0.3cm}\\ \left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-28{T_{s}}\ln{\cal{W}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,\left\lceil{\frac{{-3+\left({\sqrt[3]{{{{\hat{s}}_{1}}}}+\sqrt[3]{{{{\hat{s}}_{2}}}}}\right)}}{3}N}\right\rceil}\right],~{}{\rm{if}}~{}{{\hat{\Delta}}_{1}}<0\\ \vspace{-0.3cm}\\ \left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-28{T_{s}}\ln{\cal{W}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,\left\lceil{\frac{{-\hat{\gamma}+\sqrt{{{\hat{\Delta}}_{2}}}}}{{6\ln\cal{A}}}N}\right\rceil}\right],~{}{\rm{if}}~{}{{\hat{\Delta}}_{1}}\geq 0,{{\hat{\Delta}}_{2}}\geq 0\\ \vspace{-0.3cm}\\ \left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-28{T_{s}}\ln{\cal{W}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,\left\lceil{\frac{{-\hat{\gamma}}}{{6\ln\cal{A}}}N}\right\rceil}\right],~{}{\rm{if}}~{}{{\hat{\Delta}}_{1}}\geq 0,{{\hat{\Delta}}_{2}}<0\\ \end{array}\right.. (69)

Proof: See Appendix C.

III-B2 𝒬𝒬^{\cal Q}\geq\hat{\cal Q}

In this subsection, we will derive an optimal [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]}, which is suitable for all possible 𝒬\cal Q in the range of [𝒬^,)\left[{\hat{\cal Q},\infty}\right). Similarly, we use [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} derived when 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q} to determine 𝒬^{\hat{\cal Q}}. Then, by using the mSID, we can transform the objective function in (III-B) into

[n1,n2]argmax0n1,n2N{n=n1n2pn,0𝒢^(𝒬)k=1Ln=n1n2pn,k},\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}}\approx\mathop{\arg\max}\limits_{0\leq{n_{1}},{n_{2}}\leq N}\left\{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}-\hat{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}}\right\}, (70)

where 𝒢^(𝒬)=(𝒬+2α^2)(𝒬2α^1)\hat{\cal G}\left({\cal Q}\right)=\frac{{\left({\sqrt{\cal Q}+\sqrt{2}{{\hat{\alpha}}_{2}}}\right)}}{{\left({\sqrt{\cal Q}-\sqrt{2}{{\hat{\alpha}}_{1}}}\right)}}, and

α^11n=0Npn,0,α^21n=0Npn,1.\displaystyle{{\hat{\alpha}}_{1}}\approx\frac{1}{{\sqrt{\sum\limits_{n=0}^{N}{{p_{n,0}}}}}},~{}{{\hat{\alpha}}_{2}}\approx\frac{1}{{\sqrt{\sum\limits_{n=0}^{N}{{p_{n,{\rm{1}}}}}}}}.

In order to guarantee the feasibility of mSID, we also set 𝒬=𝒢^(𝒬^)𝒬^{\cal Q}=\hat{\cal G}\left(\hat{\cal Q}\right)\hat{\cal Q} to solve (70). It is clear from (70) that the condition for maximizing n=n1n2pn,0𝒢^(𝒬)k=1Ln=n1n2pn,k\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,0}}-\hat{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{\sum\limits_{n={n_{1}}}^{{n_{2}}}{{p_{n,k}}}}} is to ensure (pn,0𝒢^(𝒬)k=1Lpn,k)>0\left({p_{n,0}}-\hat{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}{{p_{n,k}}}\right)>0, for n[n1,n2]n\in{\left[{{n_{1}},{n_{2}}}\right]^{*}}. Therefore, (70) can be re-arranged as

𝒢^(𝒬)k=1L1(njts+kTs)3/2exp((d+r)24D(njts+kTs))1(njts)3/2exp((d+r)24Dnjts)=0,\displaystyle\hat{\cal G}\left({\cal Q}\right)\sum\limits_{k=1}^{L}\frac{1}{{{{\left({{n_{j}^{*}}{t_{s}}+k{T_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{(d+r)}^{2}}}}{{4D\left({{n_{j}^{*}}{t_{s}}+k{T_{s}}}\right)}}}\right)-\frac{1}{{{{\left({{n_{j}^{*}}{t_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{(d+r)}^{2}}}}{{4D{n_{j}^{*}}{t_{s}}}}}\right)=0, (71)

where j=1,2j=1,2. The calculation of [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} in (70) is almost the same to (58), therefore, [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} can be shown in (61) and (69) with the introduction of 𝒢^(𝒬)\hat{\cal G}\left({\cal Q}\right). Besides, n1^\hat{n_{1}^{*}} in (94) and n2^\hat{n_{2}^{*}} in (98) are replaced by n1{n_{1}^{*}} and n2ts+tmax2ts\frac{{n_{2}^{*}{t_{s}}+{t_{\max}}}}{{2{t_{s}}}}, respectively, where n1{n_{1}^{*}} and n2{n_{2}^{*}} have been derived when 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}.

IV Numerical results and analysis

TABLE I: System Parameters
Parameter Absorbing receiver Passive receiver
Radius of receiver (rr) 5μ5\mum 1μ1\mum
Transmission distance (dd) 5μ5\mum 9μ9\mum
Diffusion coefficient (DD) 80×1012m2/s80\times 10^{-12}\rm{m^{2}/s} 80×1012m2/s80\times 10^{-12}\rm{m^{2}/s}

In this section, we employ Monte Carlo simulations to demonstrate the BER performance of the proposed mSINAR scheme, and include the shift-τ\tau method investigated in [28], the conventional OOK scheme, and the existing SID and SINAR as benchmarks to measure the system performance, where the optimal detection threshold is assumed to be employed for all schemes. Moreover, in the simulations, we reveal the convergence of the optimal detection interval and also verify the theoretical [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} and [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} obtained from mSINAR. Finally, the system parameters are listed in Table I and the sampling interval is set to ts=tmax6{t_{s}}=\left\lfloor{\frac{{{t_{\max}}}}{6}}\right\rfloor for the passive receiver.

IV-A Convergence of Optimal Detection Interval

Refer to caption
Refer to caption
Figure 2: Convergence of the optimal detection interval [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} versus 𝒬\cal Q, where the absorbing receiver with Ts=0.2T_{s}=0.2 and L=4,5,6,8L=4,5,6,8 is considered.
Refer to caption
Refer to caption
Refer to caption
Figure 3: Convergence of the optimal detection interval [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} versus 𝒬\cal Q, where the passive receiver with Ts=1T_{s}=1 and L=2,3,5,10L=2,3,5,10 is considered.

In this subsection, we investigate the convergence of the optimal detection interval, where the absorbing and passive receivers are considered in Fig. 2 and Fig. 3, respectively. Besides, we include the optimal [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]} and [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]} obtained by two different methods for comparison. Taking the absorbing receiver as an example, we refer to “Exhaustive search” as [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from the exhaustive search for argminPe\arg\min{P_{e}}, and “mSINAR” as [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from (III-A).

Refer to caption
(a) absorbing receiver with Ts=0.2T_{s}=0.2
Refer to caption
(b) absorbing receiver with Ts=0.3T_{s}=0.3
Figure 4: BER versus 𝒬\cal Q performance of the proposed mSINAR: numerical verification, where the absorbing receiver with Ts={0.2,0.3}{T_{s}}=\left\{{0.2,0.3}\right\} is considered.

Fig. 2 shows the convergence of t1t_{1}^{*} and t2t_{2}^{*}, respectively, corresponding to the first and second subplots, where the absorbing receiver with Ts=0.2T_{s}=0.2 and L=4,5,6,8L=4,5,6,8 is considered. It can be seen from these plots that for all cases considered, both t1t_{1}^{*} and t2t_{2}^{*} eventually converge, especially a smaller LL will accelerate the convergence. This can be explained as follows: since the influence of noise is inversely proportional to 𝒬\cal Q, all interference can be approximately regarded as linearly related to the desired signal, when 𝒬\cal Q is large enough; while once this linear correlation is first achieved, [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} remains unchanged for future 𝒬\cal Q. Besides, for a given 𝒬\cal Q, due to the weaker interference, the situation with a smaller LL can achieve this linear correlation faster. Moreover, we can observe from Fig. 2 that the initial value of t1t_{1}^{*} is about 12tmax\frac{1}{2}t_{\textrm{max}} instead of tmaxt_{\textrm{max}}; while for t2t_{2}^{*}, its original value is TsT_{s}. This is because, as long as LL is greater than 0, the forward ISI (the ISI with 0ttmax0\leq t\leq{t_{\max}}) always exists and suppresses the expected signal in a short time, no matter how much 𝒬\cal Q is; while the backward interference (the ISI and noise with tmax<tTs{t_{\max}}<t\leq T_{s}) is relatively small with a smaller 𝒬\cal Q. Finally, as expected, [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} obtained from mSINAR is well matched to that obtained from the exhaustive search, albeit with a slight gap. Fortunately, in Fig. 4, we can find that this gap has little effect on BER performance.

Refer to caption
(a) absorbing receiver with Ts=1T_{s}=1
Refer to caption
(b) absorbing receiver with Ts=2T_{s}=2
Figure 5: BER versus 𝒬\cal Q performance of the proposed mSINAR: numerical verification, where the passive receiver with Ts={1,2}{T_{s}}=\left\{{1,2}\right\} is considered.

Fig. 3 depicts the convergence of [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} for the passive receivers with Ts=1T_{s}=1 and L=2,3,5,10L=2,3,5,10. Similar to Fig. 2, [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} is convergent and its convergence rate is inversely proportional to LL. Moreover, [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} obtained from mSINAR almost perfectly matches that obtained from the exhaustive search for argminPe\arg\min{P_{e}}, compared with Fig. 2. This can be interpreted as follows: the passive receiver can be regarded as an absorbing receiver with limited sampling times, and due to a large sampling distance, it has some fault tolerance for the optimal detection interval.

IV-B Validation of Theoretical Results

In this subsection, we verify the validity of the detection interval optimization obtained from Section III. Specifically, the simulated [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} (or [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}}) obtained from (III-A) (or (III-B)) and the theoretical counterpart obtained from Propositions 1-3 (or Proposition 4) are involved, respectively, corresponding to “Numerical mSINAR” and “Theoretical mSINAR”. For reference, we also include the best BER curve obtained from argminPe\mathop{\arg\min}{P_{e}} via the exhaustive search.

Fig. 4 shows the resulting BER versus 𝒬\cal Q performance, where the absorbing receiver with Ts={0.2,0.3}{T_{s}}=\left\{{0.2,0.3}\right\} is considered. It can be seen from Fig. 4(a) that the BER curve from the numerical mSINAR perfectly matches the best BER curve for all considered LL. Then, as TsT_{s} increases from 0.20.2 to 0.30.3, a similar phenomenon is also described in Fig. 4(b). However, compared with the perfect match in Fig. 4(a), we can observe that there is a slight gap between the above BER curves in Fig. 4(b), especially for L=8L=8. This is because the denominator of (16) (i.e., the interference) decreases with an increasing TsT_{s}, thus accelerating the convergence rate of mSINAR. Therefore, we can predict that as 𝒬\cal Q increases, the BER with the simulated [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} approaches the best BER. The above facts indicate that the proposed mSINAR can be good alternatives to measure the BER performance for the absorbing receiver. Moreover, as can be observed from Fig. 4, the BER with the derived [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} is asymptotically tight with that of the other two cases for most 𝒬\cal Q, verifying the accuracy of the theoretical [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}. On the other hand, we also find that for a few 𝒬\cal Q, the BER with the theoretical [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} cannot agree well with that of the other two cases, especially when L=10L=10 and Ts=0.2T_{s}=0.2. This is attributed to the fact: 𝒬\cal Q corresponding to the most obvious BER mismatch among all curves is 𝒬^\mathcal{\hat{Q}} defined in (III-A); whereas when 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}, the derivation of theoretical [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} neglects the impact of the noise, thus leading to this mismatch.

Fig. 5 illustrates the resulting BER versus 𝒬\cal Q performance, where the passive receivers with Ts=1T_{s}=1 and 22 are considered in Fig. 5(a) and Fig. 5(b), respectively. Similar to the absorbing receiver, one can easily observe from Fig. 5 that the BER curves corresponding to the theoretical mSINAR agree with that of the numerical counterparts and the best BER curves approximately, showing the accuracy of the derived [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} and the effectiveness of the mSINAR metric for the passive receiver. Moreover, we also can find that the BER mismatch near the critical point 𝒬^\hat{\cal Q} will be more pronounced than that of the absorbing receiver. This can be accounted for by the fact that the passive receiver itself cannot reduce ISI via absorbing the information molecules, thereby increasing the proportion of the counting noise in the received signals and further weakening the effectiveness using SID to approximately calculate [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} when 0<𝒬<𝒬^0<{\cal Q}<\hat{\cal Q}.

IV-C Performance of The Proposed mSINAR

Refer to caption
(a) absorbing receiver with Ts=0.2T_{s}=0.2
Refer to caption
(b) absorbing receiver with Ts=0.3T_{s}=0.3
Figure 6: BER comparison among “numerical mSINAR”, “numerical SINAR”, “numerical SID”, “the shift-τ\tau method”, and the conventional OOK for the absorbing receiver.

In this subsection, we compare the achievable performance between the proposed mSINAR and other existing schemes. Specifically, based on the concept of optimizing the detection interval during a symbol duration, we include the existing SINAR and SID as benchmarks to estimate the effectiveness of mSINAR, where the detection intervals are obtained from the numerical search for all considered metrics. Besides, to further explore the potential advantage of mSINAR, we also include the shift-τ\tau method investigated in [28] and the conventional OOK for comparison. For clarity, in the following figures, we will no longer show the best BER curve, since the BER curves from the numerical mSINAR are almost perfectly matched to the best BER curves in the previous subsection.

Refer to caption
(a) passive receiver with Ts=1T_{s}=1
Refer to caption
(b) passive receiver with Ts=2T_{s}=2
Figure 7: BER comparison among “numerical mSINAR”, “numerical SINAR”, “numerical SID”, “the shift-τ\tau method”, and the conventional OOK for the passive receiver.

Fig. 6 shows the BER performance comparison among “numerical mSINAR”, “numerical SINAR”, “numerical SID”, “the shift-τ\tau method”, and the conventional OOK, where the absorbing receiver with Ts={0.2,0.3}{T_{s}}=\left\{{0.2,0.3}\right\} is considered. As expected, both these schemes using the detection interval optimization and the shift-τ\tau method outperform the conventional OOK cases. Additionally, we can observe from Fig. 6 that the BER curves with mSINAR almost perform best in all considered schemes for L>1L>1; whereas when L=1L=1, the shift-τ\tau method is slightly superior to the numerical mSINAR, especially in Fig. 6(a). This can be interpreted as follows: when LL is small and t>tmaxt>t_{\max}, the amplitude of the ISI signal cannot exceed that of the expected signal, such that the received information belonging to [Ts,τ+Ts]\left[{{T_{s}},\tau+{T_{s}}}\right] contributes to signal detection and the shift-τ\tau method performs better; however, with the increase of LL, the cumulative interference intensity in [Ts,τ+Ts]\left[{{T_{s}},\tau+{T_{s}}}\right] gradually rises and finally surpasses the expected signal intensity. Here, since the detection interval is always in the range of the current symbol period, the proposed mSINAR does not bring the extra interference generated in [Ts,τ+Ts]\left[{{T_{s}},\tau+{T_{s}}}\right] and thus obtain the performance gain. Particularly, besides the existing ISI signal, the transmitted signal of the next symbol duration is also regarded as the interference in [Ts,τ+Ts]\left[{{T_{s}},\tau+{T_{s}}}\right]. Finally, we compare the BER curves using different performance metrics. As for SID, it can be seen from Fig. 6 that the degree of agreement between the BER curve corresponding to SID and that corresponding to mSINAR is not stable, which is caused by SID ignoring the influence of noise. Concerning SIANR, we find that the BER curve using SINAR will gradually deviate from that using mSINAR as 𝒬\cal Q grows. This arises from the fact that as the variance of the noise in (14) decreases with an increasing 𝒬\cal Q, all [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} derived from SINAR with different LL and TsT_{s} finally approaches nearby the peak time of the molecule concentration tmaxt_{\max}, which violates the convergence of the true [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}.

As for the passive receiver, Fig. 7 shows the simulation results similar to Fig. 6. By carefully observing Fig. 6-7, we can find that the achieved gain of the proposed mSINAR over the shift-τ\tau decreases with an increasing TsT_{s} whether the absorbing or passive receiver is considered, since the increase of TsT_{s} weakens the amplitude of the ISI signals and thus lowers the extra interference generated in [Ts,τ+Ts]\left[{{T_{s}},\tau+{T_{s}}}\right]. Comparing mSINAR with SID and SINAR, we can see that the latter two cannot provide a stable quantification for BER trends and also cannot derive a close-to-optimal detection interval for all considered cases, proving that mSINAR is more suitable to measure the possible [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}}.

V Conclusion

In this paper, we proposed optimizing the detection interval to mitigate the impact of ISI signals for a typical MCvD system. Constrained by the complex expression of BER, a new performance indicator, namely mSINAR, was proposed to simplify the optimization process. Based on the mSINAR method, the objective function related to the optimal detection interval has been formulated. By decomposing the objective functions as two sub-problems, we derived the closed-form expression of this interval when the absorbing and passive receivers are considered. Moreover, numerical simulations revealed the convergence of the optimal detection interval. Finally, we proved that the proposed mSINAR method significantly outperforms the benchmark schemes when the ISI length is more than 1 and gradually achieves the best BER performance for the considered MCvD system.

Appendix A

Assuming L=1L=1, (26) can be expressed as

32(Ts+ti)ti{ln(1+tiTs)ln(tiTs)}=m2Ts,i=1,2\displaystyle\frac{3}{2}\left({{T_{s}}+t_{i}^{*}}\right)t_{i}^{*}\left\{{\ln\left({1+\frac{{t_{i}^{*}}}{{{T_{s}}}}}\right)-\ln\left({\frac{{t_{i}^{*}}}{{{T_{s}}}}}\right)}\right\}={m^{2}}{T_{s}},~{}i=1,2 (72)

where m=d4Dm=\frac{d}{{\sqrt{4D}}}. For clarity, we first calculate t1t_{1}^{*}. It is clear from (72) that ln()\ln\left(\cdot\right) is a main obstacle to calculate t1t_{1}^{*}. Considering the fact that the information at tmaxt_{\max} should be collected for signal detection, we have t1(0,tmax)t_{1}^{*}\in\left({0,{t_{\max}}}\right) and t2(tmax,Ts]t_{2}^{*}\in\left({{t_{\max}},{T_{s}}}\right]. Besides, compared with TsT_{s}, tmaxt_{\max}, the time of peak concentration, is generally small. Thereby, we can find that t1Ts\frac{{{t_{1}^{*}}}}{{{T_{s}}}} is much closer to 0 than 1. Here, we can use the approximation methods to simplify (72). Specifically, the [1,1]\left[{1,1}\right] Padé approximation of ln(1+x)\ln(1+x) can be written as ln(1+x)2x2+x\ln(1+x)\approx\frac{{2x}}{{2+x}}, and ln(x)\ln(x) can be approximately expressed as lnx=20(x1)7+15x\ln x=\frac{{20\left({x-1}\right)}}{{7+15x}} [28]. Substituting the above approximations into (72) yields

29(t1)4+23(t1)3Ts+(t1)2Ts(34Ts10m2Ts)+t1Ts2(40Ts743m2)283m2Ts3=0.\displaystyle 29{\left({t_{1}^{*}}\right)^{4}}+23{\left({t_{1}^{*}}\right)^{3}}{T_{s}}+{\left({t_{1}^{*}}\right)^{2}}{T_{s}}\left({34{T_{s}}-10{m^{2}}{T_{s}}}\right)+t_{1}^{*}T_{s}^{2}\left({40{T_{s}}-\frac{{74}}{3}{m^{2}}}\right)-\frac{{28}}{3}{m^{2}}T_{s}^{3}=0. (73)

Considering that t1{t_{1}^{*}} should be a small value and 0<t1<tmax0<{t_{1}^{*}}<{t_{\max}}, t1{t_{1}^{*}} terms whose order is higher than one can be neglected. Thus, (73) can be approximately solved as

t128m2Ts120Ts74m2.\displaystyle t_{1}^{*}\approx\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-74{m^{2}}}}. (74)

Moreover, given t2(tmax,Ts]t_{2}^{*}\in\left({{t_{\max}},{T_{s}}}\right], we can find that h(t2)h(Ts+t2)>0h\left({t_{2}^{*}}\right)-h\left({{T_{s}}+t_{2}^{*}}\right)>0 almost always holds in (26) if L=1L=1. Therefore, we have t2=Tst_{2}^{*}=T_{s}. In summary, we can obtain

[t1,t2][28m2Ts120Ts74m2,Ts].\displaystyle{\left[{{t_{1}},{t_{2}}}\right]^{*}}\approx\left[{\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-74{m^{2}}}},{T_{s}}}\right]. (75)

Appendix B

Assuming L>1L>1, (26) can be re-written as

1t3iexp(m2ti)=k=1L1(kTs+ti)3exp(m2(kTs+ti)),i=1,2.\displaystyle\frac{1}{{\sqrt{t{{{}_{i}^{*}}^{3}}}}}\exp\left({-\frac{{{m^{2}}}}{{t_{i}^{*}}}}\right)=\sum\limits_{k=1}^{L}{\frac{1}{{\sqrt{{{\left({k{T_{s}}+t_{i}^{*}}\right)}^{3}}}}}\exp\left({-\frac{{{m^{2}}}}{{\left({k{T_{s}}+t_{i}^{*}}\right)}}}\right)},i=1,2. (76)

For clarity, we first calculate t1t_{1}^{*}. Considering t1(0,tmax)t_{1}^{*}\in\left({0,{t_{\max}}}\right) and tmax<<Tst_{\max}<<T_{s}, we approximately have

exp(m2(kTs+t1))exp(m2(kTs+t^1)),k=1,,L\displaystyle\exp\left({-\frac{{{m^{2}}}}{{\left({k{T_{s}}+t_{1}^{*}}\right)}}}\right)\approx\exp\left({-\frac{{{m^{2}}}}{{\left({k{T_{s}}+\hat{t}_{1}^{*}}\right)}}}\right),~{}k=1,\cdots,L

where t^1\hat{t}_{1}^{*} denotes the optimal t1t_{1} when L=1L=1. Moreover, with the aid of the first order of Taylor expression of (1+x)a{\left({1+x}\right)^{a}}, (76) can be expressed as

(t1Ts)52{k=1Lak(132k)}(t1Ts)32{k=1Lak}+exp(m2t1)0,\displaystyle{\left({\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)^{\frac{5}{2}}}\left\{{\sum\limits_{k=1}^{L}{{a_{k}}\left({1-\frac{3}{{2k}}}\right)}}\right\}-{\left({\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)^{\frac{3}{2}}}\left\{{\sum\limits_{k=1}^{L}{{a_{k}}}}\right\}+\exp\left({-\frac{{{m^{2}}}}{{t_{1}^{*}}}}\right)\approx 0, (77)

where ak=1k3exp(m2(kTs+t^1)){a_{k}}=\frac{1}{{\sqrt{{k^{3}}}}}\exp\left({-\frac{{{m^{2}}}}{{\left({k{T_{s}}+\hat{t}_{1}^{*}}\right)}}}\right). However, it can be seen from (77) that we hardly obtain a closed-form solution of t1t_{1}^{*}. The reason can be described as follows: 1) due to m2t11.5\frac{{{m^{2}}}}{{t_{1}^{*}}}\geq 1.5, exp(m2t1)\exp{\left({-\frac{{{m^{2}}}}{{t_{1}^{*}}}}\right)} cannot be simplified well by Taylor series or other approximation methods; 2) there exist the fractional power exponents (t1Ts)52{\left({\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)^{\frac{5}{2}}} and (t1Ts)32{\left({\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)^{\frac{3}{2}}} in (77), which are hard to deal with. Therefore, in order to obtain a better expression for t1t_{1}^{*}, we need to simplify the summation caused by the LL ISI signals in (76). First, given that the ISI from the last time slot plays a dominant role in all ISI signals, it is reasonable to assume t1t^1t_{1}^{*}\approx\hat{t}_{1}^{*}. Second, one can easily observe from the property of the diffusion channel that h(t)h\left(t\right) decreases slowly when tt is relatively large. As per the above, we can approximate the ratio of h(kTs+t){h\left({k{T_{s}}+t}\right)} with k2k\geq 2 to h(Ts+t){h\left(T_{s}+t\right)} at t1t_{1}^{*} as the ratio at t^1\hat{t}_{1}^{*}, mathematically expressed as

h(kTs+t1)h(Ts+t1)h(kTs+t^1)h(Ts+t^1).\displaystyle\frac{{h\left({k{T_{s}}+t_{1}^{*}}\right)}}{{h\left({{T_{s}}+t_{1}^{*}}\right)}}\approx\frac{{h\left({k{T_{s}}+\hat{t}_{1}^{*}}\right)}}{{h\left({{T_{s}}+\hat{t}_{1}^{*}}\right)}}. (78)

Substituting (78) into (76) yields

1t3iexp(m2t1)=1(Ts+t1)3exp(m2(Ts+t1))k=1L{h(kTs+t^1)h(Ts+t^1)}.\displaystyle\frac{1}{{\sqrt{t{{{}_{i}^{*}}^{3}}}}}\exp\left({-\frac{{{m^{2}}}}{{t_{1}^{*}}}}\right)=\frac{1}{{\sqrt{{{\left({{T_{s}}+t_{1}^{*}}\right)}^{3}}}}}\exp\left({-\frac{{{m^{2}}}}{{\left({{T_{s}}+t_{1}^{*}}\right)}}}\right)\sum\limits_{k=1}^{L}{\left\{{\frac{{h\left({k{T_{s}}+\hat{t}_{1}^{*}}\right)}}{{h\left({{T_{s}}+\hat{t}_{1}^{*}}\right)}}}\right\}}. (79)

Let us define =k=1L{h(kTs+t^1)h(Ts+t^1)}\mathcal{I}=\sum\limits_{k=1}^{L}{\left\{{\frac{{h\left({k{T_{s}}+\hat{t}_{1}^{*}}\right)}}{{h\left({{T_{s}}+\hat{t}_{1}^{*}}\right)}}}\right\}}, (79) can be further simplified as

m2Ts=32t1(Ts+t1)(ln(1+t1Ts)ln(t1Ts))t1(Ts+t1)ln.\displaystyle{m^{2}}{T_{s}}=\frac{3}{2}t_{1}^{*}\left({{T_{s}}+t_{1}^{*}}\right)\left({\ln\left({1+\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)-\ln\left({\frac{{t_{1}^{*}}}{{{T_{s}}}}}\right)}\right)-t_{1}^{*}\left({{T_{s}}+t_{1}^{*}}\right)\ln{\cal I}. (80)

With the aid of the approximations of ln(1+x)\ln\left({1+x}\right) and ln(x)\ln\left({x}\right), we can approximate (80) as

(t1)4(2910ln)+(t1)3Ts(231043ln)+(t1)2Ts(34Ts34Tsln10m2Ts)\displaystyle{\left({t_{1}^{*}}\right)^{4}}\left({29-10\ln{\cal I}}\right)+{\left({t_{1}^{*}}\right)^{3}}{T_{s}}\left({23-\frac{{104}}{3}\ln{\cal I}}\right)+{\left({t_{1}^{*}}\right)^{2}}{T_{s}}\left({34{T_{s}}-34{T_{s}}\ln{\cal I}-10{m^{2}}{T_{s}}}\right)
+t1Ts2(40Ts283Tsln743m2)283m2Ts3=0.\displaystyle+t_{1}^{*}T_{s}^{2}\left({40{T_{s}}-\frac{{28}}{3}{T_{s}}\ln{\cal I}-\frac{{74}}{3}{m^{2}}}\right)-\frac{{28}}{3}{m^{2}}T_{s}^{3}=0. (81)

When t1{t_{1}^{*}} terms whose order is higher than one are neglected, t1{t_{1}^{*}} can be solved as

t128m2Ts120Ts28Tsln74m2.\displaystyle t_{1}^{*}\approx\frac{{28{m^{2}}{T_{s}}}}{{120{T_{s}}-28{T_{s}}\ln{\cal I}-74{m^{2}}}}. (82)

Next, we focus on the calculation of t2t_{2}^{*}. Provided that when LL is not enough large, the ISI signals cannot exceed the expected signal. Therefore, we have if

1k=1L1(1+k)3exp(k(1+k)m2Ts)0\displaystyle 1-\sum\limits_{k=1}^{L}{\frac{1}{{\sqrt{{{\left({1+k}\right)}^{3}}}}}}\exp\left({\frac{k}{{\left({1+k}\right)}}\frac{{{m^{2}}}}{{{T_{s}}}}}\right)\geq 0 (83)

holds, t2=Tst_{2}^{*}={T_{s}}. On the other hand, when (83) cannot be satisfied, the calculation procedure of t2t_{2}^{*} is similar to that of t1t_{1}^{*}. The first step is still to simplify (76). Similar to (78), we also have the following expression to approximate the ratio of h(kTs+t){h\left({k{T_{s}}+t}\right)} with k2k\geq 2 to h(Ts+t){h\left(T_{s}+t\right)} at t2t_{2}^{*} as the ratio at t^2\hat{t}_{2}^{*},

h(kTs+t2)h(Ts+t2)h(kTs+t^2)h(Ts+t^2).\displaystyle\frac{{h\left({k{T_{s}}+t_{2}^{*}}\right)}}{{h\left({{T_{s}}+t_{2}^{*}}\right)}}\approx\frac{{h\left({k{T_{s}}+\hat{t}_{2}^{*}}\right)}}{{h\left({{T_{s}}+\hat{t}_{2}^{*}}\right)}}. (84)

Particularly, we set the pre-defined t^2\hat{t}_{2}^{*} as the mean for possible t2t_{2}, i.e., t^2=12(tmax+Ts)\hat{t}_{2}^{*}=\frac{1}{2}\left({{t_{\max}}+{T_{s}}}\right). This is because, compared with the assumption of t1t^1t_{1}^{*}\approx\hat{t}_{1}^{*}, we cannot identify the impact of the last ISI signal from t2=Tst_{2}^{*}={T_{s}} when L=1L=1; and the fluctuation of all signals may be much sharply due to the larger (tmax,Ts]\left({{t_{\max}},{T_{s}}}\right]. Per the aforementioned, (76) can be re-written as

32t2(Ts+t2)(ln(1+t2Ts)ln(t2Ts))t2(Ts+t2)ln𝒱=m2Ts,\displaystyle\frac{3}{2}t_{2}^{*}\left({{T_{s}}+t_{2}^{*}}\right)\left({\ln\left({1+\frac{{t_{2}^{*}}}{{{T_{s}}}}}\right)-\ln\left({\frac{{t_{2}^{*}}}{{{T_{s}}}}}\right)}\right)-t_{2}^{*}\left({{T_{s}}+t_{2}^{*}}\right)\ln{\cal V}={m^{2}}{T_{s}}, (85)

where 𝒱=k=1Lh(kTs+t^2)h(Ts+t^2){\cal V}=\sum\limits_{k=1}^{L}{\frac{{h\left({k{T_{s}}+\hat{t}_{2}^{*}}\right)}}{{h\left({{T_{s}}+\hat{t}_{2}^{*}}\right)}}}. It is worth noting that that t2Ts{\frac{{t_{2}^{*}}}{{{T_{s}}}}} is much closer 1 than 0. Hence, we have ln(1+x)2x2+x\ln(1+x)\approx\frac{{2x}}{{2+x}} and ln(x)2(x1)1+x\ln(x)\approx\frac{{2\left({x-1}\right)}}{{1+x}} for x1x\to 1. Here, (85) can be rewritten as

(t2Ts)3ln𝒱+3(t2Ts)2ln𝒱+t2Ts(2ln𝒱+m2Ts6)+2m2Ts0.\displaystyle{\left({\frac{{t_{2}^{*}}}{{{T_{s}}}}}\right)^{3}}\ln{\cal V}+3{\left({\frac{{t_{2}^{*}}}{{{T_{s}}}}}\right)^{2}}\ln{\cal V}+\frac{{t_{2}^{*}}}{{{T_{s}}}}\left({2\ln{\cal V}+\frac{{{m^{2}}}}{{{T_{s}}}}-6}\right)+\frac{{{2m^{2}}}}{{{T_{s}}}}\approx 0. (86)

In (86), one of the three roots, which needs to be solved, is in the range of tmax<t2<Ts{t_{\max}}<{t_{2}^{*}}<{T_{s}}. To obtain an effective solution, we need to explore the impact of the discriminant of this cubic equation. Define the discriminant of (86) as

Δ1=(ln𝒱)2((3γ18m2Ts)2(12γln𝒱36)(γ218m2ln𝒱Ts)),\displaystyle{\Delta_{1}}={\left({\ln{\mathcal{V}}}\right)^{2}}\left({{\left({3\gamma-\frac{{18{m^{2}}}}{{{T_{s}}}}}\right)^{2}}-\left({\frac{{12\gamma}}{{\ln{\mathcal{V}}}}-36}\right)\left({{\gamma^{2}}-\frac{{18{m^{2}}\ln{\mathcal{V}}}}{{{T_{s}}}}}\right)}\right), (87)

where γ=(2ln𝒱+m2Ts6)\gamma=\left({2\ln{\mathcal{V}}+\frac{{{m^{2}}}}{{{T_{s}}}}-6}\right). Then, from the first derivative of Δ1{\Delta_{1}}, we can find that when 𝒱<exp(5m24Ts+32){\mathcal{V}}<\exp\left(\frac{{5{m^{2}}}}{{4{T_{s}}}}+\frac{3}{2}\right) can be satisfied, Δ1{\Delta_{1}} is an increasing function with respect to ln𝒱\ln{\mathcal{V}} or LL. As can be seen from the definition of 𝒱{\mathcal{V}}, the required condition is easy to achieve. Then, we can find that when ln𝒱0\ln{\cal V}\to 0 (i.e., L1L\to 1), the initial value of Δ1{\Delta_{1}} is negative, mathematically expressed as

Δ1=(7212m2Ts)(m2Ts6)2ln𝒱+𝒪((ln𝒱)2)+𝒪((ln𝒱)3)+𝒪((ln𝒱)4)<0.\displaystyle{\Delta_{1}}=-\left({72-\frac{{12{m^{2}}}}{{{T_{s}}}}}\right){\left({\frac{{{m^{2}}}}{{{T_{s}}}}-6}\right)^{2}}\ln{\cal V}+{\cal O}\left({{{\left({\ln{\cal V}}\right)}^{2}}}\right)+{\cal O}\left({{{\left({\ln{\cal V}}\right)}^{3}}}\right)+{\cal O}\left({{{\left({\ln{\cal V}}\right)}^{4}}}\right)<0.

Therefore, if Δ1<0\Delta_{1}<0 can be satisfied, (86) can be solved as

t23+(s13+s23)3Ts,\displaystyle t_{2}^{*}\approx\frac{{-{3+\left({\sqrt[3]{{{s_{1}}}}+\sqrt[3]{{{s_{2}}}}}\right)}}}{3}{T_{s}}, (88)

where

si=(81ln𝒱+27m22Tsln𝒱)+(1)i19Δ12(ln𝒱)2,i=1,2.\displaystyle{s_{i}}=-\left({\frac{{81}}{{\ln{\mathcal{V}}}}+\frac{{27{m^{2}}}}{{2{T_{s}}\ln{\mathcal{V}}}}}\right)+{\left({-1}\right)^{i-1}}\frac{{\sqrt{9{\Delta_{1}}}}}{{2{{\left({\ln{\mathcal{V}}}\right)}^{2}}}},~{}i=1,2.

As LL goes large until Δ10\Delta_{1}\geq 0, more ISI signals are introduced and t2t_{2}^{*} gradually decreases. At this moment, we decide to neglect t2Ts{\frac{{t_{2}^{*}}}{{{T_{s}}}}} with the highest order and then (87) can be transformed into the quadratic equation. Let us define the discriminant of the updated quadratic equation as

Δ2=(m2Ts6)2+4(ln𝒱)2(20m2Ts+24)ln𝒱.\displaystyle{\Delta_{2}}={\left({\frac{{{m^{2}}}}{{{T_{s}}}}-6}\right)^{2}}+4{\left({\ln{\cal V}}\right)^{2}}-\left({\frac{{20{m^{2}}}}{{{T_{s}}}}+24}\right)\ln{\cal V}. (89)

Taking the first derivative of Δ2{\Delta_{2}} with respect to 𝒱{\cal V} yields

Δ2ln𝒱=8ln𝒱20m2Ts24<0,\displaystyle\frac{{\partial{\Delta_{2}}}}{{\partial\ln{\cal V}}}=8\ln{\cal V}-\frac{{20{m^{2}}}}{{{T_{s}}}}-24<0,

suggesting that Δ2{\Delta_{2}} is degraded with the growth of LL. Moreover, it is clear from (89) that when ln𝒱\ln{\cal V} is not large enough, it is possible for Δ20\Delta_{2}\geq 0. Thus, when Δ10\Delta_{1}\geq 0 and Δ20\Delta_{2}\geq 0, (86) can be computed as

t2γ+Δ26ln𝒱Ts,\displaystyle t_{2}^{*}\approx\frac{{-\gamma+\sqrt{{\Delta_{2}}}}}{6{\ln{\mathcal{V}}}}{T_{s}}, (90)

Furthermore, when Δ10\Delta_{1}\geq 0 and Δ2<0\Delta_{2}<0, we approximate t2t_{2}^{*} as

t2γ6ln𝒱Ts.\displaystyle t_{2}^{*}\approx-\frac{{\gamma}}{6{\ln{\mathcal{V}}}}{T_{s}}. (91)

So far, the calculation for [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} has been finished and the approximate solutions of [t1,t2]{\left[{{t_{1}},{t_{2}}}\right]^{*}} for all possible LL can be found in Proposition 2.

Appendix C

According to (60), we first investigate the impact of the strongest ISI tap, i.e., assuming L=1L=1. Since the expected signal always overwhelms the ISI signal when t>tmaxt>t_{\max}, we have n2=Nn_{2}^{*}=N. Here, (60) can be re-written as

n1ts(n1ts+Ts)+m^2Ts=32n1ts(n1ts+Ts)ln(n1ts+Ts)n1ts,\displaystyle n_{1}^{*}{t_{s}}\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)+{{\hat{m}}^{2}}{T_{s}}=\frac{3}{2}n_{1}^{*}{t_{s}}\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)\ln\frac{{\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)}}{{n_{1}^{*}{t_{s}}}}, (92)

where m^=d+r4D\hat{m}=\frac{{d+r}}{{\sqrt{4D}}}. At this point, with the aid of the approximation again, we can conclude

[n1,n2][28m^2Ts(120Ts74m^2)ts,N].\displaystyle{\left[{{n_{1}},{n_{2}}}\right]^{*}}\approx\left[{\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil,N}\right]. (93)

Next, we try to find a feasible solution for [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} when L>1L>1. It is clear from (60) that the summation of LL ISI signals and exp()\exp\left(\cdot\right) is a huge challenge to calculate [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}}. Therefore, in the following, we also use a similar method to the absorbing receiver to apply the last ISI to approximate the remaining ISI signal.

For clarity, we first calculate n1n_{1}^{*}. It is assumed that the ratio between pn,1{p_{n,1}} and pn,k{p_{n,k}} at n1n_{1}^{*} can be approximated as the ratio at n^1\hat{n}_{1}^{*} for k=2,,Lk=2,\cdots,L, i.e.,

pn1,kpn1,1pn^1,kpn^1,1,\displaystyle\frac{{{p_{n_{1}^{*},k}}}}{{{p_{n_{1}^{*},1}}}}\approx\frac{{{p_{\hat{n}_{1}^{*},k}}}}{{{p_{\hat{n}_{1}^{*},1}}}}, (94)

where n^1\hat{n}_{1}^{*} is assumed to be the optimal first sample when L=1L=1, i.e., n^1=28m^2Ts(120Ts74m^2)ts\hat{n}_{1}^{*}=\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil. Substituting (94) into (60) yields

1(n1ts+Ts)3/2exp(m^2(n1ts+Ts))k=1Lpn^1,kpn^1,1=1(n1ts)3/2exp(m^2n1ts).\displaystyle\frac{1}{{{{\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{\hat{m}}^{2}}}}{{\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)}}}\right)\sum\limits_{k=1}^{L}{\frac{{{p_{\hat{n}_{1}^{*},k}}}}{{{p_{\hat{n}_{1}^{*},1}}}}}=\frac{1}{{{{\left({n_{1}^{*}{t_{s}}}\right)}^{3/2}}}}\exp\left({-\frac{{{{\hat{m}}^{2}}}}{{n_{1}^{*}{t_{s}}}}}\right). (95)

Define 𝒲=k=1Lpn^1,kpn^1,1{\cal W}=\sum\limits_{k=1}^{L}{{\frac{{{p_{\hat{n}_{1}^{*},k}}}}{{{p_{\hat{n}_{1}^{*},1}}}}}}, (95) can be further simplified as

32(n1ts+Ts)(n1ts)(ln(1+n1tsTs)ln(n1tsTs))(n1ts+Ts)(n1ts)ln𝒲=m^2Ts.\displaystyle\frac{3}{2}\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)\left({n_{1}^{*}{t_{s}}}\right)\left({\ln\left({1+\frac{{n_{1}^{*}{t_{s}}}}{{{T_{s}}}}}\right)-\ln\left({\frac{{n_{1}^{*}{t_{s}}}}{{{T_{s}}}}}\right)}\right)-\left({n_{1}^{*}{t_{s}}+{T_{s}}}\right)\left({n_{1}^{*}{t_{s}}}\right)\ln{\cal W}={{\hat{m}}^{2}}{T_{s}}. (96)

With the approximation of ln(1+x)\ln\left({1+x}\right) and ln(x)\ln\left({x}\right), n1n_{1}^{*} can be solved as

n128m^2Ts(120Ts28Tsln𝒲74m^2)ts.\displaystyle n_{1}^{*}\approx\left\lceil{\frac{{28{{\hat{m}}^{2}}{T_{s}}}}{{\left({120{T_{s}}-28{T_{s}}\ln{\cal W}-74{{\hat{m}}^{2}}}\right){t_{s}}}}}\right\rceil. (97)

As for n2n_{2}, we also first obtain the approximation of the ratio between pn,1{p_{n,1}} and pn,k{p_{n,k}} at n2n_{2}^{*}, i.e.,

pn2,kpn2,1pn^2,kpn^2,1,\displaystyle\frac{{{p_{n_{2}^{*},k}}}}{{{p_{n_{2}^{*},1}}}}\approx\frac{{{p_{\hat{n}_{2}^{*},k}}}}{{{p_{\hat{n}_{2}^{*},1}}}}, (98)

where k=2,,Lk=2,\cdots,L and n^2=tmax+Ts2ts\hat{n}_{2}^{*}=\left\lceil{\frac{{{t_{\max}}+{T_{s}}}}{{2{t_{s}}}}}\right\rceil. By substituting (98) into (60), we can obtain

32(n2ts+Ts)(n2ts)(ln(1+n2tsTs)ln(n2tsTs))(n2ts+Ts)(n2ts)ln𝒜=m^2Ts,\displaystyle\frac{3}{2}\left({n_{2}^{*}{t_{s}}+{T_{s}}}\right)\left({n_{2}^{*}{t_{s}}}\right)\left({\ln\left({1+\frac{{n_{2}^{*}{t_{s}}}}{{{T_{s}}}}}\right)-\ln\left({\frac{{n_{2}^{*}{t_{s}}}}{{{T_{s}}}}}\right)}\right)-\left({n_{2}^{*}{t_{s}}+{T_{s}}}\right)\left({n_{2}^{*}{t_{s}}}\right)\ln{\cal A}={{\hat{m}}^{2}}{T_{s}}, (99)

where 𝒜=k=1Lpn^2,kpn^2,1{\cal A}=\sum\limits_{k=1}^{L}{\frac{{{p_{\hat{n}_{2}^{*},k}}}}{{{p_{\hat{n}_{2}^{*},1}}}}}. Similar to (86)-(91), we also can solve n2n_{2}^{*}. For clarity, [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} can be summarized in (69), where

γ^=2ln𝒜+m^2Ts6,\displaystyle\hat{\gamma}=2\ln{\cal A}+\frac{{{{\hat{m}}^{2}}}}{{{T_{s}}}}-6,
s^i=(81ln𝒜+27m^22Tsln𝒜)+(1)i19Δ^12(ln𝒜)2,i=1,2.\displaystyle{{\hat{s}}_{i}}=-\left({\frac{{81}}{{\ln{\cal A}}}+\frac{{27{{\hat{m}}^{2}}}}{{2{T_{s}}\ln{\cal A}}}}\right)+{\left({-1}\right)^{i-1}}\frac{{\sqrt{9{{\hat{\Delta}}_{1}}}}}{{2{{\left({\ln{\cal A}}\right)}^{2}}}},i=1,2.

Besides, Δ^1{{\hat{\Delta}}_{1}} and Δ^2{{\hat{\Delta}}_{2}} denote the discriminant of the cubic and quadratic equations generated from (99), respectively, expressed as

Δ^1=(ln𝒜)2((3γ^18m^2Ts)2(12γ^ln𝒜36)(γ^218m^2lnγ^Ts)),\displaystyle{{\hat{\Delta}}_{1}}={\left({\ln{\cal A}}\right)^{2}}\left({{{\left({3\hat{\gamma}-\frac{{18{{\hat{m}}^{2}}}}{{{T_{s}}}}}\right)}^{2}}-\left({\frac{{12\hat{\gamma}}}{{\ln{\cal A}}}-36}\right)\left({{{\hat{\gamma}}^{2}}-\frac{{18{{\hat{m}}^{2}}\ln\hat{\gamma}}}{{{T_{s}}}}}\right)}\right),
Δ^2=(m^2Ts6)2+4(ln𝒜)2(20m^2Ts+24)ln𝒜.\displaystyle{{\hat{\Delta}}_{2}}={\left({\frac{{{{\hat{m}}^{2}}}}{{{T_{s}}}}-6}\right)^{2}}+4{\left({\ln{\cal A}}\right)^{2}}-\left({\frac{{20{{\hat{m}}^{2}}}}{{{T_{s}}}}+24}\right)\ln{\cal A}.

At this point, the theoretical [n1,n2]{\left[{{n_{1}},{n_{2}}}\right]^{*}} has been derived, as shown in (61) and (69).

References

  • [1] V. Chamola, V. Hassija, V. Gupta, and M. Guizani, “A comprehensive review of the COVID-19 pandemic and the role of IoT, drones, AI, blockchain, and 5G in managing its impact,” IEEE Access, vol. 8, pp. 90 225–90 265, 2020.
  • [2] A. Roy, F. H. Kumbhar, H. S. Dhillon, N. Saxena, S. Y. Shin, and S. Singh, “Efficient monitoring and contact tracing for COVID-19: A smart IoT-based framework,” IEEE Internet Things Mag., vol. 3, no. 3, pp. 17–23, Sept. 2020.
  • [3] F. Al-Turjman and B. Deebak, “Privacy-aware energy-efficient framework using the Internet of Medical Things for COVID-19,” IEEE Internet Things Mag., vol. 3, no. 3, pp. 64–68, Sept. 2020.
  • [4] Z. Ning, P. Dong, X. Wang, X. Hu, L. Guo, B. Hu, Y. Guo, T. Qiu, and R. Y. K. Kwok, “Mobile edge computing enabled 5G health monitoring for Internet of Medical Things: A decentralized game theoretic approach,” IEEE J. Sel. Areas Commun., vol. 39, no. 2, pp. 463–478, Feb. 2021.
  • [5] I. F. Akyildiz, M. Pierobon, S. Balasubramaniam, and Y. Koucheryavy, “The Internet of Bio-Nano Things,” IEEE Commun. Mag., vol. 53, no. 3, pp. 32–40, Mar. 2015.
  • [6] B. Atakan, O. B. Akan, and S. Balasubramaniam, “Body area nanonetworks with molecular communications in nanomedicine,” IEEE Commun. Mag., vol. 50, no. 1, pp. 28–34, Jan. 2012.
  • [7] M. Kuscu and O. B. Akan, “The Internet of Molecular Things based on FRET,” IEEE Internet Things J., vol. 3, no. 1, pp. 4–17, Feb. 2016.
  • [8] N. Farsad, H. B. Yilmaz, A. Eckford, C.-B. Chae, and W. Guo, “A comprehensive survey of recent advancements in molecular communication,” IEEE Commun. Surveys Tuts., vol. 18, no. 3, pp. 1887–1919, thirdquarter 2016.
  • [9] T. Nakano, Y. Okaie, S. Kobayashi, T. Koujin, C.-H. Chan, Y.-H. Hsu, T. Obuchi, T. Hara, Y. Hiraoka, and T. Haraguchi, “Performance evaluation of leader-follower-based mobile molecular communication networks for target detection applications,” IEEE Trans. Commun., vol. 65, no. 2, pp. 663–676, Feb. 2017.
  • [10] Y. Chen, P. Kosmas, P. S. Anwar, and L. Huang, “A touch-communication framework for drug delivery based on a transient microbot system,” IEEE Trans. Nanobiosci., vol. 14, no. 4, pp. 397–408, June 2015.
  • [11] L. Felicetti, M. Femminella, and G. Reali, “A molecular communications system for live detection of hyperviscosity syndrome,” IEEE Trans. Nanobiosci., vol. 19, no. 3, pp. 410–421, July 2020.
  • [12] O. B. Akan, H. Ramezani, T. Khan, N. A. Abbasi, and M. Kuscu, “Fundamentals of molecular information and communication science,” Proc. IEEE, vol. 105, no. 2, pp. 306–318, Feb. 2017.
  • [13] T. Nakano, Y. Okaie, S. Kobayashi, T. Hara, Y. Hiraoka, and T. Haraguchi, “Methods and applications of mobile molecular communication,” Proc. IEEE, vol. 107, no. 7, pp. 1442–1456, July 2019.
  • [14] T. Nakano, S. Kobayashi, T. Suda, Y. Okaie, Y. Hiraoka, and T. Haraguchi, “Externally controllable molecular communication,” IEEE J. Sel. Areas Commun., vol. 32, no. 12, pp. 2417–2431, Dec. 2014.
  • [15] M. Khalid, O. Amin, S. Ahmed, B. Shihada, and M.-S. Alouini, “Modeling of viral aerosol transmission and detection,” IEEE Trans. Commun., vol. 68, no. 8, pp. 4859–4873, Aug. 2020.
  • [16] ——, “Communication through breath: Aerosol transmission,” IEEE Commun. Mag., vol. 57, no. 2, pp. 33–39, Feb. 2019.
  • [17] F. Gulec and B. Atakan, “A molecular communication perspective on airborne pathogen transmission and reception via droplets generated by coughing and sneezing,” IEEE Trans. Mol. Biol. Multi-Scale Commun., vol. 7, no. 3, pp. 175–184, Sept. 2021.
  • [18] ——, “A droplet-based signal reconstruction approach to channel modeling in molecular communication,” IEEE Trans. Mol. Biol. Multi-Scale Commun., vol. 7, no. 1, pp. 64–68, Mar. 2021.
  • [19] H. Arjmandi, A. Gohari, M. N. Kenari, and F. Bateni, “Diffusion-based nanonetworking: A new modulation technique and performance analysis,” IEEE Commun. Lett., vol. 17, no. 4, pp. 645–648, Apr. 2013.
  • [20] Y. Huang, M. Wen, L.-L. Yang, C.-B. Chae, and F. Ji, “Spatial modulation for molecular communication,” IEEE Trans. NanoBiosci., vol. 18, no. 3, pp. 381–395, July 2019.
  • [21] X. Chen, Y. Huang, L.-L. Yang, and M. Wen, “Generalized molecular-shift keying (GMoSK): Principles and performance analysis,” IEEE Trans. Mol. Biol. Multi-Scale Commun., vol. 6, no. 3, pp. 168–183, Sept. 2020.
  • [22] B. Tepekule, A. E. Pusane, M. S. Kuran, and T. Tugcu, “A novel pre-equalization method for molecular communication via diffusion in nanonetworks,” IEEE Commun. Lett., vol. 19, no. 8, pp. 1311–1314, Aug. 2015.
  • [23] Y. Huang, F. Ji, Z. Wei, M. Wen, X. Chen, Y. Tang, and W. Guo, “Frequency domain analysis and equalization for molecular communication,” IEEE Trans. Signal Process., vol. 69, pp. 1952–1967, Mar. 2021.
  • [24] B. Tepekule, A. E. Pusane, H. B. Yilmaz, C.-B. Chae, and T. Tugcu, “ISI mitigation techniques in molecular communication,” IEEE Trans. Mol. Biol. Multi-Scale Commun., vol. 1, no. 2, pp. 202–216, June 2015.
  • [25] H. ShahMohammadian, G. G. Messier, and S. Magierowski, “Nano-machine molecular communication over a moving propagation medium,” Nano Commun. Net., vol. 4, no. 3, pp. 142–153, Sept. 2013.
  • [26] A. Noel, K. C. Cheung, and R. Schober, “Optimal receiver design for diffusive molecular communication with flow and additive noise,” IEEE Trans. NanoBiosci., vol. 13, no. 3, pp. 350–362, Sept. 2014.
  • [27] M. Damrath and P. A. Hoeher, “Low-complexity adaptive threshold detection for molecular communication,” IEEE Trans. NanoBiosci., vol. 15, no. 3, pp. 200–208, Apr. 2016.
  • [28] B. C. Akdeniz, A. E. Pusane, and T. Tugcu, “Optimal reception delay in diffusion-based molecular communication,” IEEE Commun. Lett., vol. 22, no. 1, pp. 57–60, Jan. 2018.
  • [29] G. Ardeshiri, A. Jamshidi, and A. K.-Haddad, “Performance analysis of decode and forward relay network in diffusion based molecular communication,” in Proc. Iranian Conf. Electron. Eng. (ICEE), Tehran, Iran, May 2017, pp. 1992–1997.
  • [30] G. H. Alshammri, W. K. M. Ahmed, and V. B. Lawrence, “Synchronous cooperative relaying technique for three-dimensional diffusion-based molecular nano communication networks,” in Proc. Int. Conf. Nano/Mol. Med. Eng. (NANOMED), Hawaii, USA, Dec. 2018, pp. 154–159.
  • [31] T. N. Cao, N. Zlatanov, P. L. Yeoh, and J. S. Evans, “Optimal detection interval for absorbing receivers in molecular communication systems with interference,” IEEE Trans. Mol. Biol. Multi-Scale Commun., vol. 6, no. 3, pp. 184–198, Dec. 2020.
  • [32] G. D. Ntouni, V. M. Kapinas, and G. K. Karagiannidis, “On the optimal timing of detection in molecular communication systems,” in Proc. Int. Conf. Telecommun. (ICT), Limassol, Cyprus, May 2017, pp. 1–5.
  • [33] ——, “Optimization of the detection process timing in molecular communication systems with flow,” in Proc. Telecommun. Forum (TELFOR), Belgrade, Serbia, Nov. 2017, pp. 1–4.
  • [34] M. S. Kuran, H. B. Yilmaz, I. Demirkol, N. Farsad, and A. Goldsmith, “A survey on modulation techniques in molecular communication via diffusion,” IEEE Commun. Surveys Tuts., vol. 23, no. 1, pp. 7–28, firstquarter 2021.
  • [35] A. Noel, K. C. Cheung, and R. Schober, “Using dimensional analysis to assess scalability and accuracy in molecular communication,” in Proc. IEEE Int. Conf. Commun. Workshops (ICC), Budapest, Hungary, June 2013, pp. 818–823.