Successive Interference Cancellation Based Throughput Optimization for Multi-Hop Wireless Rechargeable Sensor Networks

Wireless Sensor Networks are constrained by low channel utilization and limited battery capacity, so they are widely regarded as the mainly performance bottlenecks. In this paper, in order to improve channel utilization and prolong network lifetime, we investigate the cooperation of multi-hop Wireless Rechargeable Sensor Networks (WRSNs) with Successive Interference Cancellation (SIC) technology. In WRSNs, since the flow rate of each node is unknown, the power of the nodes is not constant. However, SIC will not work if the signal power levels at receive node cannot be sorted. To solve this issue, we first construct a minimum energy routing and unify the transmit rate to determine the transmit power. We can also obtain the time scheduling scheme after determining the routing and power. Next, we formulate an optimization problem, with the objective of maximizing the mobile charger’s vacation time over the rechargeable cycle. Finally, we provide a near-optimal solution and prove its feasible performance. Simulation results present that SIC can achieve the better upper boundary on throughput (compared to inference avoidance increasing about 180–450%) and no extra transmit and receive energy consumption in the multi-hop WRSNs.


Introduction
Wireless Sensor Networks (WSNs) have been attracted increasing attention in the field of theory and application [1]. With the evolution of wireless communication techniques and sensor manufacturing techniques, WSNs are widely used in forest fire alarms [2], disaster self-help [3], environmental monitoring [4], and medical care [5]. Actually, on the one hand, the finite battery capacitance is one of the crucial limitations to the lifetime of WSNs, and it also remains another one of the key bottlenecks to hinder the large-scale deployment of sensor nodes. On the other hand, the interference signal will have an ill influence on the throughput and the channel utilization. Especially, while a large number of sensor nodes are deployed in a limited area, the issue of interference will become serious in WSNs.
For the problem of limited lifetime, the solutions are generally divided into two categories: energy conservation [6,7] and energy harvesting [8]. Energy conservation is an inevitably part of the In this paper, we analyze a mathematical model for multi-hop WRSNs with SIC technology. The main contributions of this paper are listed as follows: • We formulate constraints on the network and the energy consumption model, and we meet the SIC constraints under a different power of the multi-hop WRSNs.

•
Based on this energy consumption model, we construct an optimization model in which the optimization objective is to maximize the vacation time percentage of the mobile charger (MC).
• We reformulate the original problem into a linear problem with only one quadratic term, and we finally calculate a feasible near-optimal solution to the original problem within the level of error setting in advance.
The rest of this paper is organized as follows: In Section 2, we describe the basic scope of the issue for the multi-hop WRSNs with SIC technique. In Section 3, we propose the mathematical model for a multi-hop WSN with SIC. Section 4 shows the problem formulation and a near-option solution acquired by reformulation. Section 5 presents the numerical results to show the performance for our solution.

Problem Description
We first introduce the principle of SIC technique in a multi-hop wireless network scenario. Subsequently, based on SIC, we study the energy consumption and supplement model of each sensor node.

Multi-Hop Network Scenario with SIC
There is a fixed base station B in the WRSN, as shown in Figure 2, which is the sink for all sensor nodes. Define N as a set of sensor nodes, with N = |N |. Define E max as the battery capacity of each sensor node that all the sensor nodes are fully charged initially. And also denote E min as the threshold of each node keeping alive. The rate of sensing data is R i (in b/s, i ∈ N ) generated by node i. Denote R ij as the data flow rate from transmit node i to receive node j and R iB as the data flow rate from transmit node i to the base station B. The wireless channel model is the independent Rayleigh fading model. Furthermore, we also suppose that perfect instantaneous channel state information can be obtained. Our future work will relax this supposition to make the network scenarios more practical.
As the number of sensor nodes increases in WSNs, the situation of interference grows severely within the wireless network, which causes a lot of communication conflicts and makes an ill influence on the throughput. Based on signal processing, SIC is a powerful physical technology used in multi-user detection. It allows the receive node to cancel multiple interference signals from different unintended transmit nodes through decoding each signal (receive the intended signal and subtract the unintended signal) iteratively. Based on SIC, the receive node can decode the received superposed signals in order, according to the signal strength. For instance, a receive node decodes the strongest signal from the aggregate received signals and considers all the other signals as noise. If the strongest signal meets the SINR threshold, it can be decoded correctly. Then, the receive node removes it from the set of received superposed signals and rebuilds a new combined signal. And then it repeats the procedure for the second strongest signal, and so forth, until all the intended signals are decoded correctly or the SINR threshold is no longer satisfied at any stage. Therefore, we utilize SIC to eliminate the interference signals in WSNs, so that it increases the throughput.

Sensor Power Supply Model
In the WRSN, we employ a mobile charger (MC) to recharge the battery in each sensor node. During traversal, MC recharges all sensor nodes with the driving speed of V (in m/s) from the fixed service station (S) to each sensor node in turn and returns to the place of departure S to prepare for the next travel (like replacing or rechargeable its battery). Denote τ as one recharge cycle and τ vac as the vacation time of MC in τ, respectively. Denote τ i as the rechargeable time of node i in τ. After recharging, MC leaves node i and travels to the next node. We hypothesize that MC always has enough energy within one single trip.
We aimed to design a rechargeable cycle for MC to obtain more vacation time in the multi-hop WRSNs scenario based on SIC. That is, it is to maximize the vacation ratio in a signal rechargeable cycle ( τ vac τ ).

The Mathematical Model for SIC Multi-Hop Wireless Networks
In this section, we present the energy consumption model and the time scheduling scheme for a multi-hop WSN with SIC. Energy consumption and the communication model are the sufficient conditions for constructing the complete rechargeable model.

The Mathematical Model for SIC Multi-Hop Wireless Networks
We utilize SIC to improve the network throughput in the physical layer. Simultaneously, we employ the time scheduling scheme in the link layer. Assume one time frame divided equally into T time slots. Define x ij [t] as a binary variable to indicate whether transmit node i transmits data to receive node j in time slot t. x ij [t] = 1 if transmit node i transmits data to receive node j in time slot t and 0, otherwise. Similarly, define x iB [t] as a binary variable. x iB [t] = 1 if transmit node i transmits data to node the base station B in time slot t and 0, otherwise.
In time slot t, transmit node i can transmit to up to one receive node (the sink B or relay node j), and then we have the following constraint for transmit node: In the half-duplex model, node i cannot transmit nor receive in one time slot. Thus, we have the half-duplex constraint as follows: where T i is a set of sensor nodes within the transmission range of node i. Based on SIC technique, the receive node can decode multiple intended signals and subtract multiple unintended signals sequentially. During the SIC decoding procedure, receive node i (or the base station B) attempts to decode the received superposed signals in time slot t, and it will preserve the strongest signal (or remove the strongest signal if it is a unintended signal) in turn. Define g as the channel loss function, with g = α · d −λ i,j , where α = 1 in general, d i,j is the Euclid distance between transmit node i and receive node j, and λ is the path loss index. Define N 0 as the power of the white Gaussian noise. If the SINR of the received superposed signals at receive node j is greater than or equal to the certain threshold β, this transmission from transmit node i to receive node j will be considered as a successful transmission. We then have the SIC constraints of SI NR ij [t] (or SI NR iB [t]) at receive node j (or the base station B) as follows, SI NR iB [t] = g iB p iB ∑ g lB p lB ≤g iB p iB l =i where p ij is the transmit power of transmit node i transmitting data streams to receive node j. ∑ l∈T i x il [t] = 1 if node i transmits data in time slot t; otherwise, ∑ l∈T i x il [t] = 0. We hypothesize x ij = 1 (or x iB = 1), since the situation, node i transmits no data to node j (or the base station B), does not need to be considered at the time slot. Within a time frame, the constraint of flow balance at sensor node i can be written as follows: Sensor node energy is mainly consumed by the transmission and reception of data, so we ignore other energy consumptions (such as generating and storing data) for brevity. Define P i [t] as the power of transmit node i in time slot t. In this paper, we use the following energy consumption model [21], where c is the rate of energy consumption for receiving a unit of data rate from transmit node i to receive node j (or the base station B), and C ij (or C iB ) is the rate of energy consumption for transmitting a unit of data rate. Furthermore, where d ij represents the Euclid distance between transmit node i and receive node j, χ 1 is a distance-independent constant, and χ 2 is a the distance-dependent constant.
Note that R ij and R iB are variables in the optimization problem; in other words, p ij is also a variable and g ij · p ij cannot be sorted in the optimization problem, which means the SINR cannot be determined, and the SIC procedure also cannot be started. Furthermore, since x ij [t] and x iB [t] are binary variables, the optimization problem is a mixed integer problem, which is generally an NP-hard problem and cannot be solved straightly.
We show that SIC technique can achieve a better upper boundary on throughput and does not lead to a reduction in the vacation time ratio of MC. Section 6 concludes this paper.
Symbols used in this article and there meanings are listed in Table 1: Table 1. Notation.

B
The base station in the Wireless Rechargeable Sensor Networks (WRSNs) B j The maximum number of signals for a SIC receive node j can decode c The rate of energy consumption for receiving a unit of data rate C ij The rate of energy consumption for transmitting a unit of data rate g ij Channel gain from receive node i to transmit node j I i The set of nodes within the interference range of node i N The set of nodes in the WRSN The transmit power of receive node i to transmit node j in time slot The average transmission power of node i in time slot t P i The transmission power of node i with the data rate R R i The data rate generated by node i R ij The flow rate from receive node i to transmit node j R The fixed flow rate from receive node i to transmit node j x ij [t] A binary variable indicating weather node i is sending data to node j in time slot t τ The time of one single travel cycle for mobile charger (MC) τ i The time of recharging node i τ TSP The time of one single travel through the shortest Hamiltonian cycle τ vac The vacation time of MC η vac τ vac divide by τ (i.e., τvac τ ) m The number of piecewise linear segments to approximate the parabola ξ The presetting target error γ i A substitute for τ i in piecewise linear approximation λ is The weight about k/m (k = 0, 1, · · · , m) z is A binary variable indicating weather η i falls within the kth segment

Optimization for SIC Multi-Hop Wireless Networks
There are some binary variables and the issue that the optimization variables need to be sorted. That is, the great challenge is that we find a solution for a multi-hop WRSN scenario with SIC. In the subsection, we show the minimum energy routing for calculating the SIC procedure.
Since data rate R ij (or R iB ) are unknown, the power of node i cannot be determined. Lemma 1 can be used to determine the energy consumption of each node merely demanding the amount of data instead of its power. Lemma 1. The total sum of energy consumption of each node is only related to the amount of data which receives and transmits.
Proof. Note that P i [t] is the power of node i at time slot t, and during a time frame (i.e., T time slots), ∑ l k=0 P i [t] · t k is total energy consumption, where t k is the time of one time slot. Therefore, the energy consumption constraint can be represented as follows: ij represent the amount of data that transmit node i transmits to receive node j within one time frame. The three elements on the right side are the sum of energy consumption of the node i reception data by intended transmit nodes, the energy consumption of the node i for transmitting data to the intended receive node j, and the base station B, respectively.
With determining a route in advance, since the amount of generated data is a constant at each sensor node and it transmits the data streams to the base station B straightly or forwards the data streams to the next node, the amount of data streams is a constant.
Thus, the sum of energy consumption of each node is only related to the amount of data transmission and reception. In other words, there is no need to care about the rate of transmission and reception.
This completes the proof.
With Lemma 1, we unite all R ij to a constant R, then we have the energy consumption constraint as follows: with the transmit power of each node, we can calculate the SI NR ij [t] correctly and determine whether SI NR ij [t] meets the criterion threshold. If the data streams can be received and decoded at node j correctly (i.e., SI NR ij [t] ≥ β), then we have x ij [t] = 1. Similarly, if the data streams can be received and decoded at the sink B, then we have x iB [t] = 1.
In order to reduce calculation and complexity, we now determine the upper boundary on the number of signals that can be decoded by the sink B or relay node j in a time slot. Denote B i as the upper boundary on the number of signals. Lemma 2. The number of successful decoded signals at node i is less than or equal to B i = min{1 + log β+1 P max i βN 0 , |I i |}, in a time slot t, where P max i is the strongest power of intended signal in the set of received superposed signal at node i.
Proof. Without loss of generality, suppose that the power levels of the signals from the k transmit nodes received at node i are in a non-decreasing order as g 1i p 1i ≤ g 2i p 2i ≤ · · · ≤ g ki p ki .
Then, we have k = 1 + log (1+β) g ki p ki /βN 0 . In addition, we can find that g ki p ki ≤ P max i .
Since g ki p ki ≤ β (1 + β) k−1 N 0 , we get the constraint of the number of successful decoded signals as follows, and define I i as a set of nodes within the interference range of node i, which has |I i | elements. Since the number of received superposed signal cannot exceed the number of adjacent nodes, B i = min{|I i |, 1 + log β+1 P max i βN 0 } is the upper boundary on the number of signals which can be decoded by receive node i.
This completes the proof.
Based on Lemmas 1 and 2, we utilize the minimum hopping routing to obtain the minimal energy consumption at each node for transmission and reception. Furthermore, by Lemmas 1 and 2 and constraint (1)-(10), we can achieve an appropriate time scheduling scheme.

The Mathematical Model for Recharging Cycle
In this section, we first construct a rechargeable cycle model, then transform the formulation into get a near-optimal solution by change-of-variable technology. The entire rechargeable cycle τ is divided into three parts: the vacation time τ vac , the rechargeable time ∑ τ i and the traversal time τ tsp .

Rechargeable Energy Cycle Construction
We have constructed constraints and lemmas to solve the issue of the dynamic power in the multi-hop WSNs scenario with SIC. In other words, the energy consumption model of each node is complete, and now we start to construct the energy supplement model.
For different rechargeable cycles, node i has the same curve of energy consumption. Each node has to comply with the following energy restrictions: In each cycle of τ, (i) its remaining battery starts and ends with the same level of energy, and (ii) its remaining battery is always greater than or equal to E min .
Define a set of node locations as Ψ = {ψ 1 , · · · , ψ n } and define the location of the service station S as ψ 0 . Define d ψ i ,ψ (i+1) as the distance between two nodes. Denote P = (ψ 0 , ψ 1 , · · · , ψ n , ψ 0 ) as the physical path over a trip cycle, which starts from the service station, passes through each node for recharging it, and finally returns to the service station. In each rechargeable cycle, define a i as MC arrival time at node i. Then, we have the constraint as follows: Define D tsp as the physical path distance of the shortest Hamiltonian cycle, thus denoting τ tsp = D tsp V as the traveling time over the shortest Hamiltonian cycle. For one singal rechargeable cycle τ, we have the constraint as follows: During the cycle τ, we analyze the power consumption of node i by utilizing the average power P i = (k+1)τ kτ P i τ , (k = 0, 1, 2, · · · ). The amount of energy consumption of node i over τ is equal to the amount of supplement energy over τ i . Therefore, we have the energy balance constraint as follows: During a rechargeable energy cycle, when MC reaches at node i (i.e., a i ), As shown in Figure 3, there are two rechargeable strategies that can be selected: (i) fully recharge (i.e., MC recharges the battery of node i to E max straightly) and (ii) not fully recharge (i.e., MC leaves before fully recharging). These two choices are not different from the results [22]. For the sake of convenience, we select the strategy of fully rechargeable case. When the average power P i replaces the real-time power P i [t], it is notable that there are only two approximate slopes of the energy consumption curve over one single rechargeable cycle [kτ, (k + 1) τ]: When MC does not recharge node i, the energy consumption slope of node i is (−P i ); when MC is recharging node i, the energy supplement slope of node i is (u − P i ), where u is the power of recharging. The node residual energy cannot exceed the battery capacity E max or be less than the minimum energy threshold E min , and the energy constraint can be written as follows: For a rechargeable energy cycle, Therefore, the residual energy of the node always needs to be greater than the minimum energy threshold. We have: The Property 1 in [22] shows that there always exists at least one "bottleneck" node in the WRSN for an optimal solution, and when MC arrives at these nodes and starts to recharge their batteries, the energy level of these nodes is exactly equal to E min (i.e., E(a i ) = E min ).

Property 1.
In an optimal solution, there exists at least one node in the network with its battery energy dropping to E min when MC arrives at this node and recharges its battery.

Mathematical Formulation
We summarize the optimal objective and all the constraints to formulate the optimization problem as OPT raw and show it as follows, Half duplex constraint: (1), (2); Recharging cycle constraint: (8); Flow balance constraints: (5); Energy constraints: (6), (10), (11); In this problem OPT raw , there is a nonlinear objective τ vac τ . Note that since the path traveled by MC is independent of the direction of travel along the shortest Hamiltonian cycle, an optimal solution to OPT raw can work in either direction (i.e., clockwise or counterclockwise).

Reformulation
We employ change-of-variable technology to simplify the formulation. For instance, denote η vac = τ vac τ , replacing the nonlinear objective τ vac τ . For constraint (8), we divide both sides of the formula by τ, and this constraint can be rewritten as We, respectively, denote η vac = τ i τ and η 0 = 1 τ to replace the nonlinear terms 1 τ and τ i τ . Then, constraint (8) is rewritten as follows: Through the same method, the energy constraints (10) and (11) are reformulated as By constraints (12) and (13), we reformulate (14) as follows.
By constraint (13), constraint (6) is rewritten as The optimization problem OPT raw is reformulated as OPT S , and we show it as follows, Flow balance constraints : (5) Vaction constraints : (15) Energy balance constraints : (16) It is not difficult to find that all the variables in OPT S are transferred from the variables in OPT raw . The constraints (11) become (16), which is a linear except, through reformulation (i.e., by change-of-variable technique), but there is still a quadratic term η 2 i . In Section 4.4, we will present how to fit the parabola by a useful technology and show a feasible near-optimal solution to OPT raw within a feasible target error.

A Near-Optimal Solution
In this subsection, we replace the parabola (term η 2 i ) by piecewise straight lines in the reformulation OPT S . The approximation transforms the corresponding nonlinear constraints into the linear constraints, so that an off-the-shelf solver, like Gurobi [23], etc., can calculate the solution. Then, we use this solution to determine a feasible solution to the initial problem OPT raw . Finally, we prove the feasibility of gap between the solution to OPT S and the optimal solution to OPT raw .
It is notable that there is merely one nonlinear term in reformulation OPT S that is the quadratic terms η 2 i , and it lies at the interval ([0, 1]), which is a very small interval. Therefore, we fit the nonlinear term η 2 i by a piecewise linear approximation. The essential idea is replacing the parabola by m piecewise linear segments. For the parabola f(η i ) = η 2 i (0 ≤ η i ≤ 1), we connect each point's ( s m , s 2 m 2 ) to build a piecewise linear approximation. The value of m can be determined by Lemma 3 in Section 4.5.
Then, we present a method to mathematically describe (η i , γ i ) (i.e., the piecewise linear segment). For the sth segment, all points on the piecewise linear curve can be described by the following constraints.
in which λ i,s−1 and λ i,s are two weights, and they satisfy the constraints as follows: Since the quadratic function f (η i ) = η 2 i is convex, the piecewise linear curve ( s m , s 2 m 2 ) lies above the convex curve f (η i ) = η 2 i , and the end of the approximation curve (i.e., the point η i and γ i ) falls on the parabola. For the upper boundary of a feasible error γ i − η 2 i , Lemma 3 can quantify it [22], if γ i − η 2 i is divided into m segment [22].
Although the above formulas can describe λ is , the expression of is only suitable for a given linear segment (i.e., known the sequence number s) and cannot represent a general situation. Now, we present the general mathematical formulas for the entire piecewise linear curve. Denote a binary indicator variable as l is (1 ≤ s ≤ m). l is = 1 if s−1 m ≤ η i < s m ; otherwise, l is = 0. Because η i must fall into only one of the m segments: Based on l is , we reformulate λ is for the entire piecewise linear curve. We first present the relationship between λ is and l is (1 ≤ s ≤ m). After transforming OPT raw into OPT S , we have, at most, two positive values (i.e., λ i,s−1 and λ i,s ), while the others are λ i,j = 0 (j = s − 1, s). In other words, if η i falls only into the first segment at l i1 = 1, we have λ i0 > 0; if η i falls into the sth segment l is = 1 or l i,s+1 = 1, we have λ is > 0; only if η i falls into the last segment l im = 1, we have λ im > 0. These three constraints are formulated as follows: The constraints (22)- (24) indicate that there are at most two positive value λ ik for η i . And if there are the two positive λ ik , they must be adjacent. Then, for the piecewise linear fitted curve, we rebuild the mathematical expression as follows, For constraint (15), substitute After reformulating these constraints, we have the following linear relaxed formulation called OPT R as follows: The off-the-shelf solver, like Gurobi, is able to calculate the solution to formulation OPT R because OPT R has been transformed into a linear formulation from a non-linear formulation.
The two solutions to the linear relaxed formulation OPT R and the reformulation OPT S seem to not be same. In fact, we can derive a feasible near-optimal solution to OPT S through the solution to OPT R . Assume the solution to problem OPT R is Π = (η i , η vac , l is , λ is , γ i ). It is notable that (η i , η vac ) satisfies all constraints in OPT S . We attempt to calculate a feasible solution Π = (η i , η vac ) to OPT S ; we first assume η i = η i , and then we rewrite η vac as follows to meet the constraint (15) in OPT S .
We can calculate a feasible solution to the original problem OPT raw after obtaining a solution to OPT S .

Proof of Near-Optimality
We now attempt to quantify the error between the optimal objective to OPT raw and the relaxed objective to OPT R . We hope the gap of the error to be controlled by m (i.e., we can control the gap by tuning the number of the piecewise linear curve). Though Lemma 4, we reverse the value m by a given feasible error ξ (0 < ξ 1).
where η vac is the objective value for the feasible solution Π to the original problem OPT raw .
Proof. η vac is the result for the solution Π to OPT R , and η vac always is greater than or equal to η vac (i.e., η vac ≤ η vac ), since the problem OPT R is a relaxation of the convex reformulation problem OPT S . Therefore, where the first equality proofed in [22], and the second inequality holds by Lemma 1. This completes the proof.
Next, we introduce Theorem 1 and present a method to set an appropriate m for η vac − η vac ≤ ξ by a given target error ξ. Proof. Note that the gap is η vac − η vac ≤ u·τ tsp 4(E max −E min ) · 1 m 2 in Lemma 4. Therefore, set m = u·τ tsp 4ξ(E max −E min ) , and then we have η vac − η vac = ξ: This completes the proof.
Through Theorem 1, we show the complete procedure on determining the solution to OPT R and present its five steps as follows,

3.
Calculate the relaxed linear optimization problem OPT R with m linear segment and gain its solution Π = η vac , η i , l ik , λ ik , γ i through the solver Gurobi.

Simulation
In this section, we present the numerical results to evaluate the performance that our solution can prolong the lifetime of WRSNs to infinity, and SIC technology can improve the upper boundary on throughput by compared with interference avoidance technology.

Simulation Setting
For WRSNs (30, 50, and 80 nodes), we generate the sensor nodes randomly over square areas (0.8 km × 0.8 km, 1 km × 1 km and 1.5 km × 1.5 km). The base station is assumed to be located at (400 m, 400 m) for 0.8 km × 0.8 km, (500 m, 500 m) for 1.0 km × 1.0 km and (750 m, 750 m) for 1.5 km × 1.5 km. The service station is assumed to be located at the origin (0 m, 0 m). Set V, the speed of MC, equal to 5 m/s. We assume to randomly generate the data sense rate R i within [1,20] kb/s and data transmit rate R is twice as much as the upper boundary of R i (i.e., R = 40 kb/s).
We choose a conventional NiMH battery with E max = 1.08 × 10 4 J and E min = 540 J (E min = 0.05 × E max ). The power consumption coefficients are χ 1 = 50 nJ/b, χ 2 = 1.3 × 10 −3 pJ (b· m 4 ), c = 50 nJ/b, and the path loss index λ = 4. For the final numerical results, since we accept the gap between this solution and the optimal solution to OPT raw is no more than 1%, we set the feasible target error ξ = 0.01,

Result
For brevity, we first randomly generate a small WSN with 10 sensor nodes over a square area of 0.8 km× 0.8 km, as shown in Figure 4a. The coordinate position and the data generation rate of each node are shown in detail in Table 2. Based on SIC technology, within a time frame (T time), the total amount of reception data at the base station increases about 450% compared with that of interference avoidance technology without SIC. We utilize the solver Concorde [24] to get the shortest Hamiltonian cycle for the network with 10 nodes, and the cycle is shown as Figure 5a. For this shortest Hamiltonian cycle, the path distance is D tsp = 2593 m, and the traveling time of MC is τ tsp = 518.6 s. For the presetting target error ξ = 0.01, we obtain a small value m = u·τ tsp 4ξ(E max −E min ) = 4.   Table 3 demonstrates the numerical results of throughput and η vac for ten different WRSNs, in which the upper boundary on throughput is obviously increased, while causing no ill effects on objective value η vac . Since our model and the comparative scheme are using a similar energy consumption model [21] (i.e., formula (6)), and the amount of data remains the same, the difference of numericals in the experimental results is small. In general, our model is a good combination of SIC technology and WCT, and it has a strong applicability to meet the needs of different scales of WRSNs. illustrate SIC technology will increase the upper boundary on throughput immensely and never cause additional energy consumption compared with the scheme of interference avoidance without SIC.