System communication model and analysis
Energy model and analysis
Joint optimization algorithm design
Results and analysis of simulation
Power allocation and relay selection for energy efficient cooperation in wireless sensor networks with energy harvesting
Yin Wu1Email author,
Wenbo Liu2 and
Kaiyu Li2
Received: 8 September 2016
Published: 6 February 2017
In this paper, we investigate a joint power allocation and relay selection scheme for energy efficient cooperation in energy harvesting-wireless sensor networks (EH-WSN). We mainly propose a simple heuristic algorithm to improve the energy efficiency of each node in a clustering based EH-WSN. First, the effect of cooperative communication is evaluated, and then, the energy sustainability of every node is taken into account, finally, we formulate an online optimization problem which can be solved near optimally with low computational complexity. Extensive simulation results are presented to show the outstanding performance of our proposed scheme in nodes' transmitting power allocation and average working utility. Therefore, this joint optimization algorithm has a promising future in real applications.
Cooperative communication
Transmitting power control
Relay selection
Nowadays, a new class of wireless sensor network that harvest energy from the environment (solar, wind, vibration, etc.) is emerging. Because of its intrinsic capability of self-sustainability, a lot of researches have been done on it; many of them focus on the high-efficient energy utilization [1–3]. As for this energy harvesting-wireless sensor networks (EH-WSN), the main challenge is to maximize its working performance under energy harvesting constraints, so studies on the MAC protocol, routing protocol, and cross layer optimization also obtain lots of achievements [4–10].
Recently, the use of cooperative communication in EH-WSN has attracted some interest [11, 12]. For example, Kuang-Hao Liu has investigated a battery-aware relay selection scheme, which is called BARS, for energy harvesting (EH) relays with finite energy storage [13]. It takes into account both channel state information and battery status in choosing the cooperating relay. The analysis result shows that the number of potential relays and the overhead for collecting required information have significant effects on the system outage probability. Songtao Guo et al. [14] have considered applying a simultaneous wireless information and power transfer technique to cooperative clustered wireless sensor networks, they develop a distributed iteration algorithm of power allocation, power splitting, and relay selection to maximize the system energy efficiency, and they find that power splitting ratio plays an imperative role in the relay selection. Weikai Xu et al. [15] have proposed a power splitting-based relaying and a time switching-based relaying protocols to enable wireless information transferring and energy harvesting in a denoise and forward two-way relay network, they analyze the two proposed protocols and obtain the optimal results for power of sources, power splitting ratio, and time switching factor. Zhe Wang et al. [16] have considered an energy harvesting relay station to improve the service quality of a cellular network. The goal is to assign each mobile station a relay station to minimize the probability of relay service outage. C. Huang et al. [17] proposed a deterministic EH model for the Gaussian relay channel and studied delay & nondelay constrained traffics. H. Li et al. [18] addressed the problem of transmission scheduling in EH-WSN when only partial information is available. I. Krikidis et al. [19] researched the interaction between data and energy queues when only knowledge of the arrival rates was available. Especially, K. Singh et al. [20] studied a joint source and relay transmitting power allocation scheme to maximize the system throughput. However, to the best of authors' knowledge, joint relay selection and power allocation for a cooperative communication clustering EH-WSN has not been addressed in the literature.
In this paper, we present a novel heuristic algorithm to further reduce the communication cost in a clustering EH-WSN, where the saved energy can be use in data acquisition and processing. Cluster-based technique is especially popular in wireless sensor network where always dense nodes distributed: it divides the whole network into some clusters, while cooperative communication technique uses some relay nodes to enhance the transmission performance and reduce the whole energy consumption. Our proposed algorithm just chooses the best suitable relay node in the cluster and compute its transmitting power based on the channel condition and energy sustainability. The main contributions of our paper are summarized as follows:
Based on the cooperative communication protocol in clustering EH-WSN, we propose a simplified cooperative relay model and analysis node's transmission power, bit error rate, and energy harvesting evolution procedure.
To maximizing the energy utilization efficiency, we deduce a joint power allocation and relay selection algorithm. Then, we analyze the changes of energy saving efficiency and average network energy when different relays are chosen. These derivations provide practical design insights into the effect of various parameters on the system performance.
The numerical results show that locating the relay node closer to the middle of source node and destination node yields more energy savings. It also demonstrates that the proposed cooperative protocol can improve the balance of cluster nodes' residual energy, since it intelligently track the node's energy sustainability in an online fashion.
The remainder of this paper is organized as follows. Section 2 presents the overview of system communication model; Section 3 analyzes the energy model; Section 4 introduces our joint optimization algorithm; Section 5 presents the experimental results including several key metrics; and Section 6 concludes the paper with drawback and future work.
2 System communication model and analysis
In this study, we mainly focus on the analysis and calculation of cooperative communication in EH-WSN, the cluster-routing protocol is not our main research target. So, we choose the energy harvesting genetic-based unequal clustering-optimal adaptive performance routing (EHGUC-OAPR) protocol [21] as our research basis instead. EHGUC-OAPR is an unequal clustering routing protocol: clusters which are closer to the base station (BS) have smaller size. Apparently, it can balance the energy consumption of the entire network and improve the data delivery ratio effectively. On the other hand, cooperative communications in such clustering EH-WSN are easier to understand: the dash-dotted lines represent the boundaries of clusters, and the black-colored nodes denote the cluster heads, while the straight lines with arrow are data transmission procedures, as is shown in Fig. 1.
Diagram of cooperative communication in the clustering protocol
The transmission procedure that a EH node transmits its data to the BS can be described as follows: first, a EH node shares the data to its cluster head; then, the cluster head selects an optimum cooperating relay within its cluster to collaboratively transmit the data to the next hop (i.e., another cluster head); finally, the cluster head transmissions are completed by a multi-hop scheme, and the sink (or BS) is the final destination. From the above diagram, we can simplify the network model as Fig. 2 for easy analysis. In which R i represents the optimum relay, S is the source cluster head, and D is the destination cluster head. All nodes in the network have EH ability and have only one antenna.
Simplified cooperative relay network
The specific cooperative communication procedure consists of two transmission slots: in the first slot, source cluster head S broadcasts its data as byte x, all the relay node R i and destination cluster head D can hear this message, and their received signals are shown as follow, respectively:
$$ {y}_{S, D}=\sqrt{P_S}{h}_{S, D} x+{n}_{S, D} $$
$$ {y}_{S,{R}_i}=\sqrt{P_S}{h}_{S,{R}_i} x+{n}_{S,{R}_i} $$
P S just represents the transmission power of S; \( {h}_{S, D}\sim C N\left(0,{\sigma}_{S, D}^2\right) \), and \( {h}_{S,{R}_i}\sim C N\left(0,{\sigma}_{S,{R}_i}^2\right) \) are zero mean circularly symmetric complex Gaussian random variables, represent the independent identically distributed fading channel gains of S to D and S to R i . (p.s. all channels are orthogonal and irrelevant, its fading gain from node i to node j is h i,j which follows Rayleigh distribution), and n S,D , and \( {n}_{S,{R}_i} \) represent the additive Gaussian noise of S to D and S to R i , which also follows CN(0, N 0).
Then follows the second slot: the selected optimum relay transfers the signal received in the first slot in a decode-and-forward [22] scheme, it will transmit at power P R if the decoding program is successful, or otherwise, it should keep silence. So in the end, D should receive two signals: one direct from S and the other from R i . After a maximal ratio combining procedure, the recovered signal should be
$$ {y}_{S, D}^{\hbox{'}}=\sqrt{P_S}{h}_{S, D}{y}_{S, D}+\sqrt{P_R}{h}_{R_i, D}{y}_{R_i, D} $$
It is worth noting that the overall end-to-end BER (bit error rate) of our cooperative system, BERcoop, may be expressed as the weighted sum of the BERs of these two cooperative cases:
$$ {\mathrm{BER}}_{\mathrm{coop}}={\mathrm{BLER}}_{SR}\cdot {\mathrm{BER}}_{\mathrm{non}\hbox{-} \mathrm{coop}}+\left(1-{\mathrm{BLER}}_{SR}\right)\cdot {\mathrm{BER}}_{\mathrm{full}\hbox{-} \mathrm{coop}} $$
where BLERSR is the block error rate (BLER) of S to R i , BERnon ‐ coop is the BER of noncooperative transmission which directs from S to D, and BERfull ‐ coop is the BER of the cooperative diversity transmission which from S and R i to D.
3 Energy model and analysis
Here, we consider the energy model of each node as
$$ {E}_i\left(\tau \right)={E}_i\left(\tau -1\right)+{P}_{\mathrm{EH}, i}\left(\tau \right)- I\left({a}_i(j)\right)\left({E}_{TX}+{E}_{RX}\right) $$
E i (τ) is the residual energy of node i at the end of time slot τ, P EH,i (τ) is the harvested energy of node i during slot τ, I(⋅) is the binary indicator function and a i (j) is the event that node i receives and transmits packets, and E TX , E RX just represent the energy consumption of data transmission and reception.
The total average power consumption of a short-range communication system may be expressed as the sum of the total power consumption of the RF power amplifiers P PA and the total power consumption of all other transceiver circuit blocks P CCT. In which P PA could be calculated by the node's transmission power P out:
$$ {P}_{\mathrm{out}}= L{E}_b{R}_b $$
where E b is the required energy per bit at the receiver for a target BER P b ; R b is the bit rate; and L represents the channel path loss and may be calculated according to \( L={d}_{i, j}^k{L}_{\mathrm{ref}} \): d i,j is the distance between node i and j, k is the path loss index, and L ref is the reference path loss when distance is 1 m. So P PA could be written as
$$ {P}_{\mathrm{PA}}=\left(\xi /\eta \right){P}_{\mathrm{out}} $$
η is the drain efficiency of RF amplifier; ξ is the peak to average power ratio decided by modulation scheme.
As for P CCT, it consists of the transmission circuit power consumption P CCT − tx and reception circuit power consumption P CCT − rx , exact values to be decided by detailed hardware components.
Thus, we can deduce the energy consumption per bit when working in conventional noncooperative communication status:
$$ {E}_{\mathrm{non}\hbox{-} \mathrm{coop}}=\left({P}_{\mathrm{PA}-\mathrm{source}-\mathrm{non}\hbox{-} \mathrm{coop}}+{P}_{\mathrm{CCT}- tx}+{P}_{\mathrm{CCT}- rx}\right)/{R}_b $$
P PA − source − non ‐ coop is just the transmission power of source cluster head S.
Otherwise, if we call on the cooperative communication mode, the energy consumption per bit of S is
$$ {E}_{\mathrm{coop}-\mathrm{source}}=\left({P}_{\mathrm{PA}-\mathrm{source}-\mathrm{coop}}+{P}_{\mathrm{CCT}- tx}+2{P}_{\mathrm{CCT}- rx}\right)/{R}_b $$
and the consumption of relay node is
$$ {E}_{\mathrm{coop}-\mathrm{relay}}=\left(1-{\mathrm{BLER}}_{SR}\right)\left({P}_{\mathrm{PA}-\mathrm{relay}-\mathrm{coop}}+{P}_{\mathrm{CCT}- tx}+{P}_{\mathrm{CCT}- rx}\right)/{R}_b $$
P PA − source − coop and P PA − relay − coop are the transmission power of S and R i , respectively. So, the total transmission energy consumption per bit under cooperative diversity is
$$ {E}_{\mathrm{coop}}=\left[\begin{array}{c}\hfill {P}_{\mathrm{PA}-\mathrm{source}-\mathrm{coop}}+\left(1-{\mathrm{BLER}}_{SR}\right){P}_{\mathrm{PA}-\mathrm{relay}-\mathrm{coop}}+\hfill \\ {}\hfill \left(2-{\mathrm{BLER}}_{SR}\right){P}_{\mathrm{CCT}- tx}+\left(3-{\mathrm{BLER}}_{SR}\right){P}_{\mathrm{CCT}- rx}\hfill \end{array}\right]/{R}_b $$
and the corresponding energy saving efficiency is
$$ {\varepsilon}_{\mathrm{saving}}=100\cdot \left({E}_{\mathrm{non}\hbox{-} \mathrm{coop}}-{E}_{\mathrm{coop}}\right)/{E}_{\mathrm{non}\hbox{-} \mathrm{coop}} $$
When comparing formulas 8 and 11, it is apparently that the energy saving brings by cooperative communication must be greater than the energy cost increment in the meantime, only this can make ε saving be positive. In addition, the transmission energy consumption is proportional to the communication distance, so only the distance between S and D exceeds a certain threshold, the cooperative communication can be applicable. As for our EH-WSN, cluster heads are usually quite distant. Hence, the cooperative technique fits perfectly.
4 Joint optimization algorithm design
In this section, we present a joint power allocation and relay selection algorithm to optimize the energy utilization in the EH-WSN. It mainly possesses these functions: every source cluster head could choose the optimum relay node automatically and optimize their corresponding transmitting power. But for an EH-WSN, every EH node has its unique "energy neutral" operation requirement: the energy harvested in a time duration must be greater than the energy cost in the mean time, or else the node will turn down to sleep until enough energy has been acquired. So under the cooperative communication circumstance, the elected optimal relay node should meet two demands: both maximizing the saving efficiency bringing by cooperative diversity and equipped with the strongest energy sustainability. We can express it as the following function:
$$ \underset{i,{E}_{S- TX,}{E}_{R- TX}}{ \arg \max}\left\{\alpha \cdot ST(i)+\left(1-\alpha \right){\varepsilon}_{\mathrm{saving}}(i)\right\},\kern1em \mathrm{Subject}\kern0.5em \mathrm{t}\mathrm{o}\left\{\begin{array}{c}\hfill {\mathrm{BER}}_{\mathrm{coop}}\le {P}_b\hfill \\ {}\hfill \forall i=1,2,\cdot \cdot \cdot, n:{E}_i\left({t}_{\mathrm{stop}}\right)\ge {E}_i\left({t}_{\mathrm{start}}\right)\hfill \end{array}\right. $$
where α is a proportionality coefficient, aiming at balancing the proportion of above two items in the objective function. ST(i) is a representation of energy sustainability for EH node i [21]:
$$ S T(i)=\frac{E_{M, i}}{\left({P}_{\mathrm{EH}, i}+\sigma \right) \log \mu}\left({\mu}^{\lambda (i)}-1\right),\kern1em \mathrm{where}\kern1em \lambda (i)=\frac{E_{M, i}-{E}_{S, i}}{E_{M, i}} $$
σ and μ are the appropriately chosen constants, P EH,i is the harvesting power rate for each node i, E S,i and E M,i are the stored energy in the node i's battery and the maximum battery capacity, respectively. ST(i) and ε saving(i) are the normalization results of ST(i) and ε saving. i is the optional relay node in the cluster. E S − TX and E R − TX are the transmit energies per information bit of the nodes S and R, respectively.
$$ {E}_{S- TX}=\left(\eta /\xi \right){P}_{\mathrm{PA}-\mathrm{source}-\mathrm{coop}}/{R}_b $$
$$ {E}_{R- TX}=\left(\eta /\xi \right){P}_{\mathrm{PA}-\mathrm{relay}-\mathrm{coop}}/{R}_b $$
Through the analysis of formula 14, we can figure that ST(i) is generating by nodes in the cluster automatically, which varies with the environment's energy. As for the ε saving, from formula 12, we could know, when node S and node D are chosen; ε saving is in inverse proportion to E coop. Hence, in order to maximize ε saving, we just need to minimize E coop. So, the next paragraphs describe the optimization of E coop:
For the sake of easy analysis, we take E S − TX and E R − TX to represent the constraints in formula 13. Firstly, we use (SNR SR and SNR RD ) to calculate (BERnon ‐ coop and BERfull ‐ coop) [23]:
$$ {\mathrm{BER}}_{\mathrm{non}\hbox{-} \mathrm{coop}}\approx 1/\left(4{\mathrm{SNR}}_{RD}\right), $$
$$ {\mathrm{BER}}_{\mathrm{full}\hbox{-} \mathrm{coop}}\approx 3/\left(16{\mathrm{SNR}}_{SD}\cdot {\mathrm{SNR}}_{RD}\right) $$
where SNR SR and SNR RD are the signal noise ratio of communication channel from node S to relay R and from R to D.
Secondly, we also calculate BLER SR as follow:
$$ {\mathrm{BLER}}_{SR}\approx K/{\mathrm{SNR}}_{SR} $$
Of which K is a scaling factor. And according to formula 6, 15, and 16, we can infer that
$$ {\mathrm{SNR}}_{S R}=\left({E}_{S- TX}/{N}_0\right)/{L}_{S R} $$
$$ {\mathrm{SNR}}_{S D}=\left({E}_{S- TX}/{N}_0\right)/{L}_{S D} $$
$$ {\mathrm{SNR}}_{R D}=\left({E}_{R- TX}/{N}_0\right)/{L}_{R D} $$
where L SR , L SD , and L RD show the communication channel path loss for node S to relay R, node S to D, and node R to D. For convenience of analysis, we take these three as given parameters which could be calculated by each node.
Then, we substitute formulas 17–22 into formula 4, it can be derived as
$$ {\mathrm{BER}}_{\mathrm{coop}}=\frac{\left(1-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot 3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{R D}}{16\cdot {E}_{S- TX}\cdot {E}_{R- TX}}+\frac{K\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{S R}}{4\cdot {E}_{S- TX}^2} $$
As well as E coop can be expressed as
$$ \begin{array}{c}{E}_{\mathrm{coop}}=\left(\xi /\eta \right){E}_{S- TX}+\left(1-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot \left(\xi /\eta \right){E}_{R- TX}+\\ {}\left(2-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot \frac{P_{\mathrm{CCT}- tx}}{R_b}+\left(3-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot \frac{P_{\mathrm{CCT}- rx}}{R_b}\end{array} $$
Moreover, formula 23 can be presented below after taking in the constraints:
$$ {E}_{R- TX}=\frac{\left(1-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot 3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{R D}}{16\cdot {E}_{S- TX}\cdot \left({P}_b-\frac{K{ N}_0^2{L}_{S D}{L}_{S R}}{4\cdot {E}_{S- TX}^2}\right)} $$
In this way, finally, we can translate the function of E coop minimization into a single variable optimization algorithm with E S − TX :
$$ \underset{E_{S- TX}}{ \arg \min}\left\{\begin{array}{l}{E}_{S- TX}+\frac{\left(1-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot 3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{R D}}{16\cdot {E}_{S- TX}\cdot \left({P}_b-\frac{K{ N}_0^2{L}_{S D}{L}_{S R}}{4\cdot {E}_{S- TX}^2}\right)}+\\ {}\frac{\eta}{\xi}\left[\left(2-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot \frac{P_{\mathrm{CCT}- tx}}{R_b}+\left(3-\frac{K{ N}_0{L}_{S R}}{E_{S- TX}}\right)\cdot \frac{P_{\mathrm{CCT}- rx}}{R_b}\right]\end{array}\right\} $$
Obviously, the above formula is a nonlinear function of E S − TX ; we can use an exhaustion method to compute the optimal result, but at the same time, it must cause a heavy computation burden to the sensor node, in order to avoid this, we make a further analysis on formula 26: when node S and D have been chosen already, L SD should be seen as a constant value; thus, we only have to deal with L SR and L RD . So, the optimization problem can be approximately decomposed as a combination of these two parameters' independent actions.
If we regard L SR as zero, formula 26 is shown as
$$ \underset{L_{S R\to 0}}{ \lim}\underset{E_{S- TX}}{ \arg \min}\left\{{E}_{\mathrm{coop}}\right\}=\sqrt{\frac{3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{RD}}{16\cdot {P}_b}} $$
Else if we regard L RD as zero, it is shown as
$$ \underset{L_{RD\to 0}}{ \lim}\underset{E_{S- TX}}{ \arg \min}\left\{{E}_{\mathrm{coop}}\right\}=\sqrt{\frac{k\cdot {N}_0^2\cdot {L}_{S R}\cdot {L}_{S D}}{4\cdot {P}_b}} $$
Therefore, the optimization problem can be optimally represented as the joint action of formulas 27 and 28:
$$ \begin{array}{c}{E}_{S- TX-\mathrm{OPT}}=\underset{L_{S R\to 0}}{ \lim}\underset{E_{S- TX}}{ \arg \min}\left\{{E}_{\mathrm{coop}}\right\}+\underset{L_{RD\to 0}}{ \lim}\underset{E_{S- TX}}{ \arg \min}\left\{{E}_{\mathrm{coop}}\right\}\\ {}=\sqrt{\frac{3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{RD}}{16\cdot {P}_b}}+\sqrt{\frac{k\cdot {N}_0^2\cdot {L}_{S R}\cdot {L}_{S D}}{4\cdot {P}_b}}\end{array} $$
$$ {E}_{R- TX-\mathrm{OPT}}=\frac{\left(1-\frac{K{ N}_0{L}_{S R}}{E_{S- TX-\mathrm{OPT}}}\right)\cdot 3\cdot {N}_0^2\cdot {L}_{S D}\cdot {L}_{R D}}{16\cdot {E}_{S- TX-\mathrm{OPT}}\cdot \left({P}_b-\frac{K{ N}_0^2{L}_{S D}{L}_{S R}}{4\cdot {E}_{S- TX-\mathrm{OPT}}^2}\right)} $$
So far, we have worked out the transmitting power allocation equations for every distributed feasible relay node. Each candidate relay node in the clusters could calculate its corresponding transmitting power based on the L SR and L RD according to formulas 29 and 30; also the energy saving efficiency ε saving could be figured out.
At last, we know that every candidate relay node could calculate both ε saving(i) and ST(i) automatically and independently; hence, a relay index T RE can be defined as
$$ {T}_{RE}(i)=\alpha \cdot S T(i)+\left(1-\alpha \right){\varepsilon}_{\mathrm{saving}}(i) $$
Furthermore, the cluster head is responsible for collecting each candidate's ε saving(i) and ST(i) and computing the T RE (i). The one with maximal value just become the cooperative relay. But also it should be noted that if a node's current energy status cannot afford the cooperative communication, it would not be selected into the candidate set. The diagram of this joint optimization algorithm is shown below.
5 Results and analysis of simulation
In this section, we investigate the performance of our optimization algorithm via MATLAB. An EH-WSN with 200 nodes can be assumed to be deployed in a monitoring area of 500 × 500 m, the routing protocol "EHGUC-OAPR" has already loaded and the clusters have formed up either, then our experiment carries out. Here, some detailed parameters are shown in Table 1.
Target end-to-end BER P b
10− 3
Bit rate R b
10 kb/s
Target source-relay BER P sr
Transmission power P CCT − tx
Path loss exponent k
Noise power spectral density N 0
−171 dBm/Hz
Peak average ratio ξ
Reception power P CCT − rx
109.5 mW
Drain efficiency of RF η
Energy harvesting rate P EH,n
1 mW
σ, μ
0.1, 5
Reference path loss L ref
109(90 dB)
First, we do some research on the performance of transmitting power allocation block. We assume a one-dimensional situation that the source cluster head S, relay R, and destination node D lie in a straight line, in which S' location is regarded as original point, and the distance from D to S is 30 m; by readjusting the location of R gradually, we can obtain the numerical changes of optimal power allocation. Simulation result is shown in Fig. 3.
Energy variance curves when relay node is moving
The yellow curve displays the source head's transmitting energy when in noncooperative situation; it apparently keeps the same because the relay does not work. The red and blue curves show the source head's and relay's transmitting energy under cooperation, respectively; Dist RD is just the distance from R to D, when it becomes zero means R coincides with D. From the above result, we can see that the total transmission energy (E S − TX − OPT plus E R − TX − OPT) falls to minimum when R is placed in the middle of S and D(Dist RD /Dist SD ≈ 0.5); otherwise, it rises up rapidly. In addition, Fig. 4 shows the effective operation distance threshold of relay node (− 2.5 < Dist RD /Dist SD < 3.5), and the transmitting energy of S takes a greater proportion. P.S. the minus sign means R is located on the other side of S opposite direction with D.
The data relay success rate vs. location changes of R
Furthermore, the numerical value variation of BLER SR at the relay node is also recorded in Fig. 4: it represents the data reception success rate from S to R. We can see that R cannot decode data correctly when Dist RD /Dist SD < − 2.5.
Then, we turn to a two-dimensional situation, where relay can move on a plane surrounded by S and D. Here, D is placed on the original point with S 30 m away. The corresponding energy saving efficiency ε saving is calculated and shown in Fig. 5. Five contour lines represent different energy saving levels when R is located inside. In macroscale, R's position seems nearly a circle under the same ε saving; but in microscale, the closer to the middle of S and D, the more efficient working of R.
The energy saving efficiency ε saving vs. the distance from R to D
After these experiments, we carry our joint optimization algorithm into EHGUC-OAPR protocol, where the initial energy for all nodes is 1 J. We calculate the network average residual energy status as shown in Fig. 6. We can find that every cooperative scheme can reach a better energy status than noncooperative scheme, and the whole EH-WSN reach the energetic optimum when α = 0.6.
Average network energy
Moreover, we examine the energy variation of every cluster head, as shown in Fig. 7. It is obvious that cooperative communication could greatly improve the energy efficiency of EH-WSN, hence saving more power to do other tasks, such as data acquisition and processing.
Contrast of average energy of cluster heads (α = 0.6)
Additionally, we modify the nodes' total number in the EH-WSN, and we evaluate the average ε saving of each scenario, as shown in Fig. 8. We can see that the network with bigger total number has higher efficiency ε saving. The reason is the more nodes in a cluster, the higher probability of a bigger T RE (i).
Average energy saving vs. EH-WSN with different number nodes
Finally, we try to solve the equation 26 and compare the results with our proposed suboptimal results, and we proceed within the one-dimensional circumstance. The difference of total transmission energy (E S − TX − OPT plus E R − TX − OPT) between them is shown in Table 2.
Comparison between the suboptimal results and the optimal results
Dist RD /Dist SD
Difference (μJ)
We could see that the difference falls to the minimum also when relay R is placed in the middle of S and D, and the corresponding relative error is almost less than 5%. So, the proposed optimization computing method is really available and has enough precision.
In this paper, we have investigated an optimal relay selection for energy efficient cooperation in a clustering based EH-WSN. We have formulated a novel and computationally efficient relay selection heuristics for sensor nodes based on both local path loss values and energy harvesting rates. Extensive simulation results are presented to demonstrate that the proposed algorithm achieves near optimally relay node selection and transmitting power allocation. Therefore, this scheme forms the basis of a simple and practical cooperation strategy for EH-WSN and can be directly deployed in real applications (such as solar power monitoring system). It also can be integrated with other optimization protocols to achieve energy efficient network-wide cooperation.
Future work will focus on the proposal of a multi-objective algorithm for node placement and coverage of cooperative EH-WSN. Moreover, we will consider different application cases, including energy harvester-sharing networks and structural health monitoring scene.
This work was supported by the Natural Science Foundation of Jiangsu Province, China (BK20150880). The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.
College of Information Science and Technology, Nanjing Forestry University, No. 159, LongPan Road, Nanjing, 210037, People's Republic of China
College of Automation, Nanjing University of Aeronautics and Astronautics, NO. 29 Yudao St., Nanjing, 210016, People's Republic of China
M Shin, I Joe, Energy management algorithm for solar-powered energy harvesting wireless sensor node for Internet of Things. IET Commun. 10(12), 1508–1521 (2016)View ArticleGoogle Scholar
C Guo, B Liao, L Huang, Q Li, X Lin, Convexity of fairness-aware resource allocation in wireless powered communication networks. IEEE Commun. Lett. 20(3), 474–477 (2016)View ArticleGoogle Scholar
D Del Testa, N Michelusi, M Zorzi, Optimal transmission policies for two-user energy harvesting device networks with limited state-of-charge knowledge. IEEE Trans. Wirel. Commun. 15(2), 1393–1405 (2016)View ArticleGoogle Scholar
F Iannello, O Simeone, U Spagnolini, Medium access control protocols for wireless sensor networks with energy harvesting. IEEE Trans. Commun. 60(5), 1381–1389 (2012)View ArticleGoogle Scholar
L-O Varga, G Romaniello, M Vučinić et al., GreenNet: an energy-harvesting IP-enabled wireless sensor network. IEEE Internet Things J. 2(5), 412–426 (2015)View ArticleGoogle Scholar
T He, K-W Chin, S Soh, On wireless power transfer and max flow in rechargeable wireless sensor networks. IEEE Access 4, 4155–4167 (2016)View ArticleGoogle Scholar
G Martinez, S Li, C Zhou, Wastage-aware routing in energy-harvesting wireless sensor networks. IEEE Sensors J. 14(9), 2967–2974 (2014)View ArticleGoogle Scholar
S Lee, B Kwon, S Lee, AC Bovik, BUCKET: scheduling of solar-powered sensor networks via cross-layer optimization. IEEE Sensors J. 15(3), 1489–1503 (2015)View ArticleGoogle Scholar
Y Tan, X Yin, A dynamic scheduling algorithm for energy harvesting embedded systems. EURASIP J. Wirel. Commun. Netw. 114, 1–8 (2016)Google Scholar
D Noh, T Abdelzaher, Efficient flow-control algorithm cooperating with energy allocation scheme for solar-powered WSNs. Wireless Commun. Mobile Comput. 12(5), 379–392 (2012)View ArticleGoogle Scholar
Y Dong, MJ Hossain, J Cheng, Performance of wireless powered amplify and forward relaying over Nakagami-$m$ fading channels with nonlinear energy harvester. IEEE Commun. Lett. 20(4), 672–675 (2016)View ArticleGoogle Scholar
S Gong, L Duan, N Gautam, Optimal scheduling and beamforming in relay networks with energy harvesting constraints. IEEE Trans. Wirel. Commun. 15(2), 1226–1238 (2016)View ArticleGoogle Scholar
K-H Liu, Performance analysis of relay selection for cooperative relays based on wireless power transfer with finite energy storage. IEEE Trans. Veh. Technol. 65(7), 1977–1987 (2016)Google Scholar
S Guo, F Wang, Y Yang, B Xiao, Energy-efficient cooperative transmission for simultaneous wireless information and power transfer in clustered wireless sensor networks. IEEE Trans. Commun. 63(11), 4405–4417 (2015)View ArticleGoogle Scholar
W Xu, Z Yang, Z Ding, L Wang, P Fan, Wireless information and power transfer in two-way relaying network with non-coherent differential modulation. EURASIP J. Wirel. Commun. Netw. 131, 1–10 (2015)Google Scholar
Z Wang, X Wang, M Aldiab, T Jaber, User association for energy harvesting relay stations in cellular networks. EURASIP J. Wirel. Commun. Netw. 264, 1–12 (2015)Google Scholar
C Huang, R Zhang, S Cui, Throughput maximization for the Gaussian relay channel with energy harvesting constraints. IEEE J. Sel. Areas Commun. 31(8), 1469–1479 (2013)View ArticleGoogle Scholar
H Li, N Jaggi, B Sikdar, Relay scheduling for cooperative communications in sensor networks with energy harvesting. IEEE Trans. Wirel. Commun. 10(9), 2918–2928 (2011)View ArticleGoogle Scholar
I Krikidis, T Charalambous, JS Thompson, Stability analysis and power optimization for energy harvesting cooperative networks. IEEE Signal Process Lett. 19(1), 20–23 (2012)View ArticleGoogle Scholar
K Singh, K Meng-Lin, J-C Lin, Joint power allocation, equalization, and relay selection for MIMO relay networks with multipath receptions. IEEE Trans. Veh. Technol. 65(7), 5160–5174 (2016)View ArticleGoogle Scholar
Y Wu, L Wenbo, Routing protocol based on genetic algorithm for energy harvesting-wireless sensor networks. IET Wireless Sens. Syst. 3(2), 112–118 (2013)View ArticleGoogle Scholar
AS Ibrahim, AK Sadek, S Weifeng, KJ Ray Liu, Cooperative communications with relay-selection: when to cooperate and whom to cooperate with? IEEE Trans. Wirel. Commun. 7(7), 2814–2827 (2008)View ArticleGoogle Scholar
JG Proakis, M Salehi, Digital Communications, 5th edn. (McGraw-Hill, New York, 2007)Google Scholar