Processing math: 0%
ECP: A Probing-Based Error Control Strategy for THz-Based Nanonetworks With Energy Harvesting | IEEE Journals & Magazine | IEEE Xplore

ECP: A Probing-Based Error Control Strategy for THz-Based Nanonetworks With Energy Harvesting


In ECP mechanism, if nanonode wants to transmit data in a certain energy state such as {i}, data packet will be sent out only after the probing packet is transmitted succ...

Abstract:

Nanonetworks are comprised of the nano-sized communication devices that can perform simple tasks, such as computation, data storage, and actuation at the nanoscale. Howev...Show More
Topic: Protocols for Nanocommunication Networks

Abstract:

Nanonetworks are comprised of the nano-sized communication devices that can perform simple tasks, such as computation, data storage, and actuation at the nanoscale. However, the error-prone wireless links as a result of severe path loss in the terahertz band (0.1-10.0 THz) and very limited energy storage capacity in nanodevices are challenging the communication in the nanonetworks. Therefore, efficient and effective error control protocols are necessary for the nanonetworks in the THz band. In this paper, first, a novel error control strategy with probing (ECP) mechanism for the nanonetworks powered by energy harvesting is proposed. In particular, each data packet will be transmitted only after the successful communication of one probing packet. Second, the energy state model by considering the energy harvesting-consumption process is presented based on the extended Markov chain approach. Moreover, a probabilistic analysis of the overall network traffic and multiuser interference is used by the proposed energy state model to capture the dynamic network behavior. Third, the impact of the different packets energy of consumption on a state transition and the state probability distribution of nanonodes based on the above-mentioned model is comprehensively investigated. Finally, the performance of the ECP mechanism and the other four different error control strategies, namely, Automatic Repeat reQuest (ARQ), Forward Error Correction (FEC), Error Prevention Codes (EPC) and a hybrid EPC, in terms of the end-to-end successful packet delivery probability, end-to-end packet delay, achievable throughput, and energy consumption are investigated and evaluated. The results show that the proposed ECP mechanism can maximize the end-to-end successful data packet delivery probability than the other four error control schemes, increase the achievable throughput compared with ARQ and EPC schemes, and outperform the ARQ and FEC schemes in terms of energy utilization.
Topic: Protocols for Nanocommunication Networks
In ECP mechanism, if nanonode wants to transmit data in a certain energy state such as {i}, data packet will be sent out only after the probing packet is transmitted succ...
Published in: IEEE Access ( Volume: 7)
Page(s): 25616 - 25626
Date of Publication: 25 February 2019
Electronic ISSN: 2169-3536

Funding Agency:


SECTION I.

Introduction

Nanotechnology has been widely researched for the development of extremely small devices only capable of performing some simple actions (actuation, data storage and communication, etc.) at the nanoscale. More advanced nanodevices could be manufactured to fulfill complex tasks in a distributed manner by integrating several nanomachines into a single entity [1]. The size of the single nanodevice is about a few cubic micrometers [2], which contributes to its potential in many unprecedented applications. For example, there are many direct applications of nanotechnology in the biomedical field (e.g., drug delivery systems and cancer detection), in the environmental field (e.g., plants monitoring systems and biodegradation) and in the military field (e.g., biological, chemical defenses and nano-functionalized equipments) [1], [3]. To realize these applications and guarantee their performance, the energy consumption, data processing and communication problems in the nanodevices are required to be considered comprehensively.

Recently, THz band has been recommended as the frequency band of communication for nanodevices due to the recent development in the area of graphene-based nanoelectronics [4], [5]. The available bandwidth of THz band ranges from several tens of GHz up to a few THz. However, it has a very high propagation loss due to the atmospheric absorption mainly caused by water vapor molecules [6], which results in a very limited communication distance [7]. Some research on graphene-based nano-transceivers [8], [9] and nano-antennas [5], [10] show that THz band as the communication frequency band for nanodevices is a great choice.

As a result, the limited capabilities of a single nanodevice and the THz band channel behavior easily lead to error-prone wireless links in nanonetworks. To design a proper error control mechanism for nanonetworks becomes stringent. The existing error control mechanisms for traditional wireless networks can be classified into three main approaches, i.e., Automatic Repeat reQuest (ARQ), Forward Error Correction (FEC) and Hybrid Automatic Repeat reQuest (HARQ) [11], which are described as follows [12]–​[14]:

  • Automatic Repeat reQuest (ARQ): In ARQ-based error control schemes, retransmission has a main impact on recovering the lost data packets. The ARQ schemes achieve retransmissions of failed packets by transmitting explicit acknowledgements. Obviously, ARQ schemes incur a significant amount of additional retransmission cost in case of errors. In addition to the overhead and delay resulted from retransmissions, harvesting energy for retransmissions is another challenging task. On the other hand, overhead of ARQ schemes is lower than FEC protocols when the channel condition is good, since it does not have frequent retransmissions and has no need to add redundancy to the transmitted packets.

  • Forward Error Correction (FEC): When using FEC-based error control techniques, some redundant bits are added to the transmitted packets so that the receiver can recover the original bits even if the limited number of bits are received in error. Compared with the ARQ-based techniques, FEC-based techniques require more complex computational capability and sacrifice data rates for coding appendant, although they increase the communication distance and improve the error resiliency of communication.

  • Hybrid Automatic Repeat reQuset (HARQ): HARQ error control techniques combine the benefits of ARQ and FEC techniques, aiming to increase the error resiliency while reducing the number of retransmissions. There are mainly two types in HARQ techniques. For the HARQ-I (known as the Chase combining) technique, the transmitter sends a packet coded with a low error correction capability to the receiver firstly. In case of the reception of a NAK signal, the transmitter resends the same coded packet again. In the HARQ-II (referred to the incremental redundancy) technique, the transmitter constructs and resends different packets coded with a more powerful FEC code when a NAK is received. In general, the failed packets both in HARQ-I and HARQ-II are stored in the buffer firstly, and then a retransmission is request. By contrast, HARQ-I can improve the link performance through combining multiple copies of the received packet, and HARQ-II can take advantage of the different coded versions of retransmitted packets jointly to form a lower-rate code with stronger error protection capabilities.

As described above, traditional ARQ, FEC and HARQ techniques cannot be directly applied in nanonetworks because of the very limited computational capability and energy storage capacity of nanodevices. However, the ECP mechanism we proposed is based on the traditional ARQ protocol, which considers comprehensively the peculiarities of nanonetworks in energy and computation.

In this paper, we propose a novel error control mechanism by considering the trade-off between energy harvesting and consumption for perpetual nanonetworks. The main contributions of this paper are summarized as follows:

  1. A novel error control mechanism with probing for nanonetworks powered by energy harvesting is proposed. In particular, before starting data transmission, one probing packet is sent out to detect the channel status. Consequently, the corresponding feedback of probing packet decides whether the data packet will be transmitted.

  2. Energy state model of ECP mechanism by considering the energy harvesting-consumption process is presented based on the extended Markov chain model. Moreover, the proposed model captures the dynamic network behavior through a probabilistic analysis of the total network traffic and the multiuser interference in the THz nanonetworks. The impact of different packets energy consumption on state transition and the probability distribution of every transmission state are investigated.

  3. The energy state model is validated by means of simulation and we numerically study the data packet size for ECP mechanism and other four error control techniques (ARQ, FEC, EPC and HEPC) and compare the performance of them under different parameters. Performance analysis shows that ECP mechanism outperforms traditional error control schemes such as ARQ and FEC in terms of end-to-end successful packet delivery probability and energy savings while increases the end-to-end packet delay.

The rest of the paper is organized as follows. In Section II, existing related works in nanonetworks are reviewed. Section III presents the proposed ECP mechanism and corresponding energy state model. In Section IV, the energy state model is validated by simulation and ECP mechanism is evaluated. Finally, this paper is concluded in Section V.

SECTION II.

Related Work

Despite the existence of many studies on error control techniques for traditional wireless networks, none of them can be directly applicable to the nanonetworks because of the very limited capabilities of nanodevices and the channel behavior of THz band, which are easy to lead to error-prone wireless links. The objective of this paper is to propose a novel error control mechanism that comprehensively considers the energy harvesting and consumption process of nanonodes. Without loss of generality, the main relevant works are discussed next.

A. Existing Work on Error Control in Nanonetworks

Recently, there have been some work on error control for nanonetworks. In detail, a new error control strategy for electromagnetic nanonetworks is proposed in [15]. This strategy is intended to prevent channel errors by utilizing low-weight channel codes. The results of this work reveal that the Codeword Error Rate is reduced through the utilization of low-weight channel codes while the achievable information rate does not decrease or even increase it. Furthermore, an optimal code weight is found, which can maximize the information rate. In [16], the authors explored the optimal coding design for transmission energy minimization (MTE) in nanonetworks and developed the corresponding solutions by considering code rate constraint and codeword length constraint. The simulation results show that MTE coding can decrease the transmission energy consumption in nanonetworks while guaranteeing an acceptable code rate. In addition, a cross-layer analysis of error control strategies for nanonetworks in the THz band is presented in [12]. Moreover, the BER, PER, energy consumption and delay of five different error control schemes, i.e., ARQ, FEC, two types of EPC (constant low-weight channel codes [15] and variable low-weight channel codes [16]) and a hybrid EPC (HEPC), which combines both FEC and EPC, are analyzed. It is shown that EPCs achieve better performance than traditional ARQ and FEC strategies, such as improving the error correction, saving more energy and reducing the delay. Alternatively, in [17], the authors addressed the link throughput maximization problem by considering the peculiarities of nanosensors and the optimal data packet size which maximizes the link efficiency is investigated. Especially, the impact of the optimal packet size for three different error control strategies (ARQ, FEC and EPC) are analyzed. The results show that EPC has a better link throughput efficiency performance in short range communications and low energy harvesting compared to the other two error control techniques. However, for the above existing work on error control, on the one hand, they either do not consider the energy harvesting-consumption process or have no realize the temporary feature of energy, i.e., the process of energy harvesting-consumption is dynamic. On the other hand, the channel condition is unknown before the data packet is transmitted and the impact of different packets transmission on energy status of nanonode has not been investigated. Note that, in the simulations and performance evaluation, we use the traditional ARQ and FEC schemes as well as the new EPC schemes with constant low-weight channel codes [15] and a hybrid EPC which combines both FEC and EPC [12].

B. Energy Harvesting With Piezoelectric Nanogenerator

It is highly desirable that nanodevices are enabled to be self-powered without the use of nanobatteries. However, traditional energy harvesting mechanisms, e.g., solar energy, wind power, or underwater turbulence [18], [19], cannot be utilized in nanonetworks. In the recent years, some methods of converting mechanical energy into electrical energy have been explored [20], [21], such as Zinc Oxide nanogenerators by using the piezoelectric effect. The energy harvested from the external environment is usually sufficient to power the communication of nanodevices, especially over a short distance.

According to the prototype design and the corresponding circuit model of piezoelectric nanogenerators in [22] and [23], the harvested energy can be stored in the nanocapacitor of nanodevices. In general, the maximum energy E_{max} can be calculated as a function of the total capacitance C_{cap} and the generator voltage V_{g} [24], i.e., \begin{equation*} E_{max}={\mathrm{ max}}\left\{{\frac {1}{2}C_{cap}(V_{cap}(n_{cyc}))^{2}}\right\}=\frac {1}{2}C_{cap}V_{g}^{2}. \tag{1}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Finally, the energy harvesting rate at the nanocapacitor can be given in Joule/second as follows:\begin{align*} \lambda _{harv}(E_{curr},\Delta E)=\left({\frac {n_{cyc}}{t_{cyc}}}\right)\frac {\Delta E}{n_{cyc}(E_{curr}+ \Delta E)-n_{cyc}(E_{curr})}. \\ {}\tag{2}\end{align*} View SourceRight-click on figure for MathML and additional features. where E_{curr} is the current energy in the nanocapacitor, \Delta E refers to the energy increment of the capacitor, t_{cyc} is the time between consecutive cycles. n_{cyc} is the number of cycles that needed to charge the nanocapacitor up to an energy value E_{curr} . Our starting point for energy harvesting in our analysis is the energy model introduced in [24], which can clearly reproduce energy harvesting-consumption process.

C. Energy Consumption in Pulse-Based Nanonetworks Communication

Due to the constrained energy in nanodevices, short pulses cannot be emitted in a burst. Hence, new information encoding and modulation mechanisms for nanonetworks are required urgently. Furthermore, in order to take advantage of the large bandwidth of THz band, pulse-based communication paradigm (such as TS-OOK) has been recommended in [25], which is based on the exchange of very short pulses spread in time. In detail, a logical “1” is transmitted by a short pulse (one-hundred-femtoseconds) and a logical “0” is transmitted as silence, i.e., nanodevices remain silent when a logical “0” is transmitted.

In order to evaluate the consumed energy in the transmission and reception of one packet, without loss of generality, it is assumed that the length of one packet is N_{bits}^{y} , and the consumed energy in the transmission and reception of one pulse are E_{pul-t} and E_{pul-r} , respectively. Consequently, the consumed energy for transmitting and receiving one packet can be given by [24] \begin{align*} & E_{tx}^{y} = N_{bits}^{y}W_{y}E_{pul-t}, \\ & E_{rx}^{y} = N_{bits}^{y}E_{pul-r}, \tag{3}\end{align*} View SourceRight-click on figure for MathML and additional features. where y=p or y=d stands for the calculation of one probing packet and one data packet, respectively. W_{y} refers to the coding weight, which is adaptive to different coding algorithms or parameter optimizations [26].

SECTION III.

ECP: Error Control With Probing

In this section, a detailed description of the proposed error control mechanism ECP and its corresponding energy state model are presented. Through the energy state model, the trade-off between energy harvesting and energy consumption can be investigated comprehensively. Alternatively, the overall network performance is captured successfully by considering the total network traffic and the multiuser interference. Especially, a mathematical framework is developed and used for the steady-state analysis of the model.

A. Error Control Mechanism

In this section, energy state model of the proposed ECP mechanism by considering the energy harvesting-consumption process based on extended Markov chain approach is shown in Fig. 1. The associated notations in Fig. 1 are listed in TABLE 1. Each state in the model corresponds to an energy state of nanonode. The red dashed box in Fig. 1(a) refers to a set of states that the nanonode works in the probing mode, which is shown comprehensively in Fig. 1(b). The solid lines represent the energy harvesting process while the other lines represent the energy consumption process. The short dashed lines represent the energy consumption processes of sending one data packet, which is denoted as \lambda _{tx} . The dash-dotted lines represent the energy consumption processes of receiving one data packet or one probing packet (In this paper, we assume the energy consumption of receiving one data packet and one probing packet is identical), which is denoted as \lambda _{rx} . The double dash-dotted lines represent the energy consumption processes of sending one probing packet, which is denoted as \lambda _{px} . The detailed operations of the proposed ECP for electromagnetic nanonetworks are conducted as follows:

TABLE 1 Notations of the Symbols in Fig.1
Table 1- 
Notations of the Symbols in Fig.1
FIGURE 1. - Energy state model of the ECP mechanism with the extended Markov chain. (a) The general process of energy state model in ECP mechanism. (b) Energy state model of probing mode in ECP mechanism.
FIGURE 1.

Energy state model of the ECP mechanism with the extended Markov chain. (a) The general process of energy state model in ECP mechanism. (b) Energy state model of probing mode in ECP mechanism.

In order to increase the successful transmission probability of data packets and reduce the energy consumption of communication, the proposed ECP divides all energy states into two parts as shown in Fig. 1. On the one hand, each nanonode will keep harvesting energy and enter the probing mode only as its energy value is beyond the probing mode energy threshold \delta , which is defined in TABLE 1. On the other hand, in the probing mode, one probing packet will be transmitted to detect the channel condition at first. Data packet will be sent out only after the probing packet is transmitted successfully.

In general, two conditions in the energy state model are considered. The first condition is that nanonode only keeps harvesting energy without transmitting or receiving any packet from the initial energy state \{E_{0}\} to the saturated energy state \{E_{max}\} . The second condition is that nanonode needs to transmit or receive data packets while harvesting energy. More specifically, there are two modes in the second condition as follows:

  • Mode 1 (General Mode): From the beginning of initial energy state \{E_{0}\} , nanonode captures energy and receives packets (when necessary) rather than transmits any packet until it reaches the maximum energy E_{max} and enters the saturated energy state \{E_{max}\} . Moreover, the nanonode will not receive packets until the energy is beyond the data receiving energy threshold \tau .

  • Mode 2 (Probing Mode): While harvesting energy, nanonode needs to transmit data packets as well. If nanonode wants to transmit data in a certain state such as \{E_{PP}+{E_{PE}}\} . Firstly, its stored energy has to reach the energy threshold \delta of probing mode. After sending out one probing packet, nanonode consumes the energy E_{PE} and enters into the energy state \{E_{PP}\} . According to the received feedback from the receiver after the probing packet transmitted, there are two cases:

    1. Case 1: If the feedback of probing packet is a negative acknowledgment (NAK) or timeout, i.e., the channel is in bad condition, and nanonode needs to retransmit the probing packet. It is worth to note that nanonode has to determine whether its current energy reaches the energy threshold \delta before detecting the channel by using the probing packet. As the energy is sufficient for channel detection, the probing packet will be sent out. The probing process continues until an ACK is received or its maximum number of retransmission is reached. Otherwise, the nanonode needs to harvest energy until the energy threshold \delta , and then channel detection is performed again.

    2. Case 2: If the feedback of probing packet is an active acknowledgment (ACK) and the energy of nanonode is beyond the energy threshold \gamma , then one data packet will be transmitted. This process will consume the energy E_{PT} , and let the nanonode move to the state \{E_{PP}-E_{PT}\} . For the feedback of the data packet, if it is an ACK, i.e., the data packet is transmitted successfully, the nanonode can start a new data transmission or end. If it is a NAK, the nanonode will enter into the probing mode again, until the data packet is transmitted successfully or its maximum number of retransmission is reached.

A schematic diagram of data transmission process in ECP mechanism is shown in Fig. 2. Note that nanonode keeps harvesting energy in the whole process and time synchronization is needed to maintain the time consistency during network operation. In addition, before entering the probing mode, i.e., energy state is up on \{E_{PT}+E_{PE}\} , nanonode will not transmit any probing packet and data packet. The reason is that it is useless to transmit packets if the nanonode does not have enough energy to complete the data transmission. For example, in case of the energy stored in nanonode is enough to transmit one probing packet and an ACK of the probing packet is received successfully. If the remaining energy of nanonode for transmitting one data packet is insufficient and the energy-harvesting rate is very low, it needs to take a long time to harvest energy until reaching \gamma before the data packet is transmitted. However, the channel condition at the moment may have changed. Therefore, we consider that the nanonode transmits one data packet only after it has enough energy, i.e., its energy has to reach the energy threshold \delta . Note that the current energy of nanonode can be estimated by some energy detection methods/algorithms and the value of energy threshold in TABLE 1 can be calculated by (3).

FIGURE 2. - A schematic diagram of ECP mechanism (
$k^{*}$
 and 
$K^{*}$
 are the retransmission counter of one probing packet and one data packet, respectively).
FIGURE 2.

A schematic diagram of ECP mechanism (k^{*} and K^{*} are the retransmission counter of one probing packet and one data packet, respectively).

B. Energy State Model of ECP Mechanism

The energy distribution of nanonode can be modeled as an extended Markov process \varphi (t) . Due to the bad channel condition or limited transmission power, packet retransmission is required as a result of unsuccessful data transmission or reception. The process \varphi (t) is represented by the Markov chain in Fig. 1, which is fully characterized by its transition rate matrix \pmb {Q} in (4), as shown at the top of this page.

In this section, we consider the behavior of the system in the steady state. Hence, the matrix \pmb {Q} is provided in the steady state too. The number of the energy states in Fig. 1 is m=\lfloor (E_{max}-E_{0})/E_{rx}^{d}\rfloor and \pmb {Q} is a m*m dimensional matrix. Each element in \pmb {Q} , e.g., q_{ij} refers to the rate of the transition from state i to state j , and q_{ii}=-q_{i}=-\sum _{i \ne j}q_{ij} . The state probability vector is defined as \pmb {\pi } =(\pi _{E_{0}},\pi _{E_{PR}},\ldots,\pi _{E_{max}}) , where \pi _{n} refers to the probability of state n in the steady state. In order to determine the parameters in matrix \pmb {Q} , some definitions are necessary, and given as follows.

Firstly, to determine the probing packet transmission rate \lambda _{px} , the data packet transmission rate \lambda _{tx} and the data packet reception rate \lambda _{rx} , the following conditions need to be satisfied.

  1. One data packet cannot be transmitted if the energy level of the transmitting nanonode is lower than E_{PT} , e.g., E_{0}, \ldots, E_{PT}-E_{PR} , this probability can be given by \begin{equation*} P_{drop-t}^{d}=\sum _{i=E_{0}}^{E_{PT}-E_{PR}} \pi _{i}. \tag{5}\end{equation*} View SourceRight-click on figure for MathML and additional features.

  2. One packet cannot be received if the energy state of nanonode is \{E_{0}\} , this probability can be written as \begin{equation*} P_{drop-r}^{y}=\pi _{E_{0}}. \tag{6}\end{equation*} View SourceRight-click on figure for MathML and additional features. where y = p or y = d stands for the calculation of the probability of channel error for one probing packet and one data packet, respectively.

  3. One packet will not be received successfully if there are errors during the transmission in the channel. This probability is obtained by \begin{equation*} P_{error}^{y}=1-(1-BER)^{N_{bits}^{y}}. \tag{7}\end{equation*} View SourceRight-click on figure for MathML and additional features. where N_{bits}^{y} is the packet length in bits and BER refers to the bit error rate.

  4. The packet collision probability can be calculated as a function of the network traffic \lambda _{net}^{y} , the coding weight W_{y} , the pulse duration time T_{p} and the packet length N_{bits}^{y} . This probability is \begin{equation*} P_{coll}^{y}=1-e^{-\lambda _{net}^{y}W_{y}T_{p}N_{bits}^{y}}. \tag{8}\end{equation*} View SourceRight-click on figure for MathML and additional features.

  5. One probing packet will not be transmitted before the energy stored in nanonode reaches the energy threshold \delta of probing mode. Hence, the probability can be written as \begin{equation*} P_{energy}=\sum _{i=E_{0}}^{\delta -E_{PR}}\pi _{i}. \tag{9}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Based on above analysis, the successful transmission probability of one probing packet can be given as follow:\begin{align*} P_{succ}^{p} &=(1-P_{energy})(1-P_{drop-r}^{p})(1-P_{error}^{p})(1-P_{coll}^{p}). \\ {}\tag{10}\end{align*} View SourceRight-click on figure for MathML and additional features.

Similarly, the successful transmission probability of both one probing packet and one data packet can be obtained by:\begin{equation*} P_{succ} =P_{succ}^{p}(1-P_{drop-r}^{d})(1-P_{error}^{d})(1-P_{coll}^{d}).\quad \tag{11}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The network traffic rate of probing packet \lambda _{net}^{p} between two neighboring nanonodes is defined by:\begin{align*} \lambda _{net}^{p}=&\sum _{i=0}^{k}(\lambda _{p}+\lambda _{n})(1-P_{energy})(1-P_{succ}^{p})^{i} \\=&(M+1)\lambda _{p}(1-P_{energy})\frac {1-(1-P_{succ}^{p})^{k\!+\!1}}{P_{succ}^{p}}.\quad \tag{12}\end{align*} View SourceRight-click on figure for MathML and additional features. where \lambda _{p} is the probing packet generation rate, k is the probing packet maximum number of retransmission, \lambda _{n} is the traffic from neighbor nanonodes and we assume that \lambda _{n} = M\lambda _{p} , where M is the number of neighbor nanonodes.

Similarly, the network traffic rate \lambda _{net}^{d} of data packets between two neighboring nanonodes is given by:\begin{equation*} \lambda _{net}^{d} =(M+1)\lambda _{d}P_{succ}^{p}\frac {1-(1-P_{succ}^{d})^{K+1}}{P_{succ}^{d}}.\tag{13}\end{equation*} View SourceRight-click on figure for MathML and additional features. where \lambda _{d} is the data packet generation rate. K is the data packet maximum number of retransmission.

After one probing packet is transmitted successfully, the successful transmission probability of one data packet can be obtained by:\begin{equation*} P_{succ}^{d} =\frac {P_{succ}}{P_{succ}^{p}}.\tag{14}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Then, the transmission rate \lambda _{tx} and the reception rate \lambda _{rx} of one data packet as well as the transmission rate \lambda _{px} of one probing packet can be written as \begin{align*} & \lambda _{tx} = \lambda _{d}\frac {1-(1-P_{succ}^{d})^{K+1}}{P_{succ}^{d}}, \\ & \lambda _{rx} = {\lambda _{net}^{d}}{P_{succ}^{p}}(1-P_{drop-r}^{d}), \\ & \lambda _{px} = \lambda _{p}\frac {1-(1-P_{succ}^{p})^{K+1}}{P_{succ}^{p}}, \tag{15}\end{align*} View SourceRight-click on figure for MathML and additional features. where \lambda _{p} and \lambda _{d} are the probing and data packet generation rate respectively. Note that the receiver counts only the packets that are not dropped in reception, and the transmitter only transmit the packets that it generates as well as it has received without errors and collision.

Finally, as shown in Fig. 1, the transition from energy state i to state i+1 happens based on the data packet energy harvesting rate \lambda _{e}^{i} in energy-pakcet/second, the value of \lambda _{e}^{i} can be obtained as a function of the energy in the current state E_{curr}^{i} and the energy required to receive one data packet E_{rx}^{d} [24]:\begin{equation*} \lambda _{e}^{i}=\frac {\lambda _{harv}(E_{curr}^{i},E_{rx}^{d})}{E_{rx}^{d}}. \tag{16}\end{equation*} View SourceRight-click on figure for MathML and additional features. Note that the value of \lambda _{e}^{i} is changed because of the nonlinearities in the energy harvesting process of nanonodes. The energy of current state is obtained by:\begin{equation*} E_{curr}^{i}=E_{0}+(i-1)E_{PR}. \tag{17}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Up to this point, all the terms in matrix \textit {Q} can be obtained. The steady state probability can be determined by the transition rate matrix \textit {Q} and the state probability vector \pmb {\pi } as follow:\begin{equation*} \begin{cases} {\pi} Q = 0,\\ \displaystyle \sum \limits _{i\in I}\pi _{i}= 1,\pi _{i}\ge 0, \end{cases} \tag{18}\end{equation*} View SourceRight-click on figure for MathML and additional features. where I=(E_{0},E_{PR},\ldots,E_{max}) .

Moreover, the probability mass function (p.m.f.) of the nanonodes energy in the steady state can be computed as a function of the state probability vector \pmb {\pi } [24]:\begin{equation*} P_{f}(i)= \pi _{i}. \tag{19}\end{equation*} View SourceRight-click on figure for MathML and additional features. where i\in (E_{0},E_{PR},\ldots,E_{max}) . i.e., the probability that nanonodes have an energy exactly equal to i is \pi _{i} .

By the utilization of the above mathematical framework, the effect of different system parameters on the network performance can be numerically investigated.

SECTION IV.

Simulations and Performance Analysis

In this section, first, in order to validate the energy state model and evaluate the performance of ECP mechanism for nanonetworks, MATLAB is used to conduct the simulation for nanonetworks composed by one hundred randomly deployed nanonodes, which transmit packets in multi-hop fashion. The density of active nanonodes is equal to 1 node/cm2. Each nanonode harvests vibrational energy by means of a piezoelectric nanogenerator with the parameters in TABLE 2. The nanobattery is fully discharged at the beginning of the simulation. Nanonodes broadcast packets to the neighboring nanonodes by means of TS-OOK. Then, the energy state model is used to investigate the impact of energy on four different common metrics in nanonetworks and we compare the performance of ECP mechanism with other four different error control techniques (ARQ, FEC, EPC and HEPC). More specifically, a 16-bit CRC is used for error detection in ECP and ARQ with a 30 bits long acknowledgement packet. For the FEC and EPC, a Hamming(15,11) code and a 12-bit low-weight code with codeword size of 15 bits are assumed respectively, and for HEPC, the code distance D_{c} is set to 3. The probability of transmitting a pulse for ARQ, ECP and FEC is 0.5, for EPC is 0.31 and for HEPC is 0.06. Note that the average energy harvesting rate of nanonode is calculated and used in the simulations. The calculation of some other parameters about the five error-control methods can be found in [12], [17], and [24]. The parameters used in the simulations are listed in TABLE 2.

TABLE 2 Parameters in the Simulations
Table 2- 
Parameters in the Simulations

A. Validate the Energy State Model of ECP

To validate the impact of our proposed ECP mechanism on network performance. Firstly, we consider that packet generation rate of nanonodes follows a Poisson distribution and can be obtained by \lambda _{y}=\lambda _{info}/N_{bits}^{y} , where \lambda _{info} accounts for information generation rate and N_{bits}^{y} is the packet length. The separation between symbols (pulses or silences) is of 100 ps. Note that the normalized histogram of the nanonode energy state evolution over time in the simulation is calculated by Markov Chain Monte Carlo method (MCMC) and is compared with the p.m.f. P_{f} in (19), obtained from the proposed energy state model. Then, the probability distribution histogram of the energy state model by simulation and numeral calculations is presented. Fifty-nine hours long simulations is spent to compute the histogram in Fig. 3 and Fig. 4. We discarded the initial samples of each run and only consider the steady state of the network. The results are shown for different information generation rates \lambda _{info} and bit error rates BER . As can be observed, the simulation results and the numerical results are matched accurately in the steady state. Moreover, it is clear that for high information generation rates or bit error rates, e.g., 9 bits/s or 10−2, the center of the probability distribution is around the lower energy states, i.e., the nanonode lacks of enough energy in most cases. As the information generation rate or bit error rate is decreased, the center of the probability distribution shifts toward the higher energy states.

FIGURE 3. - Probability mass function 
$p(i)$
 of the nanonode energy in (19) as a function of the energy state 
$\{i\}$
 for different information generation rates 
$\lambda _{info}$
 (
$BER=10^{-4}$
). (a) 
$\lambda _{info}=9$
 bits/s. (b) 
$\lambda _{info}=7$
 bits/s. (c) 
$\lambda _{info}=5$
 bits/s.
FIGURE 3.

Probability mass function p(i) of the nanonode energy in (19) as a function of the energy state \{i\} for different information generation rates \lambda _{info} (BER=10^{-4} ). (a) \lambda _{info}=9 bits/s. (b) \lambda _{info}=7 bits/s. (c) \lambda _{info}=5 bits/s.

FIGURE 4. - Probability mass function 
$p(i)$
 of the nanonode energy in (19) as a function of the energy state 
$\{i\}$
 for different bit error rates 
$BER$
 (
$\lambda _{info}=7$
 bits/s). (a) 
$BER = 10^{-2}$
. (b) 
$BER = 10^{-4}$
. (c) 
$BER = 10^{-6}$
.
FIGURE 4.

Probability mass function p(i) of the nanonode energy in (19) as a function of the energy state \{i\} for different bit error rates BER (\lambda _{info}=7 bits/s). (a) BER = 10^{-2} . (b) BER = 10^{-4} . (c) BER = 10^{-6} .

B. Successful Packet Delivery Probability

The end-to-end successful packet delivery probability is investigated as the first performance metric in nanonetworks, which can be defined as \begin{equation*} P_{succ-e2e}^{ECP} = (1-(1-P_{succ})^{K+1})^{N_{hop}}. \tag{20}\end{equation*} View SourceRight-click on figure for MathML and additional features. where N_{hop} is the total number of hops. The end-to-end successful data packet delivery probability, P_{d-succ-e2e}^{ECP} , can be obtained by replacing P_{succ} in (20) with P_{succ}^{d} in (14). The end-to-end successful packet delivery probability, P_{succ-e2e} , for ECP mechanism and other four different error control strategies as well as the end-to-end successful data packet delivery probability of ECP, P_{d-succ-e2e}^{ECP} , are shown in Fig. 5 as a function of the data packet size N_{bits}^{d} . From the results, firstly, it is shown that the value of P_{succ-e2e}^{ECP} and P_{d-succ-e2e}^{ECP} are significantly higher than the other three error control techniques (ARQ, FEC and EPC). The reason is that in ECP mechanism, one data packet will be transmitted only after one probing packet is transmitted successfully, which improves the successful transmission probability of the data packet by detecting the condition of channel. In addition, the size of probing packet is smaller than data packet, so it has a higher probability to be transmitted successfully. Secondly, as the data packet size increases, the end-to-end successful packet delivery probability of all error control strategies are decreased, mainly because the transmission of longer packet increases the probability of channel transmission errors and collision with the transmissions from other nanonodes given by (7) and (8). Finally, from the Fig. 5, we can find that the successful data packet delivery probability for ECP mechanism, P_{d-succ-e2e}^{ECP} , is significantly improved compared to the other four schemes.

FIGURE 5. - End-to-end successful packet delivery probability for ECP mechanism (dashed lines) and other four error control strategies (solid lines).
FIGURE 5.

End-to-end successful packet delivery probability for ECP mechanism (dashed lines) and other four error control strategies (solid lines).

C. Delay

The end-to-end packet delay is investigated as the second performance metric in nanonetworks, which is computed as \begin{align*} {T_{e2e}^{ECP}}=&N_{hop}\big (\sum _{i=0}^{k}(2T_{prop}+T_{data}^{p}+T_{code}^{p}+T_{decode}^{p}+iT_{t/o}^{p}) \\&+\,P_{succ}^{p}\sum _{j=0}^{K}(2T_{prop}+T_{data}^{d}+T_{code}^{d} \\&+\,T_{decode}^{d}+jT_{t/o}^{d})\big). \tag{21}\end{align*} View SourceRight-click on figure for MathML and additional features. where T_{prop} is the propagation time. For y=p , f or d , T_{data}^{y} stands for the different packet transmission time of one probing packet, one feedback packet and one data packet, respectively, which can be directly obtained from the physical-layer data-rate. T_{t/o}^{p} and T_{t/o}^{d} stand for the time out of one probing packet and one data packet, respectively. The calculations of T_{t/o}^{d} is similar to T_{t/o}^{p} , and T_{t/o}^{p} is defined as follows:\begin{align*} T_{t/o}^{p}=&P_{energy}T_{t}^{e}+(1-P_{energy})\Big (P_{drop-r}^{p}T_{r}^{p} \\&+\,(1-P_{drop-r}^{p})\big (1\!-\!(1\!-\!P_{error}^{p})(1\!-\!P_{coll}^{p})\big)T_{o}\Big).\qquad ~ \tag{22}\end{align*} View SourceRight-click on figure for MathML and additional features. where T_{t}^{e} and T_{r}^{p} are the average time needed to harvest enough energy to reach energy threshold \delta of probing mode and receive one probing packet, respectively, and are given by:\begin{align*} & T_{t}^{e} = \sum _{i=E_{0}}^{\delta -E_{PR}}\pi _{i}/q_{i}, \\ & T_{r}^{p} = \pi _{E_{0}}/q_{E_{0}}, \tag{23}\end{align*} View SourceRight-click on figure for MathML and additional features. where q_{E_{0}} is the opposite number of the first element in the transition rate matrix \textit {Q} , i.e., \lambda _{e} . T_{o} is a random back-off time before retransmitting when the packets cannot be received correctly due to the channel errors or collisions. The coding time, T_{code}^{y} , introduced by the computation of a 16-bit CRC is given by [12] \begin{equation*} T_{code}^{y}=N_{bits}^{y}T_{cyc}. \tag{24}\end{equation*} View SourceRight-click on figure for MathML and additional features. where T_{cyc} is the inverse of the clock at the nanomachine. In this paper, we consider that the decoding time T_{decode}^{y} is equal to the coding time T_{code}^{y} .

The end-to-end packet delay, given by (21), as a function of data packet size is shown in Fig. 6 for five different error-control methods. As it can be seen, T_{e2e}^{ECP} is higher than other four error control schemes, i.e., ECP mechanism needs more time than the other four error control techniques when one data packet is transmitted from the transmitter to the receiver successfully. This is mainly because ECP needs to transmit a probing packet firstly, which adds extra delay but improves successful data packet delivery probability. Moreover, as the data packet size increases, the end-to-end packet delay for FEC, EPC and HEPC are increased significantly, but for ECP and ARQ are increased slightly. The reason is that in ECP and ARQ strategies, if the retransmission is needed due to the lack of energy at the transmitter or the receiver, the delay is determined by the necessary waiting time T_{t/o}^{p} which is the time to recharge the energy system up to the threshold \delta for ECP and E_{PT} for ARQ. On the other hand, FEC, EPC and HEPC can save much time because they do not need to spend a lot of time waiting to harvesting enough energy to perform retransmission, especially when the energy harvesting rate is low.

FIGURE 6. - End-to-end packet delay for ECP mechanism (dashed lines) and other four error control strategies (solid lines).
FIGURE 6.

End-to-end packet delay for ECP mechanism (dashed lines) and other four error control strategies (solid lines).

D. Throughput

The throughput is investigated as the third performance metric in nanonetworks, which can be defined as \begin{equation*} th_{put}^{ECP} = \frac {P_{succ-e2e}^{ECP} \cdot N_{data}^{d}}{T_{e2e}^{ECP}}. \tag{25}\end{equation*} View SourceRight-click on figure for MathML and additional features. where N_{data}^{d} is the number of data bits per data packet. The performance of throughput in nanonetworks with the proposed ECP mechanism, given by (25), and other four error-control methods are evaluated in Fig. 7, which is illustrated as a function of the data packet size. As shown in the figure, the throughput th_{put}^{ECP} of ECP mechanism lower than FEC, th_{put}^{FEC} , and HEPC, th_{put}^{HEPC} , but higher than ARQ, th_{put}^{ARQ} , and EPC, th_{put}^{EPC} . The reason is that the probing mode has an significantly impact on the end-to-end successful packet delivery probability and the end-to-end packet delay, which improves P_{succ-e2e}^{ECP} and P_{d-succ-e2e}^{ECP} but increases T_{e2e}^{ECP} . In addition, the throughput for ARQ and ECP are enhanced with the increase of data packet size, however, for FEC, EPC and HEPC, the trend is opposite.

FIGURE 7. - Throughput for ECP mechanism (dashed lines) and other four error control strategies (solid lines).
FIGURE 7.

Throughput for ECP mechanism (dashed lines) and other four error control strategies (solid lines).

E. Energy Consumption

The energy consumption of each hop is investigated as the fourth performance metric in nanonetworks, which can be defined as \begin{align*} E^{ECP}=&P_{succ}^{-1}\big (E_{tx}^{p}+E_{rx}^{p}+E_{tx}^{f}+E_{rx}^{f}+E_{code}^{p}+E_{decode}^{p} \\&+\,E_{code}^{f}+E_{decode}^{f} +P_{succ}^{p}(E_{tx}^{d}+E_{rx}^{d}+E_{tx}^{f}+E_{rx}^{f} \\&+\,E_{code}^{d}+E_{decode}^{d}+E_{code}^{f}+E_{decode}^{f})\big). \tag{26}\end{align*} View SourceRight-click on figure for MathML and additional features. where P_{succ}^{-1} refers to the expected number of retransmissions. For y=p , f or d , the coding energy, E_{code}^{y} , consumed to compute a 16-bit CRC is obtained by [12] \begin{equation*} E_{code}^{y}=16N_{bits}^{y}(E_{shift}+E_{hold}). \tag{27}\end{equation*} View SourceRight-click on figure for MathML and additional features. where E_{shift} and E_{hold} refer to the energy consumed to shift and hold the registry value, respectively. In our analysis, for the decoding energy consumption, we consider that E_{decode}^{y}=E_{code}^{y} .

In our analysis, we assume that the feedback packets can be transmitted and received successfully. Note that even if the packets (including data packets, probing packets and feedback packets) are not correctly received because of collisions or channel errors, the energy is consumed. For the computation of energy consumption, we have taken into account both the communication energy consumption and the computation energy consumption. In Fig. 8, the energy consumption of E^{ECP} in (26) and other error control techniques are shown as a function of the data packet size N_{bits}^{d} . As shown in the figure, the trend for all error control strategies are very similar to that of the delay shown in Fig. 6, that is, the larger the transmitted data packet, the more energy is consumed. The energy consumption of transmitting one packet is calculated from (3). Alternatively, compared with the other four error control schemes, although ECP consume more energy than EPC and HEPC, it saves more energy than ARQ and FEC. The reason is that before one data packet is transmitted, the channel condition is known by transmitting one probing packet. Especially, in case of the channel condition is poor, ECP can save more energy because it does not transmit/retransmit data packets blindly. Obviously, the energy utilization can be significantly improved for nanonetworks.

FIGURE 8. - Energy consumption of successfully transmitting one data packet for ECP mechanism (dashed lines) and other four error control strategies (solid lines).
FIGURE 8.

Energy consumption of successfully transmitting one data packet for ECP mechanism (dashed lines) and other four error control strategies (solid lines).

SECTION V.

Conclusion

In this paper, firstly, we proposed a novel error control mechanism for nanonetworks and the detailed description of the mechanism is shown in Section III. Secondly, an energy state model based on the extended Markov chain approach of the proposed ECP mechanism is presented and the corresponding probability distribution is comprehensively investigated. Finally, we validate the energy state model and investigate the impact of ECP mechanism on the performance of nanonetworks under different communication parameters by simulation and numeral calculations. Especially, four different error control schemes (ARQ, FEC, EPC and HEPC) are provided to evaluate the performance of ECP mechanism. From the above results, compared with traditional ARQ and FEC strategies, ECP mechanism is shown to significantly improve the end-to-end successful data packet delivery probability and the energy utilization performance. Similarly, ECP mechanism also has a better performance such as packet delivery probability and throughput than EPC strategies.

References

References is not available for this document.