- Research
- Open access
- Published:

# Energy-efficient renewable scheme for rechargeable sensor networks

*EURASIP Journal on Wireless Communications and Networking*
**volume 2020**, Article number: 74 (2020)

## Abstract

Wireless energy transfer (WET) is a promising technology to fundamentally settle energy and lifetime problems in a wireless sensor network (WSN). In this paper, we study the operation of WSN based on WET using a mobile charging vehicle (MCV) and construct a periodic strategy to make the network operational permanently. Our goal is to decrease energy consumption of the entire system while maintaining the network operational forever. Based on the analysis of total energy consumption, we propose an energy-efficient renewable scheme (ERSVC) to achieve energy saving. Compared to previous schemes where the MCV visits and charges all nodes in each cycle, the MCV only needs to visit a portion of nodes in ERSVC. Numerical results show that our scheme can significantly decrease the total energy consumption with no performance loss. It is also validated that ERSVC can maintain the network operational forever with lower complexity than other schemes, making it more practical for real networks.

## 1 Introduction

Wireless sensor networks (WSNs) nowadays are primarily powered by batteries. Due to limited energy capacity in a battery at each node, a WSN can only remain operational for limited time. To prolong its lifetime, there have been extensive researches in the last decade [1–4]. However, lifetime remains a performance bottleneck of a WSN and is one of the main reasons that limit its widespread application.

Recently, wireless energy transfer (WET) based on magnetic resonant coupling [5] was shown to be a promising technology to solve energy and lifetime problems in WSNs fundamentally [6–9]. Surprisingly, this new technology is immune to the surrounding environment. Compared with other WET technologies such as electro-magnetic radiation [10, 11], magnetic resonant coupling has many significant advantages including higher energy conversion efficiency, further transmission distance, and no requirement of line-of-sight.

Some researchers investigated the problems in WSNs based on this non-radiative energy transfer. In [6], the authors proposed a model to make the WSN operational forever, with the objective of maximizing the ratio of vacation time. In [7], the authors extended the research in [6] to a dense network where several sensors could be charged at the same time. The authors in [6, 7] assumed that the mobile charger must visit all of the sensors in each cycle. However, sensors may have different energy consumption rate in real networks. Charging all nodes in each cycle will increase the traveling distance of MCV and thus degrading the energy efficiency of the entire system. In [8, 9], the authors studied the approach of combining mobile recharging and data gathering to further reduce energy consumption. These schemes assumed that the transmitter was omni-directional and could charge several nodes at the same time. However, the assumed scenarios in [8, 9] are difficult to be deployed in practice. Since magnetic resonant coupling has strict requirement with distance and orientation, which will make an effect on the charging efficiency [12]. Another drawback is that the complexities in [8, 9] are very high, causing them not suitable to be implemented in real networks.

In this paper, we propose an energy-efficient renewable scheme (ERSVC) with low complexity based on this non-radiative energy transfer. Our goal is to decrease energy consumption of the entire system while maintaining the network operational permanently. Due to the potential large coverage of a WSN, we employ a mobile charging vehicle (MCV) to periodically visit each sensor node and charge it wirelessly. Different from previous schemes in [6–8], the MCV only visits and charges a portion of sensor nodes in ERSVC during each cycle. The set of charged nodes during each cycle is redesigned by taking into account the power consumption of each node. We use the total power consumption and MCV’s vacation time ratio as the performance metric. Morevover, we derive the proof theoretically that ERSVC can make sure the network operational forever. Numerical results have shown that ERSVC achieves the goal of energy saving with lower complexity than other schemes in [6–9], which suggest it seems to be more practical for real applications.

The main contributions of this paper include several aspects. Firstly, we study the operation of a sensor network and construct a periodic strategy to make the network operational permanently. Secondly, we analyze the total energy consumption and point out that the traveling distance of MCV is the main factor influencing total energy consumption. Therefore, we primarily aim to decrease the traveling distance of MCV as much as possible in proposed ERSVC. Thirdly, we develop a comprehensive design for data flow, charging period and visiting set in ERSVC to achieve energy saving. Furthermore, we also demonstrate that ERSVC can make the network immortal theoretically.

## 2 Methods

In this section, we present the model for MCV’s behavior and the control strategy in WSN. Table 1 lists the main abbreviations and notations in this paper.

### 2.1 MCV and travel path

We consider a sensor network \(\mathcal {N}\) deployed over a two-dimensional area, similar to the scenario that was widely adopted in [6–8]. Each sensor node has a battery capacity of *E*_{max} and is fully charged initially. Also, denote *E*_{min} as the minimum energy at a sensor node battery (for it to be operational). Each sensor node *i* generates sensing data with a rate of *R*_{i} (in bit/s), \(i \in \mathcal {N}\). Inside the network, there is a fixed base station (*B*), which is the sink node for all data generated by the sensor nodes. Multi-hop data routing can be employed for forwarding data by the sensor nodes.

To charge the battery at each sensor node, a mobile wireless charging vehicle (MCV) is employed in the network. As shown in Fig. 1, the MCV starts from a service station (denoted as origin *O*), and the traveling speed of the MCV is *V* (in m/s). When it arrives at node *i*, it will spend a time of *t*_{i} to charge the node’s battery wirelessly via non-radiative energy transfer. Denote *U* as the energy transfer rate of the MCV. After *t*_{i}, the MCV leaves node *i* and travels to the next node.

After the MCV visits, all the sensor nodes that need to be charged in this cycle will return to the service station to be serviced (e.g., replacing or recharging its battery) and get ready for the next trip. We call this resting period vacation time, denoted as *t*_{vac}.

For a given set of nodes *S*, the MCV starts from *O*(*O*∈*S*), visits and charges all nodes *n*_{i}(*n*_{i}∈*S*), and finally returns to *O*. This problem is defined as the traveling salesman problem (TSP) [13]. In TSP, the shortest path which connects all the nodes in *S* and has the shortest overall length is called the shortest Hamiltonian cycle. It was proved in [6] that the MCV must move along the shortest Hamiltonian cycle in an optimal solution. It is obvious that the shortest Hamiltonian cycle is also the best path to achieve the energy-efficient optimization.

In each cycle, the MCV needs to visit and charge some nodes in the network. Denote *F*_{k} as the set of nodes which need to be visited in the *k*th cycle. In the *k*th cycle, the MCV travels along the shortest Hamiltonian cycle which connects all nodes in *F*_{k} and *O*. Denote *P*_{k} as the traveling path of this shortest Hamiltonian cycle. Denote *D*_{k} as the distance of path *P*_{k}, and *t*_{P}=*D*_{k}/*V* as the time spent for traveling over distance *D*_{k}.

Denote *T* as the period for a trip cycle of MCV, and \(t_{\text {vac}}^{k}\) as the vacation time of MCV in the *k*th cycle. In the *k*th cycle, the MCV travels from *O*, visits and charges all nodes in *F*_{k}, and finally returns to *O* for a vacation time \(t_{\text {vac}}^{k}\). Then, the cycle time *T* can be written as

where \({\sum \nolimits }_{j \in {F_{k}}} {{t_{j}}} \) is the total amount of time that MCV spends charging all nodes in *F*_{k} via non-radiative energy transfer.

### 2.2 Control strategy

In this paper, we use periodic strategy to make sure none of the sensor nodes runs out of energy. As mentioned above, a MCV is employed to charge the sensor nodes periodically with a cycle time of *T*. On the other hand, each node should be charged in time to supplement its energy consumption.

In previous researches [6–9], the MCV visits and charges all the nodes in each cycle. However, sensors may have different energy consumption rate in real networks. Some nodes which are close to the base station may consume energy several times higher than the remote ones and it is unnecessary to visit all nodes in each cycle. Therefore, we can adopt some strategies by taking into account the energy consumption rate of each node. For example, the node with the highest energy consumption rate will be visited in each cycle. In contrast, the node with lower energy consumption can be visited every 2 cycles or more.

For each node *i* (\(i \in \mathcal {N}\)), it should be recharged periodically to supplement its energy consumption in time. Denote *T*_{i} as the charging period of node *i*. The charging process for node *i* is shown in Fig. 2.

Denote *p*_{i} as the energy consumption rate of node *i*. According to the energy conservation principle, the energy consumption of node *i* should be equal to the energy supplied by MCV. Therefore, we have the following relationship,

## 3 Analysis on total energy consumption

In this section, we analyze the energy consumption of the entire system with MCV. For convenience of comparison, we use a plug-in hybrid vehicle (i.e., PHEV) to carry the mobile battery as the MCV. The total energy consumption consists of two parts as follows:

The energy that the MCV needs to charge all the sensor nodes in the network.

The energy consumed by the MCV to travel inside the network.

According to the research data given by the Pacific Northwest National Laboratory [14], the energy consumption per mile (i.e., ECPM) of a mid-size PHEV is 0.3 kW, that is, 675 J/m. Suppose the traveling speed of the MCV is *V* = 5 m/s, then the power consumed by the MCV traveling is about 3 kW. However, the power consumption of a sensor node is about several milliwatts to several hundreds of milliwatts [1]. Apparently, the power consumed by the MCV traveling is the main part of the total energy consumption in the system.

In this paper, we propose an energy-efficient renewable scheme with variable cycle (ERSVC). In ERSVC, we firstly set the value of *T* properly, then we design the charging period *T*_{i} for each node *i* based on its energy consumption rate *p*_{i}. The value of *T*_{i} is set to be an integral multiple of *T*. Thus, the MCV can visit a portion of nodes in each cycle, and the traveling distance of MCV can be decreased. We use two major steps to decrease the two parts of total energy consumption respectively. We primarily aim to decrease the traveling distance of MCV as much as possible, since it is the main part of total energy consumption.

We use two parameters to measure the performance of network, which are stated as follows:

The total power consumption (denoted as

*P*_{total}), which is the sum of the two parts mentioned above. Denote*λ*as the energy conversion efficiency of non-radiative energy transfer. Then,*P*_{total}can be written as follows:$$ {P_{\text{total}}} = \frac{1}{\lambda} \cdot \sum\limits_{i,i \in \mathcal{N}} {{p_{i}}} + \frac{{{L_{\text{total}}} \cdot {\text{ECPM}}}}{{{T_{\text{total}}}}} $$(3)where

*T*_{total}and*L*_{total}are the total time and traveling distance of MCV over all of the cycles, respectively, and ECPM is defined as the energy consumption per mile in [14].Note that all the sensor nodes in WSN are powered by electric energy converted from WET. Therefore, the first part of total power consumption can be written as \(\frac {1}{\lambda } \cdot {\sum \nolimits }_{i,i \in \mathcal {N}} {{p_{i}}}\).

The ratio of the MCV’s vacation time (denoted as

*η*_{vac}), which is the optimization objective in [6–9]. In this paper, we define*η*_{vac}as the mean percentage of time in each cycle that MCV spends on its vacation, and it can be calculated by the following equation:$$ {\eta_{\text{vac}}} = \frac{{{\sum\nolimits}_{k} {t_{\text{vac}}^{k}} }}{{{T_{\text{total}}}}},\;\;{\eta_{\text{vac}}} \in [0,1] $$(4)where \({\sum \nolimits }_{k} {t_{\text {vac}}^{k}}\) is the total amount of time that MCV spends on its vacation over all of the cycles.

In this paper, our goal is to decrease the value of *P*_{total} while maintaining the network operational forever. In (4), we can see that when *η*_{vac} increases, it means that MCV has more time to replace or recharge its battery at the service station, which indicates better performance of the network.

## 4 Implementation of proposed ERSVC

In this section, we present the procedure of ERSVC. The implementation of ERSVC includes two major steps. The first step is to optimize the first part of total energy consumption (i.e., \({\sum \nolimits }_{i,i \in \mathcal {N}} {{p_{i}}}\)). In the second step, we make a joint design to decrease the traveling distance of MCV.

### 4.1 Optimization with flowing rate and data routing

Denote *x*_{ij} as the flow rate from node *i* to node *j* and *x*_{iB} as the flow rate from node *i* to the base station *B*, respectively. Then, we have the following flow balance constraint [6] at each node *i*,

Each sensor node consumes energy for data transmission and reception. In this paper, we use the following energy consumption model [1] which is widely used in previous researches [6–8].

where *β*_{r} is the energy consumption rate for receiving a unit of data rate, *β*_{ij} (or *β*_{iB}) is the energy consumption rate for transmitting a unit of data rate from node *i* to node *j* (or the base station *B*). Furthermore, \({\beta _{ij}} = {C_{1}} + {C_{2}} \cdot d_{ij}^{\alpha } \), where *d*_{ij} is the distance between node *i* and node *j*, *C*_{1} is a distance independent constant term, *C*_{2} is a coefficient of the distance dependent term, and *α* is the path loss index. In this model, \({\beta _{r}} \cdot {\sum \nolimits }_{k \in \mathcal {N}}^{k \ne i} {{x_{ki}}}\) is the energy consumption rate for reception, and \({\sum \nolimits }_{j \in \mathcal {N}}^{j \ne i} {{\beta _{ij}} \cdot {x_{ij}}} + {\beta _{iB}} \cdot {x_{iB}}\) is the energy consumption rate for transmission.

We assume that the flow rate (*x*_{ij} and *x*_{iB}) in the network is invariant with time. The optimization objective is the total power consumption of all sensor nodes (i.e., \({\sum \nolimits }_{i,i \in \mathcal {N}} {{p_{i}}} \)) which is the first part of *P*_{total} in (3). Each node should satisfy the basic flow balance constraint in (5) and energy consumption model in (6). Therefore, the optimal problem can be formulated to a linear programming problem as follows:

In this problem, *x*_{ij},*x*_{iB} and *p*_{i} are the optimization variables. *R*_{i},*β*_{r},*β*_{ij}, and *β*_{iB} are constants. *κ* is a constant which is defined in the following Theorem 1.

Define *D*_{TSP} as the distance of the shortest Hamilton cycle which connects all nodes in \(\mathcal {N}\) and the service station *O*. Then, the system should satisfy a feasibility condition which is stated in Theorem 1 as follows.

###
**Theorem 1**

For any node \(i\;(i \in \mathcal {N})\), the optimization problem has a feasible solution when *p*_{i} satisfies the following condition.

where *N* is the number of sensor nodes in the network, *A*=2*D*_{TSP}/*V* and *E*_{1}=*E*_{max}−*E*_{min}. The right value in (8) is a constant, which is defined as *κ*. The proof of Theorem 1 is given in the “Discussion” section.

Note that the constrained condition in Theorem 1 is set up to ensure that the vacation time meets the condition \(t_{\text {vac}}^{k} \ge 0\) in (1), which means the sum of the traveling time of MCV and the charging time for all nodes should not be greater than the total cycle time *T*.

### 4.2 Procedure of joint design

We can obtain the power consumption *p*_{i} of each node *i* after solving the optimization problem in (7). In this subsection, we design the system for combining the charging period *T*_{i}, the visiting set *F*_{k} in each cycle, and the traveling path of MCV. The steps are as follows.

#### 4.2.1 Step 1

In step 1, we set the value of *T* for MCV and the number of set needs to be classified.

Firstly, compute the maximum and minimum of *p*_{i} respectively as follows:

Secondly, set the value of *T*, and the maximum charging period (denoted as *T*_{max}) corresponding to the node which has the minimum power consumption as follows:

Denote *r* as the number of set that needs to be classified, which is set up as follows:

where ⌈ ⌉ and ⌊ ⌋ is the operating of making a number round up to and down to the nearest integer, respectively.

#### 4.2.2 Step 2

In this step, we set the charging period *T*_{i} for each node *i* and classify the set *S*_{k}.

Firstly, for each node \(i\;(i \in \mathcal {N})\), we set its charging period *T*_{i} as follows:

where *a* is the approximate logarithm of the ratio of *T*_{i} and *T* and is calculated as follows:

Define set *S*_{k}(1≤*k*≤*r*) and let *i*∈*S*_{a}, then the MCV should visit node *i* in the (*n*·2^{a−1})th trip cycle. Note that we multiply the parameter *T* by coefficient 1/2 in (10) to guarantee the paramenter *a* meets the condition *a*≥1.

#### 4.2.3 Step 3

In this step, we will obtain the visiting set *F*_{j} of MCV during the *j*th cycle and design the traveling path of MCV. We can express *j* (1≤*j*≤2^{r−1}) as *j*=*m*·2^{c}, where *m* is an odd number, *c* is an integer, and *c*≥0. During the *j*th cycle, denote *F*_{j} as the set of nodes which should be visited and recharged, then *F*_{j} can be obtained as follows:

Denote *P*_{j} as the traveling path of MCV during the *j*th cycle. It is obvious that *P*_{j} should be the shortest Hamilton cycle which connects all nodes in *F*_{j} and the service station *O*, that is,

During the *j*th cycle, for each node *n*_{i}∈*F*_{j}, the MCV travels to *n*_{i} and charges its battery to *E*_{max}. After 2^{r−1} cycles, the MCV will recount from the first cycle and keep circulating like this.

The detailed steps of this subsection are summarized in Algorithm 1.

## 5 Numerical results

In this section, we present some numerical results to explain how ERSVC works in a real network. In order to evaluate the performance for proposed ERSVC and other schemes in previous researches, we use the network topology and parameter settings similar to those in [6–9]. The simulations are conducted with MatLab software.

### 5.1 Simulation settings

We consider two randomly generated WSNs consisting of 50 and 100 nodes, respectively. The sensor nodes are deployed randomly in a square area of 1 × 1 km^{2}. Both the base station and the service station are assumed to be located at (500, 500) (in m). The data rate *R*_{i} from each node *i* is randomly generated within [1, 10] kb/s. The parameters in (6) are *C*_{1}=50 nJ/b,*C*_{2}=0.0013 pJ/(b·m^{4}),*β*_{r}=50 nJ/b, and *α*=4 [6–8]. The traveling speed of MCV is *V*=5 m/s, and the energy transfer rate of MCV is *U*=5 W which is well within feasible range [5]. We assume the charging distance between MCV and each sensor node is about 1 m. Thus, the value of energy conversion efficiency can be set to *λ*=0.85 [5].

For a sensor node’s battery, we choose a regular NiMH battery and its cell voltage and the quantity of electricity is 1.2 V/2.5 Ah. Let *E*_{max}=10.8 KJ, and *E*_{min}=0.05·*E*_{max}=540 J [6].

### 5.2 Results

#### 5.2.1 50-Node network

We firstly present the results for the 50-node network. Table 2 gives the location of each node and its data rate for a 50-node network.

Figure 3 illustrates the data routing result after optimizing in the first step of ERSVC. In Fig. 3, an arrow from node *i* to node *j* indicates that there is data transmitting from node *i* to node *j* (i.e., *x*_{ij}>0).

After the first step, we can obtain the power consumption *p*_{i} of node *i* by (6). Then, the node with the highest power and the node with the lowest power can be calculated, which correspond to the 48th node and the 12th node, respectively. So the number of set needs to be classified is *r*=12, which can be calculated by (11). The result of the classified set *S*_{k} is shown in Table 3.

In ERSVC, the period of a trip cycle is *T*=14.4 h. The optimal traveling path of MCV during the (2^{5}=32)th cycle is shown in Fig. 4. According to (14), the visiting set of MCV is *F*_{32}=*S*_{1}∪*S*_{2}∪…∪*S*_{6} in the 32th cycle. It is obvious that the optimal traveling path is the shortest Hamiltonian cycle. We can solve this problem by using the Concorde solver [15].

As shown in Fig. 4, different from other schemes in previous researches [6–8], the MCV only needs to charge a portion of nodes during the 32th cycle, which is consistent with our previous analysis. After 2^{r−1}=2048 cycles, the MCV will recount from the first cycle and so on.

The energy cycle behavior of the 48th node which has the highest power consumption is shown in Fig. 5. We can see that the remaining energy of the battery at the 48th node is always higher than *E*_{min} during a charging period. Thus, it will remain operational forever due to the periodicity of each node in the network.

After the implementation of ERSVC, we can finally compute the total power consumption *P*_{total} by (3). Then, the vacation time ratio *η*_{vac} can be obtained by bringing (2) into (1). *P*_{total} and *η*_{vac} are two parameters to measure the performance of the network. In traditional scheme (such as [6, 7]), the MCV visits and charges all the nodes in the network with constant cycle time, and we call it the traditional scheme with constant cycle (TSCC). Table 4 illustrates these two parameters for proposed ERSVC, TSCC, and the scheme in [9].

In Table 4, \(\overline {{L_{\text {total}}}} (m)\) is defined as the average traveling distance of MCV over 2048 cycles. From Table 4, we can see that ERSVC decreases total energy consumption *P*_{total} by about 48% compared to TSCC, while maintaining the vacation time ratio *η*_{vac} nearly equal to that in other schemes. In [9], the authors designed a cluster-based network topology and selected some nodes as cluster heads to reduce the traveling distance and total energy consumption. Nevertheless, the MCV still need to visit all nodes in each cycle in [9]. Therefore, ERSVC outperforms the scheme in [9] in terms of energy consumption.

In ERSVC, the total power consumption of all nodes is \({\sum \nolimits }_{i,i \in \mathcal {N}} {{p_{i}}} {{ = }}0.58\) and it is much less than *P*_{total}, as shown in Table 4. Therefore, we can deduce that the traveling distance of MCV (i.e., \( \overline {{L_{\text {total}}}} \)) is the main factor influencing *P*_{total} in (3). In Table 4, \( \overline {{L_{\text {total}}}} \) is significantly decreased by about 75.4% compared to TSCC, since the MCV only needs to charge a portion of nodes in each cycle.

#### 5.2.2 100-Node network

Table 5 gives the location of each node and its data rate for a 100-node network. Figure 6 illustrates the data routing result after optimizing in the first step of ERSVC.

The result of the classified set *S*_{k} is shown in Table 6. Table 7 shows the network performance measured by *P*_{total} and *η*_{vac} for proposed ERSVC and traditional TSCC.

In Table 7, we can see that ERSVC decreases the total energy consumption *P*_{total} by about 51% and 42% compared to TSCC and the scheme in [9] respectively, with no performance loss in terms of the vacation time ratio *η*_{vac}. Therefore, ERSVC outperforms TSCC and the scheme in [9] in terms of energy consumption and achieves the goal of energy saving.

## 6 Discussion

In this section, we firstly give the proof that ERSVC can make the network immortal. Then, we prove the Theorem 1 which is mentioned in previous implementation section.

### 6.1 Proof of the network’s sustainability with ERSVC

In this subsection, we prove that ERSCV can guarantee the network operational permanently. Before giving the proof, we firstly prove a Lemma which is stated in Lemma 1.

###
**Lemma 1**

For any node \(i\;(i \in \mathcal {N})\) in the network, the sufficient condition to make it immortal is that the visiting interval of *i* satisfies inequation: *T*_{i}^{′}≤(*E*_{max}−*E*_{min})/*p*_{i}.

###
*Proof*

Define *T*_{i}^{′} the visiting and charging interval of *i*, which is the time interval between two adjacent arrivals at node *i* by MCV. Figure 7 is the energy behavior of node *i* during the *n*th and (*n* + 1)th charging period. Different from *T*_{i} which is set to be an integral multiple of *T*, the value of *T*_{i}^{′} during each charging period is different and its mean value is *T*_{i}, as shown in Fig. 7.

Denote *E*_{low} as the lowest remaining energy of the battery at node *i*. To prove Lemma 1, we only need to prove that *E*_{low} is greater than or equal to *E*_{min}. As shown in Fig. 7, denote *a*_{i} as the moment that MCV arrives at *i* for the (*n* + 1)th time, and *h*_{i} the moment when MCV charges the battery at node *i* to *E*_{max} for the *n*th time. Assume the remaining energy of the battery at node *i* is *E*_{low} at *a*_{i}; therefore,

where the second inequation is based on the sufficient condition in Lemma 1. This completes the proof. □

###
**Theorem 2**

For any node \(i\;(i \in \mathcal {N})\) in the network, the proposed scheme ERSVC can make it operational forever.

In ERSVC, the MCV only visits and recharges a portion of nodes in each cycle, and the visiting set in each cycle is different. Therefore, the moment when MCV arrives at *i* is different every time, and the visiting interval *T*_{i}^{′} is variable, as shown in Figs. 2 and 7. According to (12), we have *T*_{i}=2^{a−1}·*T*. As shown in Fig. 2, we can obtain the following relationship,

Therefore, we can obtain the following result based on (13),

According to Lemma 1, for any node \(i\;(i \in \mathcal {N})\) in the network, it can operate with unlimited time. This completes the proof.

### 6.2 Proof of theorem 1

Recall that the constrained condition in Theorem 1 is set up to ensure that the vacation time meets the condition \(t_{\text {vac}}^{k} \ge 0\) in (1). Therefore, we have the following inequality during the *k*th cycle:

Since *T* is invarient in (19), we only need to prove that *T* is not less than the maximum of the right value in (19). The maximum of the right value occurs when the visiting set *F*_{k} includes all sensor nodes in the network (namely, \(F_{k}=\mathcal {N}\)), and we have *D*_{k}=*D*_{TSP} at this time. Therefore, we have the following relationship,

In Fig. 7, *a*_{i} is the moment when MCV arrives at node *i* in the (*n* + 1)th charging period. After the time of *t*_{i}, the MCV charges the battery of node *i* to *E*_{max}. Apparently, the slope is (*U*−*p*_{i}) when the MCV is charging node *i* at a rate of *U*. Therefore, we can obtain the following relationship:

Then, we can derive the following inequality based on (20) and (21):

According to (10), (19), and (22), the parameter *T* should satisfy the following inequality to ensure the optimization problem in (7) has a feasible solution:

Then, we can rewrite the inequality in (23) to the following quadratic inequality which is defined as the function *f*(*p*_{max}),

where *A*=2*D*_{TSP}/*V*,*B*=(2*N*+1)*E*_{1} and *C*=*E*_{1}·*U*. Define *x*_{1} and *x*_{2} (*x*_{1}≤*x*_{2}) as the two roots of the equation *f*(*p*_{max})=0. Then, the inequality in (23) can be established if *p*_{i} satisfies the following relationship,

Then, we can obtain the Theorem 1 by bringing *B* and *C* into (25). This completes the proof.

## 7 Conclusion

In this paper, we studied the operation of a sensor network based on WET, in a scenario where a MCV was employed to charge the sensor nodes wirelessly inside the network. We analyzed the energy consumption of the entire system and pointed out that the traveling distance of MCV is the main factor influencing total energy consumption. Based on energy consumption analysis and periodic strategy, we proposed a scheme ERSVC to decrease total energy consumption while maintaining the network operational forever with low complexity. Compared to previous schemes where the MCV visits and charges all nodes in each cycle, the MCV only needs to visit a portion of nodes in ERSVC by taking into the account the difference of energy consumption rate at each node. Therefore, the traveling distance of MCV was significantly decreased, and the total energy consumption could be saved. In ERSVC, we firstly formulated a practical optimization problem with flow rate to obtain the energy consumption rate, then designed the system for combining the charging period of each node, the visiting set, and traveling path during each cycle. Subsequently, we gave the proof that ERSVC can guarantee the network operational permanently. Simulations were carried out, showing that ERSVC can significantly decrease the total energy consumption with no performance loss in terms of the vacation time ratio.

The limitation of this work is that the flow rate is assumed to be invariant with time in order to simplify the optimization. However, it is time-varying in many real applications. In addition, we multiply the parameter *T* by coefficient 1/2 due to the variability of *T*_{i}^{′} which will degrade the energy saving performance. This can be improved by using the heuristic approach, such as genetic algorithm and ant colony algorithm. We will investigate these problems in our future research.

## Availability of data and materials

Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

## References

Y. T. Hou, Y. Shi, H. D. Sherali, Rate allocation and network lifetime problems for wireless sensor networks. IEEE/ACM Trans. Netw.

**16**(2), 321–334 (2008).E. M. Malika, B. C. Haithem, A. Rabah, Prolonging the lifetime of large-scale wireless sensor networks using distributed cooperative transmissions. IET Wirel. Sens. Syst.

**8**(5), 229–236 (2018).J. Zhu, H. Cao, C. Song, Z. Xu, Parameter estimation via unlabeled sensing using distributed sensors. IEEE Commun. Lett.

**21**(10), 2130–2133 (2017).T. Ruan, C. Zheng, M. Zhu, Energy-aware approaches for energy harvesting powered wireless sensor nodes. IEEE Sens. J.

**PP**(99), 1–1 (2017).K. André, K. Aristeidis, M. Robert, J. D. Joannopoulos, et al., Wireless power transfer via strongly coupled magnetic resonances. Science.

**317**(5834), 83–86 (2007).L. Xie, S. Yi, Y. T. Hou, H. D. Sherali, Making sensor networks immortal: an energy-renewal approach with wireless power transfer. IEEE/ACM Trans. Netw.

**20**(6), 1748–1761 (2012).L. Xie, Y. Shi, Y. T. Hou, W. Lou, et al., in

*IEEE Commu. Society Conf. on Sensor, Mesh and Ad Hoc Commun. and Networks*. On renewable sensor networks with wireless energy transfer: the multi-node case, (2013). https://doi.org/10.1109/secon.2012.6275766.L. Xie, S. Yi, Y. T. Hou, W. Lou, et al., A mobile platform for wireless charging and data collection in sensor networks. IEEE J. Sel. Areas Commun.

**33**(8), 1521–1533 (2015).L. Kaiyang, P. Jun, H. Liang, P. Jianping, et al., An active mobile charging and data collection scheme for clustered sensor networks. IEEE Trans. Veh. Technol.

**68**(5), 5100–5113 (2019).S. He, J. Chen, F. Jiang, D. K. Y. Yau, et al., Energy provisioning in wireless rechargeable sensor networks. IEEE Trans. Mob.Comput.

**12**(10), 1931–1942 (2013).B. Jin, J. Zhu, Q. Wu, Y. Zhang, et al., One-bit LFMCW radar: spectrum analysis and target detection. To appear in IEEE Transactions on Aerospace and Electronic Systems.

W. M. Ng, C. Zhang, D. Lin, S. Y. R. Hui, Two- and three-dimensional omnidirectional wireless power transfer. IEEE Trans. Power Electro.

**29**(9), 4470–4474 (2014).M. Niendorf, P. T. Kabamba, A. R. Girard, Stability of solutions to classes of traveling salesman problems. IEEE Trans. Cybern.

**46**(4), 973–985 (2016).S. Shafiee, M. Fotuhi-Firuzabad, M. Rastegar, Investigating the impacts of plug-in hybrid electric vehicles on power distribution systems. IEEE Trans. Smart Grid.

**4**(3), 1351–1360 (2013).Concorde TSP Solver. http://www.math.uwaterloo.ca/tsp/concorde/index.html. Accessed Mar 2015.

## Acknowledgements

This work is supported by the National Natural Science Foundation of Guangdong Province in China with No. 2016A030310027.

## Author information

### Authors and Affiliations

### Contributions

Qian Zhang designed the system model and the implementation of the proposed scheme. Rong Cheng collected the relative literatures and performed some experiments to obtain the numerical results. Zhihua Zheng was a major contributor in writing and revising the manuscript. All authors read and approved the final manuscript.

### Corresponding author

## Ethics declarations

### Competing interests

The authors declare that they have no competing interests.

## Additional information

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

## About this article

### Cite this article

Zhang, Q., Cheng, R. & Zheng, Z. Energy-efficient renewable scheme for rechargeable sensor networks.
*J Wireless Com Network* **2020**, 74 (2020). https://doi.org/10.1186/s13638-020-01687-4

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/s13638-020-01687-4