Next Article in Journal
Distributed Two-Dimensional MUSIC for Joint Range and Angle Estimation with Distributed FMCW MIMO Radars
Next Article in Special Issue
Energy-Efficient Optimal Power Allocation for SWIPT Based IoT-Enabled Smart Meter
Previous Article in Journal
A Simple Phase-Sensitive Surface Plasmon Resonance Sensor Based on Simultaneous Polarization Measurement Strategy
Previous Article in Special Issue
Assessment of Impact Energy Harvesting in Composite Beams with Piezoelectric Transducers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Residual Energy Estimation-Based MAC Protocol for Wireless Powered Sensor Networks

School of Software, Hallym University, 1 Hallymdaehak-gil, Chuncheon 24252, Gangwon-do, Korea
*
Author to whom correspondence should be addressed.
Sensors 2021, 21(22), 7617; https://doi.org/10.3390/s21227617
Submission received: 19 October 2021 / Revised: 10 November 2021 / Accepted: 13 November 2021 / Published: 16 November 2021

Abstract

:
This paper presents a residual energy estimation-based medium access control (REE-MAC) protocol for wireless powered sensor networks (WPSNs) composed of a central coordinator and multiple sensor devices. REE-MAC aims to reduce overhead due to control messages for scheduling the energy harvesting operation of sensor devices and provide fairness for data transmission opportunities to sensor devices. REE-MAC uses two types of superframes that operate simultaneously in different frequency bands: the wireless energy transfer (WET) superframe and wireless information transfer (WIT) superframe. At the beginning of each superframe, the coordinator estimates the change in the residual energy of individual sensor devices caused by their energy consumption and energy harvesting during the previous superframe. It then determines the devices’ charging priorities, based on which it allocates dedicated power slots (DPSs) within the WET superframe. The simulation results demonstrated that REE-MAC exhibits superior performance for the harvested energy, average freezing time, and fairness to existing representative WPSN MAC protocols.

1. Introduction

Recent advances in radio frequency (RF)-based wireless energy transfer (WET) techniques enable battery-powered sensor devices to receive energy remotely without time and space constraints on ambient resources such as solar, thermal, wind, and vibration, enabling perpetual operations. Thus, wireless sensor networks (WSNs) with RF-based WET—wireless powered sensor networks (WPSNs)—are considered one of the most promising technologies for a sustainable Internet of Things [1,2,3,4,5,6,7,8,9]. In the WPSN, a power station wirelessly transfers energy to sensor devices that use the harvested energy to transmit their collected information to a fusion center [10,11,12]. The power station and fusion center may be included in one device or separated into different devices.
Although such WPSNs are expected to have a potentially infinite network life, they cannot always prevent short-term disconnections due to temporary energy shortages of some sensor devices. Such short-term disconnections cause an imbalance in transmission opportunities between sensor devices, resulting in an unfairness problem for WPSNs [13,14,15,16]. Moreover, in contrast to the traditional WSNs, in the WPSN, when sensor devices operate, wireless information transfer (WIT) and WET must be jointly considered. Consequently, it is necessary to design an appropriate medium access control (MAC) protocol for WPSNs.
Many studies have been conducted to design an efficient MAC protocol for WPSNs. In [17,18,19], the authors proposed a MAC protocol based on carrier-sense multiple access with collision avoidance (CSMA/CA) for WPSNs. Sensor devices access the channel competitively to conduct energy harvesting and data transmission; their channel access priorities are probabilistically differentiated by the backoff duration and inter-frame space (IFS), determined by the remaining energy. In [20,21,22], the authors proposed the time-division multiple access (TDMA)-based MAC protocol, in which a central coordinator allocates time resources for energy harvesting and data transmission considering the remaining energy of the sensor devices and the energy consumption required for data transmission. The sensor devices harvest energy in the dedicated time slots and transmit data.
Cho et al., used both TDMA and CSMA/CA methods to support energy harvesting and data transmission for two types of traffic patterns: periodic and non-periodic [23]. In [23], a coordinator allocates the dedicated TDMA time slots for energy harvesting and data transmission within a superframe to sensor devices that generate periodic traffic requiring transmission reliability on-demand. In contrast, energy harvesting and data transmission for non-periodic traffic are performed in the rest of the superframe using the CSMA/CA scheme. The studies in [17,18,19,20,21,22,23] commonly suffer from network performance degradation due to a lack of bandwidth resources from performing both WET and WIT operations within the same frequency band.
In [24,25,26], the authors used an out-of-band WET approach where sensor devices perform WET and WIT operations independently in different frequency bands, mitigating the effect of bandwidth limitation on WIT operation and improving network performance. However, their research suffers from high overhead due to the exchange of numerous control messages required to schedule WET and WIT operations in separate frequency bands.
Furthermore, the WET scheduling method used in [24,25,26] depends on simple criteria such as the distance to the sensor device and the energy required to transmit the data packet, increasing the difference in the residual energy between the sensor devices in the network. This difference causes an imbalance in transmission opportunities between sensor devices, resulting in an unfairness problem for network performance. This unfairness problem also applies to the in-band WET approach of [17,18,19,20,21,22,23].
This paper proposes a residual energy estimation-based MAC (REE-MAC) protocol, with two advantages for WPSNs composed of a central coordinator and multiple sensor devices. First, REE-MAC increases the residual energy of individual sensor devices by reducing overhead due to control messages for scheduling the energy harvesting operation of sensor devices. The coordinator numerically estimates the residual energy of individual sensor devices rather than exchanging numerous control messages. Second, REE-MAC establishes fairness among the data transmission opportunities for sensor devices. The coordinator allocates WET slots within the superframe to the sensor device by comprehensively considering the distance, harvested energy, and consumed energy for individual sensor devices. Accordingly, the residual energy of the sensor devices in the network is maintained at a similar level.
To this end, REE-MAC uses two types of superframes that operate simultaneously in different frequency bands: WET superframe and WIT superframe. In the WET superframe, a power transmitting unit (PTU) serving as a central coordinator supplies power to power receiving units (PRUs) (i.e., sensor devices) using the TDMA scheme. In the WIT superframe, multiple PRUs compete to transmit data packets to the PTU using CSMA/CA. At the beginning of each superframe, the PTU estimates the residual energy of individual PRUs changed due to their energy consumption and energy harvesting during the previous superframe. The PTU then determines the PRUs’ charging priorities, based on which it allocates dedicated power slots (DPSs) within the WET superframe.
We performed an experimental simulation to verify the superiority of REE-MAC over FF-WPT [25] and HE-MAC [19], which are the representative MAC protocols for WPSNs of out-of-band and in-band WET approaches, respectively. The results demonstrated that REE-MAC achieves 18.08% and 145.60% higher average harvested energy, 81.03% and 64.21% shorter average freezing time, and 100.49% and 135.56% higher fairness than FF-WPT and HE-MAC, respectively.
The rest of this paper is organized as follows. In Section 2, we present a system model for REE-MAC. In Section 3, the detailed operation of REE-MAC is described. The simulation configuration and results are presented in Section 4. Finally, Section 5 concludes this paper.

2. System Model

Figure 1 illustrates the system architecture of the considered WPSN, which consists of a single PTU and multiple PRUs. The PRUs are deployed within the transmission range of the PTU. At the request of the PRU, the PTU either transfers power to the PRU or receives data from the PRU, for which the PTU and PRU are equipped with two types of transceivers: a power transceiver (P-Tx/Rx) for WET and a data transceiver (D-Tx/Rx) for WIT. The P-Tx/Rx and D-Tx/Rx in a device operate independently in different frequency bands and interact using internal signaling—enabling the WET and WIT of REE-MAC to be performed simultaneously.
Furthermore, the P-Tx/Rx and D-Tx/Rx of PTU always keep their radio on, while for the PRU, only its D-Tx/Rx is always on. The PRU keeps its P-Tx/Rx turned on to receive a beacon and power only in WET slots allocated to it and turns it off in other WET slots to prevent unnecessary energy consumption due to idle listening. Both the PTU and PRU have two antennas. The PTU has a directional antenna with a fixed beamwidth for WET and an omnidirectional antenna for WIT. We consider an adaptive array smart antennas as a directional antenna, which adjusts the beam direction by adapting the phase distribution of its antenna array elements. The PTU can transfer power to multiple PRUs using such a directional antenna. The PRU has two omnidirectional antennas for WET and WIT, respectively.
In REE-MAC, for determining when and how long to transfer power to individual PRUs, the PTU estimates the power that each PRU can receive per unit time, derived by Equation (1).
P r , i = P t G t G r ( λ 4 π ) 2 d i α ,
where P r , i is the power that the i-th PRU receives per second and P t is the transmission power of the PRU. G t and G r are the antenna gain of the PTU and the PRU, respectively. We consider a flat-top radiation pattern as the directional antenna model of the PTU [27]; thus, G t is the same as 2 π / θ , where θ is the beamwidth of the directional antenna of the PTU. In contrast, because the PRU receives power from the PTU using its omnidirectional antenna, G r is equal to one [28]. λ , d i , and α refer to the wavelength, distance between the PTU and i-th PRU, and path loss exponent, respectively.

3. Design of REE-MAC

Figure 2 illustrates a superframe structure of the REE-MAC. The REE-MAC maintains a dual superframe structure—WET and WIT superframes—operated in separated frequency bands. In the WET superframe, the PTU transfers power to the PRUs according to their dedicated schedule using the TDMA scheme. The PRUs use the harvested energy to exchange control messages and data packets using contention-based CSMA/CA in the WIT superframe. The WET superframe is divided into multiple equally sized DPSs, each allocated to an individual PRU for its exclusive power reception.
The DPS consists of three subslots: a beacon subslot, a P-Tx/Rx switching subslot, and a WET subslot. In the beacon subslot, the PTU or PRU beacon is broadcasted. The PTU beacon is transmitted in the beacon subslot of the first DPS in the WET superframe, through which the PTU informs the PRUs of the allocation result for the DPSs in the WET superframe. In the beacon subslot of the remaining DPSs in the WET superframe, the PRUs request power transfer by transmitting a PRU beacon to the PTU. In the P-Tx/Rx switching subslot, the PTU obtains the direction of the PRU from the received PRU beacon, and the PRU switches the mode of its P-Tx/Rx from Tx to Rx for harvesting the energy.
The direction of the PRU indicates the phase of the PRU beacon signal transmitted from the PRU, through which the PTU can change the beam direction of its antenna toward the corresponding PRU to transfer power to it. In the WET subslot, the PTU transfers power to the allocated PRU. The WIT superframe consists of a beacon period and a data communication period. In the beacon period in the WIT superframe, the PTU broadcasts a beacon including the WIT superframe parameters through D-Tx/Rx. The PTU and PRUs compete freely with each other for channel access using the CSMA/CA scheme.
Figure 3 illustrates the overall operation of the REE-MAC. The solid and dashed lines represent the operation of the devices in WET and WIT superframes, respectively. These two superframes are expressed to overlap each other because the WET and WIT operations are performed simultaneously in different frequency bands. At the beginning of the WIT superframe, the PTU first broadcasts a beacon using D-Tx/Rx. Upon receiving the beacon from the PTU, the PRU transmits energy harvesting information, such as the node identifier (ID), residual energy, maximum battery capacity, and distance from the PTU, to the PTU.
This transmission of energy harvesting information for each PRU is performed only once throughout the entire network lifetime. The PTU and PRUs then exchange control messages and data packets using CSMA/CA. At the beginning of the WET superframe, the PTU performs the DPS allocation, which consists of three operations: calculating the number of DPSs required for individual PRUs to be fully charged, calculating the number of DPSs to be allocated to individual PRUs, and determining the charging priority for individual PRUs.
After the DPS allocation is completed, the PTU broadcasts the PTU beacon to notify PRUs of the scheduled WET superframe structure in the beacon subslot of the first DPS in the WET superframe. Then, in the beacon subslot in the subsequent DPSs allocated to individual PRUs, the PRU sends its PRU beacon to the PTU. With the PRU beacon, the PTU acquires the direction of the PRU and transfers power to the corresponding PRU in the WET subslot.
In estimating the residual energy of individual PRUs, the PTU first calculates the number of beacon, successful, collided, and idle slots in the previous WIT superframe. The beacon slot indicates a slot used by the PTU and PRU to transmit and receive the beacon. The successful slot indicates a slot used for successful transmission between the PTU and PRU. The collided slot indicates a slot in which collision occurs due to the data packets simultaneously transmitted from two or more PRUs. The idle slot is one in which no PRUs have transmitted the data packets due to the random backoff. It is assumed that n PRUs in the network always have the data packets to transmit in a saturation condition. The PTU maintains the node ID of PRUs (i.e., ID), the distance from itself to each PRU obtained from the received PRU beacons (i.e., D), the neighbor’s node ID of each PRU (i.e., Nbr(i)), and the number of data packets received from each PRU during the previous superframe (i.e., Npkt), which are represented by the matrices, as in Equation (2).
I D = [ i d ( 1 ) ,   i d ( 2 ) ,   , i d ( i ) ,   ,   i d ( n ) ] ,       0 < i n D = [ d ( 1 ) ,   d ( 2 ) ,   ,     d ( i ) ,   , d ( n ) ] ,       0 < i n N b r ( i ) = [ i d ( i , 1 ) ,   i d ( i , 2 ) ,   ,   i d ( i , l ) ]   ,       0 < i n ,       0 l ( n 1 ) N p k t = [ n p k t ( 1 ) ,   n p k t ( 2 ) ,   , n p k t ( i ) , ,   n p k t ( n ) ] ,       0 < i n ,
where i d ( i ) is the node ID for the i-th PRU, n is the number of PRUs in the network, d ( i ) is the distance from the PTU to the i-th PRU, i d ( i , l ) is the node ID of the l-th neighbor PRU of the i-th PRU, and n p k t ( i ) is the number of data packets received from the i-th PRU during the previous WIT superframe.
The number of beacon and successful slots in the previous WIT superframe can be calculated using L b e a c o n and Npkt, where L b e a c o n is the length of the beacon subslot of DPS. We calculate the number of collided and idle slots by considering the collision and idle probabilities in the remaining slots except for beacon and successful slots in the previous WIT superframe as p c o l and p i d l e , respectively [29]. p c o l is the probability that two or more PRUs transmit the data packet in a randomly chosen slot excluding beacon and successful slots in the previous WIT superframe, as defined by Equation (3).
p c o l = k = 2 n ( n k )   τ k ( 1 τ ) n k ,
where τ is the probability that the PRU transmits a data packet in a randomly chosen slot excluding beacon and successful slots in the previous WIT superframe. p i d l e is the probability that no PRU transmits a data packet in a randomly chosen slot, excluding beacon and successful slots in the previous WIT superframe, as defined by Equation (4).
p i d l e = 1 p c o l
The total number of slots in the previous WIT superframe, n t o t a l S l o t s , can then be calculated by Equation (5).
n t o t a l S l o t s = L d a t a S F / L B P ,
where L B P is the slot length, which is the same as a unit backoff period. The numbers of beacon, successful, collided, and idle slots in the previous WIT superframe, n b e a c o n S l o t s , n s u c c S l o t s , n c o l S l o t s , and n i d l e S l o t s , can be calculated by Equations (6)–(9), respectively.
n b e a c o n S l o t s = L b e a c o n / L B P
n s u c c S l o t s = ( L s u c c i = 1 n n p k t , i ) / L B P
n c o l S l o t s = p c o l ( n t o t a l S l o t s n b e a c o n S l o t s n s u c c S l o t s )
n i d l e S l o t s = p i d l e ( n t o t a l S l o t s n b e a c o n S l o t s n s u c c S l o t s ) ,
where L s u c c is the time taken for successful transmission between the PTU and PRUs. Figure 4 illustrates the timing diagrams for the successful transmission and collision. L d a t a , L S I F S , L A C K , and L D I F S are the length of a data packet, a short inter-frame space (SIFS), an acknowledgment (ACK), and a distributed inter-frame space (DIFS), respectively.
The PTU then calculates E b e a c o n , i , E s u c c , i , E c o l , i , and E i d l e , i which are the amounts of energy consumed by the i-th PRU in the beacon, successful, collided, and idle slots in the previous WIT superframe, respectively, considering the timing diagrams. E b e a c o n , i is the energy consumed by the i-th PRU to receive the beacon, as defined by Equation (10).
E b e a c o n , i = n b e a c o n S l o t s E r x L B P ,
where E r x is the energy consumed per second by a PRU when its D-Tx/Rx is in the Rx state. E s u c c , i is the energy consumed by the i-th PRU during successful slots in the previous WIT superframe, as defined by Equation (11).
E s u c c , i = E s u c c T x , i + E s u c c R x , i + E s u c c I d l e , i ,
where E s u c c T x , i is the energy consumed by the successful transmission of the i-th PRU when its D-Tx/Rx is in the Tx state. E s u c c R x , i is the energy consumed by the successful transmission of neighbors of the i-th PRU when its D-Tx/Rx is in the Rx state. Specifically, E s u c c R x , i is the energy consumption of the i-th PRU in successful slots when it overhears the data packets transmitted by other PRUs in the previous WIT superframe.
Furthermore, E s u c c I d l e , i is the energy consumed by the successful transmission of the PRUs not adjacent to the i-th PRU when the D-Tx/Rx is in an idle state. E s u c c T x , i can be calculated by Equation (12).
E s u c c T x , i = n p k t , i ( E t x L d a t a + E r x L A C K + E i d l e ( L S I F S + L D I F S ) ) ,
where E t x and E i d l e are the energy consumed per second by the PRU when its D-Tx/Rx is in the Tx and idle states, respectively. E s u c c R x , i can be calculated by Equation (13).
E s u c c R x , i = n s u c c N b r , i ( E r x L d a t a + E i d l e L A C K + E i d l e ( L S I F S + L D I F S ) ) ,
where n s u c c N b r , i is the total number of data packets successfully transmitted to the PTU by neighbor PRUs of the i-th PRU. E s u c c I d l e , i can be calculated by Equation (14).
E s u c c I d l e , i = ( n s u c c S l o t s ( n p k t , i L d a t a ) ( n s u c c N b r , i L d a t a ) ) E i d l e L B P
E c o l , i is the energy consumed by the i-th PRU during collided slots in the previous WIT superframe, as defined by Equation (15).
E c o l , i = E c o l T x , i + E c o l R x , i + E c o l I d l e , i ,
where E c o l T x , i is the energy consumed by the data packet transmission of the i-th PRU when one or more other PRUs transmits the data packet simultaneously. E c o l R x , i is the energy consumed by the i-th PRU due to the collision caused by two or more PRUs including at least one neighbor. Specifically, E c o l R x , i is the energy consumption of the i-th PRU when it overhears the data packets transmitted by two or more PRUs, including at least one neighbor, simultaneously. E c o l I d l e , i is the energy consumed by the i-th PRU when two or more PRUs, excluding itself and its neighbors, transmit the data packet simultaneously. In this case, two or more PRUs outside the transmission range of the i-th PRU transmit the data packet simultaneously. E c o l T x , i , E c o l R x , i , and E c o l I d l e , i can be calculated by Equations (16)–(18), respectively.
E c o l T x , i = n c o l S l o t s ( E t x L d a t a + E i d l e L D I F S ) ( τ k = 1 n 1 ( n 1 k ) τ k ( 1 τ ) n k 1 ) ,       1 k ( n 1 )
E c o l R x , i = ( n c o l S l o t s ( E r x L d a t a + E i d l e L D I F S ) ( 1 τ ) k = 2 n 1 ( n 1 k ) τ k ( 1 τ ) n k 1 ) E c o l I d l e , i ,       2 k ( n 1 )
E c o l I d l e , i = n c o l S l o t s E i d l e ( ( 1 τ ) ( 1 τ ) n n b r , i k = 2 n n n b r , i 1 ( n n n b r , i 1 k ) τ k ) ,       2 k ( n n n b r , i 1 )
Finally, E i d l e , i is the energy consumed by the i-th PRU during the idle slots in the previous WIT superframe when its D-Tx/Rx is in an idle state, as defined by Equation (19).
E i d l e , i = n i d l e S l o t s E i d l e L B P
For estimating the residual energy of the i-th PRU, the PTU must calculate not only the energy consumed by the i-th PRU but also the energy harvested by the i-th PRU (i.e., E r x , i ) in the previous WET superframe, as defined by Equation (20).
E r x , i = k = 1 n D P S , i E D P S , i ,
where n D P S , i is the number of DPSs allocated to the i-th PRU in the previous WET superframe. E D P S , i is the energy harvested by the i-th PRU during one DPS, as defined by Equation (21).
E D P S , i = η P r , i L W E T ,
where η is the energy harvesting efficiency of the PRU, P r , i is the power received per second of the i-th PRU (refer to Equation (1) in Section 2), and L W E T is the length of the WET subslot.
Consequently, the residual energy of the i-th PRU (i.e., E r e s , i ) can be represented by Equation (22).
E r e s , i = E r e s , i E b e a c o n , i E s u c c , i E c o l , i E i d l e , i + E r x , i
Based on the knowledge of the residual energy estimation for individual PRUs, the PTU performs the DPS allocation at the beginning of every WET superframe. Algorithm 1 presents the DPS allocation procedure, which consists of three operations: (1) the calculation of the number of DPSs required for individual PRUs to be fully charged, (2) the calculation of the number of DPSs to be allocated to individual PRUs, and (3) the determination of charging priority for individual PRUs.
Algorithm 1. DPS allocation
1:INITIALIZE  N D P S to [], N s o r t e d D P S to [], I D P S to [], I s t a r t D P S to [], S D P S to 0,
       n r e q D P S , i to 0, c n t to 2, n a v a D P S to n t o t a l D P S 1 , E max , i to 1
2:/* Calculation of the number of DPSs required for individual PRUs to be fully charged */
3:FOR each PRU, i , i [ 1 , n ]
4: n r e q D P S , i ( E max , i E r e s , i ) / E D P S , i
5: S D P S S D P S + n r e q D P S , i
6:ENDFOR
7:/* Calculation of the number of DPSs to be allocated to individual PRUs */
8:FOR each PRU, i , i [ 1 , n ]
9: n D P S , i r o u n d ( n a v a D P S ( n r e q D P S , i / S D P S ) )
10: N D P S [ i ] n D P S , i
11:ENDFOR
12:/* Determination of the charging priority for individual PRUs */
13: [ N s o r t e d D P S , I D P S ] s o r t ( N D P S , d e s c e n d )
14:FOR each PRU, i , i [ 1 , n ]
15: I s t a r t D P S [ I D P S [ i ] ] c n t
16: c n t c n t + N s o r t e d D P S [ i ]
17:ENDFOR
18:RETURN  N D P S and I s t a r t D P S
In the algorithm, the PTU initializes the attributes and variables (i.e., I D P S , I s t a r t D P S , N D P S , N s o r t e d D P S , S D P S , n r e q D P S , i , cnt, n a v a D P S , and E max , i ), where I D P S and I s t a r t D P S are the attributes to store the indices of the PRUs, N D P S and N s o r t e d D P S are the attributes to track the number of DPSs allocated to them, and S D P S , n r e q D P S , i , cnt, n a v a D P S , and E max , i are the variables for counting the number of DPSs. I D P S includes the indices of elements in N D P S before N D P S is sorted in descending order as N s o r t e d D P S . I s t a r t D P S includes the starting indices of DPSs allocated to individual PRU in the WET superframe. N D P S includes the numbers of DPSs allocated to PRUs. N s o r t e d D P S is N D P S sorted in descending order according to the values of elements included in N D P S . I D P S , I s t a r t D P S , N D P S , and N s o r t e d D P S are represented by one-dimensional arrays. S D P S is the sum of the number of DPSs required by PRUs, n r e q D P S , i , which is the number of DPSs required for the i-th PRU to be fully charged from the current residual energy to the maximum battery capacity. cnt is a counter value used to calculate the starting index of DPSs allocated to individual PRU in the WET superframe. n a v a D P S is the number of available DPSs in the WET superframe excluding the first DPS and DPSs already allocated to PRUs, initialized to n t o t a l D P S 1 . n t o t a l D P S is the total number of DPSs in the WET superframe.
In the first operation, the PTU obtains the number of DPSs required for individual PRUs to be fully charged (i.e., n r e q D P S , i ), calculated using the energy required for each PRU’s battery to be charged to its maximum battery capacity (i.e., E max , i E r e s , i ) and the energy harvested during one DPS (i.e., E D P S , i ) (line 4). The PTU then calculates the sum of the number of DPSs required by all PRUs (i.e., S D P S ) (line 5).
In the second operation, the PTU obtains the number of DPSs to be allocated to individual PRUs (i.e., n D P S , i ) according to the ratio of the number of DPSs required by each PRU to the sum of the number of DPSs required by all PRUs (i.e., n r e q D P S , i / S D P S ) (line 9). Accordingly, the PTU maintains the list of the number of DPSs to be allocated to individual PRUs (i.e., N D P S [ i ] ) (line 10).
Finally, the PTU determines the charging priority for individual PRUs by sorting N D P S [ i ] in descending order according to the number of DPSs (line 13). The starting index of the DPSs in the WET superframe allocated to each PRU is calculated according to the charging priority for individual PRUs (line 15). Consequently, the PRU with low residual energy can perform the energy harvesting ahead of other PRUs.
After completing the DPS allocation algorithm, the PTU includes the number of DPSs (i.e., N D P S ) and the starting index (i.e., I s t a r t D P S ) of DPSs allocated to PRUs in the PTU beacon and broadcasts the PTU beacon. Based on the results of DPS scheduling, the PTU transfers power to the PRUs, and the PRUs perform energy harvesting.

4. Performance Evaluation

We evaluated the performance of REE-MAC using experimental simulations with the MATLAB simulator. The simulation results were compared with those of FF-WPT [25] and HE-MAC [19]. FF-WPT is an out-of-band solution that transfers power to devices using a different frequency band separated from that used to transmit data packets. In contrast, HE-MAC is an in-band solution that performs both power transfer and data transmission within the same frequency band. In the following subsections, we present in detail the simulation setup and configuration and the simulation results.

4.1. Simulation Configuration

In the simulation, we considered a WPSN consisting of one PTU and multiple PRUs. We assumed that each PRU is randomly deployed within the communication range of the PTU, set to 4 m. We further assumed that the PRU always has the data packets to transmit to the PTU. In the simulation, the number of PRUs varies from 2 to 20. The performance of REE-MAC was compared with those of FF-WPT [25] and HE-MAC [19] in terms of average harvested energy, average consumed energy, average freezing time, residual energy distribution, throughput distribution, and fairness indices for residual energy and throughput.
We investigated fairness by considering the freezing state, which indicates a state of the device in which the PRU cannot transmit the data packets due to a lack of residual energy. In the simulation, the PRU enters the freezing state when the residual energy is less than a pre-configured energy threshold. Then, if it exceeds a pre-configured active threshold, it is released from the freezing state. The active threshold indicates the minimum residual energy required for the PRU to resume the data packet transmission in the freezing state. It is set larger than the energy threshold to prevent the PRUs from entering the freezing state again immediately after they are released from the freezing state.
In FF-WPT, the WET operation is performed according to TDMA-based round-robin scheduling, while the WIT operation is performed using the CSMA/CA scheme. In FF-WPT, the interval required for exchanging control messages was set to 300 µs. Furthermore, the number of energy frames of each PRU is determined considering packet size and harvested energy per second. In HE-MAC, the arbitration inter-frame spaces (AIFSs) for PTU and PRU (i.e., A I F S P T U and A I F S P R U ) were set to 50 and 70 µs, respectively. The simulation was iterated 50 times. The detailed simulation parameters are listed in Table 1.

4.2. Simulation Results

Figure 5a,b illustrate the variations in the average harvested energy for 100- and 200-byte packets, respectively. The average harvested energy decreases as the number of PRUs in the network increases due to decreased energy harvested by individual PRUs per WET superframe. In both figures, REE-MAC exhibits a higher average harvested energy compared with both FF-WPT and HE-MAC. Regarding the DPS allocation operation, REE-MAC requires a shorter time overhead than FF-WPT. In REE-MAC, the PTU performs DPS allocation by estimating the residual energy for individual PRUs and informs the PRUs of the number of allocated DPSs through a PTU beacon at the beginning of the WET superframe. Therefore, REE-MAC entails only time overhead for sending one PTU beacon.
In contrast, FF-WPT incurs a long time overhead because, in FF-WPT, the PTU needs to exchange control messages with all PRUs to obtain the distance between itself and each PRU. Furthermore, HE-MAC exhibits the lowest average harvested energy because, in HE-MAC, the exchange of control messages, the transmission of data packets, and energy harvesting are all performed in the same frequency band.
As presented in Table 2, the average harvested energy of REE-MAC and FF-WPT are almost identical, even if the packet size increases from 100 to 200 bytes, because the packet size does not affect the average harvested energy of PRUs in out-of-band approaches. However, in HE-MAC, the average harvested energy decreases slightly when the packet size increases from 100 to 200 bytes because the proportion of the energy harvesting time within the WET superframe is reduced. Quantitatively, the average harvested energy of REE-MAC is 17.79% and 18.38% higher than that of FF-WPT when the PRUs transmit the 100- and 200-byte packets, respectively. Moreover, the average harvested energy of REE-MAC is 132.15% and 159.04% higher than that of HE-MAC when the PRUs transmit the 100- and 200-byte packets, respectively.
Figure 6a,b illustrate the variations in the average consumed energy for 100- and 200-byte packets, respectively. In REE-MAC, the average consumed energy decreases as the number of PRUs increases because the number of data packets transmitted by PRUs gradually decreases due to the increase in collisions and backoff delay. Consequently, the number of transmissions of PRUs is reduced, reducing the energy consumed by PRUs. In FF-WPT, as in REE-MAC, the average consumed energy tends to decrease overall as the number of PRUs increases.
Furthermore, FF-WPT exhibits an average consumed energy similar to REE-MAC. However, in some sections (i.e., when the number of PRUs is 14 to 18), the average consumed energy of FF-WPT slightly increases. As the number of PRUs increases, the energy each PRU can harvest decreases, and accordingly, the number of PRUs entering the freezing state increases. Therefore, a relatively small number of PRUs transmit data packets to the PTU, and the average consumed energy can increase due to the reduced contention level.
HE-MAC exhibits lower average consumed energy compared with both REE-MAC and FF-WPT. In HE-MAC, the PRUs have relatively few transmission opportunities for data packets because both WET and WIT operations are performed within the same frequency band. Therefore, a small number of data packet transmissions reduces the energy consumed by the PRU. Quantitatively, when the PRUs transmit 100- and 200-byte packets, the average consumed energy of REE-MAC is 7.79% and 8.29% higher than that of FF-WPT, respectively. Moreover, it is 43.78% and 43.74% higher compared with HE-MAC, respectively.
Figure 7a,b illustrate the variations in the average freezing time for 100- and 200-byte packets, respectively. The freezing time is the time the PRU is in the freezing state. As the number of PRUs increases, the energy harvested by each PRU decreases, and accordingly, the average freezing time of PRUs is highly likely to increase. REE-MAC exhibits a shorter average freezing time than both FF-WPT and HE-MAC. In REE-MAC, the DPS allocation is performed considering the residual energy of individual PRUs. Accordingly, in REE-MAC, PRUs with less residual energy are allocated more DPSs within the superframe. Therefore, all PRUs in the network maintain similar residual energy, and the time they are in the freezing state is relatively short.
When the sizes of data packets transmitted by PRUs are 100 and 200 bytes, the average freezing time of REE-MAC is almost zero until the numbers of PRUs are 10 and 12, respectively. However, if the numbers of PRUs exceed 10 and 12, the average freezing time of REE-MAC increases as the number of PRUs increases. FF-WPT consistently exhibits a longer average freezing time than both REE-MAC and HE-MAC because, in FF-WPT, the PTU transfers power to PRUs according to the distance without considering the residual energy of PRUs. Furthermore, individual PRUs harvest smaller energy due to the exchange of control messages required for WET operation. Accordingly, in FF-WPT, PRUs enter the freezing state more frequently.
When the number of PRUs is more than 12, the average freezing time of FF-WPT increases gradually. When the number of PRUs is increased to more than 12, the PRUs enter the freezing state more quickly due to the decrease in harvested energy. Therefore, it takes longer for the residual energy of PRUs in the freezing state to reach the active threshold.
In HE-MAC, the PRU occupying the channel uses the harvest-then-transmit scheme. Therefore, the PRU first harvests the energy required to transmit the data packet and then uses it to transmit the data packet. Other PRUs maintain an idle state to minimize energy consumption. Consequently, the average freezing time of HE-MAC is shorter than that of FF-WPT. Quantitatively, when the PRUs transmit 100- and 200-byte packets, the average freezing time of REE-MAC is 72.03% and 90.04% shorter than that of FF-WPT, respectively. It is also 47.26% and 81.15% shorter than that of HE-MAC.
Figure 8a,b illustrate the variations in the residual energy distribution of individual PRUs for 100- and 200-byte packets, respectively. Both figures indicate the residual energy distribution of individual PRUs in a specific round of the experimental simulation. In REE-MAC and FF-WPT, when the packet size increases, the residual energy of individual PRUs decreases due to an increase in the consumed energy.
In HE-MAC, the number of dead PRUs increases. A dead PRU indicates a PRU with a residual energy of zero. In REE-MAC, the difference between the residual energy of individual PRUs is slight compared with both FF-WPT and HE-MAC. REE-MAC enables PRUs to maintain similar residual energy through the DPS allocation considering the residual energy. In FF-WPT, the fluctuation in the residual energy distribution of individual PRUs is larger than that of REE-MAC because the DPSs are allocated considering only the distance between the PTU and individual PRUs. In HE-MAC, the residual energy of individual PRUs is almost zero except when the number of PRUs is 2 because the PRUs consume additional energy in addition to data packet transmission, and the residual energy of the PRUs gradually decreases. Consequently, in HE-MAC, more dead PRUs occur compared with REE-MAC and FF-WPT.
Figure 9a,b illustrate the variations in the throughput distribution of individual PRUs for 100- and 200-byte packets, respectively. Both figures indicate the throughput distribution of individual PRUs in a specific round of the experimental simulation. The fluctuation of the throughput distribution increases as the number of PRUs in the network increases. Moreover, when the packet size increases, the throughput of individual PRUs increases due to the decrease in the backoff delay. REE-MAC exhibits a constant throughput distribution regardless of the number of PRUs, compared with FF-WPT and HE-MAC. In REE-MAC, all PRUs in the network maintain similar throughput performance.
From the results of Figure 7 and Figure 8, in REE-MAC, the PRUs maintain the shortest freezing time, on average, and dead PRUs with zero residual energy rarely occur. Therefore, compared with FF-WPT and HE-MAC, the PRUs using REE-MAC can have relatively even transmission opportunities. However, in FF-WPT and HE-MAC, the transmission opportunity is biased toward some PRUs as the number of PRUs in the network increases. Accordingly, in FF-WPT and HE-MAC, the throughput distribution for specific PRUs becomes severely concentrated.
Figure 10a,b illustrate the fairness index for residual energy for 100- and 200-byte packets, respectively. The fairness index for residual energy ( F r e s ) can be calculated by Equation (23) [30].
F r e s = ( i n x i 2 ) n i = 1 n x i 2 ,
where n is the number of PRUs and x i is the fairness parameter, which represents the residual energy of the i-th PRU.
In REE-MAC, the fairness index for residual energy decreases and then increases again as the number of PRUs increases. For 100- and 200-byte packets, when the number of PRUs is 10 and 14 or less, respectively, the fairness index for residual energy of REE-MAC decreases as the number of PRUs increases. As the number of PRUs in the network increases, the difference in the residual energy between individual PRUs increases due to a decrease in the energy harvested by individual PRUs and the difference in the energy consumed by individual PRUs (refer to Figure 8).
In contrast, when the numbers of PRUs are larger than 10 and 14, respectively, the fairness index for residual energy of REE-MAC increases as the number of PRUs increases. As the number of PRUs increases, the energy harvested by individual PRUs decreases, and the number of PRUs in the freezing state increases accordingly. PRUs in the freezing state perform only WET operations until their residual energy reaches the active threshold. Therefore, as the residual energy of many PRUs in the freezing state approaches the active threshold, the fairness index for residual energy increases.
However, in FF-WPT and HE-MAC, the fairness index for residual energy decreases as the number of PRUs in the network increases. As depicted in Figure 7, the gap in transmission opportunities between PRUs increases as the average freezing time of PRUs increases. This gap increases the difference between the energy consumed by individual PRUs. Therefore, the fairness index for residual energy gradually decreases as the difference between the residual energy of individual PRUs increases. Quantitatively, when the PRUs transmit 100- and 200-byte packets, the fairness index for residual energy of REE-MAC is 95.34% and 116.23% higher than that of FF-WPT, respectively. It is also 165.88% and 276.00% higher compared with that of HE-MAC, respectively.
Figure 11a,b illustrate the fairness index for throughput for 100- and 200-byte packets, respectively. The fairness index for throughput ( F t h ) can be calculated by Equation (24).
F t h = ( i n y i 2 ) n i = 1 n y i 2 ,
where n is the number of PRUs and y i is the fairness parameter indicating the number of data packets that the i-th PRU transmits to the PTU.
In each case of 100- and 200-byte packets, REE-MAC maintains the fairness index for throughputs of 0.924 and 0.956 or higher, respectively, regardless of the number of PRUs. As the number of PRUs increases, the energy harvested by individual PRUs decreases and the difference in energy consumed by individual PRUs increases. Nevertheless, in REE-MAC, the residual energy of PRUs is maintained similar to each other due to DPS allocation considering the residual energy of individual PRUs. Accordingly, individual PRUs achieve a high fairness index for throughput by having a similar transmission opportunity.
In contrast, FF-WPT exhibits a lower fairness index for throughput compared with both REE-MAC and HE-MAC. From the results in Figure 7, in FF-WPT, PRUs maintain the longest freezing time on average. The difference in throughput performance between PRUs in FF-WPT becomes significant because the increase of the freezing time causes the transmission opportunities to be biased to some PRUs. The fairness index for throughput of FF-WPT decreases as the number of PRUs increases regardless of the packet size because the average freezing time of PRUs increases due to the decrease in the energy harvested by individual PRUs.
HE-MAC exhibits a higher fairness index for throughput than FF-WPT regardless of the packet size. In HE-MAC, PRUs that are not in the freezing state maintain similar residual energy through the harvest-then-transmit scheme, and thus they have a relatively similar transmission opportunity. Quantitatively, when the PRUs transmit 100- and 200-byte packets, the fairness index for throughput of REE-MAC is 98.58% and 91.80% higher than that of FF-WPT, respectively. It is also 44.46% and 55.91% higher compared with HE-MAC, respectively.

5. Conclusions

This paper presents the REE-MAC protocol for WPSNs, which aims to reduce overhead due to control messages for scheduling the WET operation and provide fairness for data transmission opportunities to the sensor devices. REE-MAC achieves low overhead by numerically estimating the residual energy of individual PRUs without exchanging control messages. Furthermore, in REE-MAC, the PTU allocates the DPSs inversely proportional to the residual energy of individual PRUs, so that all PRUs in the network maintain similar residual energy. Thereby, it minimizes the energy depletion of some PRUs and provides individual PRUs with a fair data transmission opportunity. At the beginning of each superframe, the PTU calculates the consumed and harvested energy of individual PRUs and then estimates their residual energy. It then performs the DPS allocation based on the results of the residual energy estimation.
We conducted an experimental simulation to evaluate the performance of REE-MAC under the environment of changing network size and packet size. The results demonstrate that REE-MAC uses the residual energy estimation to reduce unnecessary waste of bandwidth due to the exchange of control messages, increasing the energy harvested by individual PRUs. Moreover, REE-MAC prevents the DPSs from biased allocation to some PRUs, reducing the freezing time of the PRUs due to lack of energy.
These operations of REE-MAC give similar transmission opportunities to PRUs in the network, ensuring higher fairness compared with FF-WPT and HE-MAC in terms of residual energy and throughput. On average, REE-MAC achieves 18.08% and 145.60% higher energy harvested, 81.03% and 64.21% shorter average freezing time, 105.79% and 220.94% higher fairness index for residual energy, and 95.19% and 50.18% higher fairness index for throughput, compared with FF-WPT and HE-MAC, respectively.

Author Contributions

Conceptualization, S.-B.L. and E.-J.K.; methodology, S.-B.L., J.-H.K. and E.-J.K.; software, S.-B.L., J.-H.K. and E.-J.K.; validation, S.-B.L. and E.-J.K.; formal analysis, S.-B.L. and E.-J.K.; investigation, J.-H.K. and E.-J.K.; resources, E.-J.K.; data curation, J.-H.K.; writing—original draft preparation, S.-B.L., J.-H.K. and E.-J.K.; writing—review and editing, S.-B.L., J.-H.K. and E.-J.K.; visualization, S.-B.L.; supervision, E.-J.K.; project administration, E.-J.K.; funding acquisition, J.-H.K. and E.-J.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2020R1I1A3052733 and NRF-2019R1I1A1A01059787). This work was also supported by the NRF grant funded by the Korea government (MSIT) (NRF-2021R1C1C2095696).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Choi, K.W.; Ginting, L.; Rosyady, P.A.; Aziz, A.A.; Kim, D.I. Wireless-powered sensor networks: How to realize. IEEE Trans. Wirel. Commun. 2017, 16, 221–234. [Google Scholar] [CrossRef]
  2. Perera, T.D.P.; Jayakody, D.N.K.; Sharma, S.K.; Chatzinotas, S.; Li, J. Simultaneous wireless information and power transfer (SWIPT): Recent advances and future challenges. IEEE Commun. Surv. Tutor. 2018, 20, 264–302. [Google Scholar] [CrossRef] [Green Version]
  3. Setiawan, D.; Aziz, A.A.; Kim, D.I.; Choi, K.W. Experiment, modeling, and analysis of wireless-powered sensor network for energy neutral power management. IEEE Syst. J. 2018, 12, 3381–3392. [Google Scholar] [CrossRef] [Green Version]
  4. Bi, S.; Ho, C.K.; Zhang, R. Wireless powered communication: Opportunities and challenges. IEEE Commun. Mag. 2015, 53, 117–125. [Google Scholar] [CrossRef] [Green Version]
  5. Ramezani, P.; Jamalipour, A. Toward the evolution of wireless powered communication networks for the future Internet of Things. IEEE Netw. 2017, 31, 62–69. [Google Scholar] [CrossRef]
  6. Du, R.; Shokri-Ghadikolaei, H.; Fischione, C. Wirelessly-powered sensor networks: Power allocation for channel estimation and energy beamforming. IEEE Trans. Wirel. Commun. 2020, 19, 2987–3002. [Google Scholar] [CrossRef]
  7. Du, R.; Xiao, M.; Fischione, C. Optimal node deployment and energy provision for wirelessly powered sensor networks. IEEE J. Sel. Areas Commun. 2019, 37, 407–423. [Google Scholar] [CrossRef]
  8. López, O.L.A.; Alves, H.; Souza, R.D.; Montejo-Sánchez, S.; Fernández, E.M.G.; Latva-Aho, M. Massive wireless energy transfer: Enabling sustainable IoT towards 6G era. IEEE Internet Things J. 2021, 8, 8816–8835. [Google Scholar] [CrossRef]
  9. Clerckx, B.; Huang, K.; Varshney, L.R.; Ulukus, S.; Alouini, M.-S. Wireless power transfer for future networks: Signal processing machine learning computing and sensing. IEEE J. Sel. Top. Signal Process. 2021, 15, 1060–1094. [Google Scholar] [CrossRef]
  10. Chu, Z.; Zhou, F.; Zhu, Z.; Hu, R.Q.; Xiao, P. Wireless powered sensor networks for Internet of Things: Maximum throughput and optimal power allocation. IEEE Internet Things J. 2018, 5, 310–321. [Google Scholar] [CrossRef]
  11. Mai, V.V.; Shin, W.-Y.; Ishibashi, K. Wireless power transfer for distributed estimation in sensor networks. IEEE J. Sel. Top. Signal Process. 2017, 11, 549–562. [Google Scholar] [CrossRef] [Green Version]
  12. Hong, Y.-W.P.; Hsu, T.-C.; Chennakesavula, P. Wireless power transfer for distributed estimation in wireless passive sensor networks. IEEE Trans. Signal Process. 2016, 64, 5382–5395. [Google Scholar] [CrossRef]
  13. Shi, H.; Prasad, R.V.; Onur, E.; Niemegeers, I.G.M.M. Fairness in wireless networks: Issues measures and challenges. IEEE Commun. Surv. Tutor. 2014, 16, 5–24. [Google Scholar] [CrossRef]
  14. Lu, X.; Wang, P.; Niyato, D.; Kim, D.I.; Han, Z. Wireless networks with RF energy harvesting: A contemporary survey. IEEE Commun. Surv. Tutor. 2015, 17, 757–789. [Google Scholar] [CrossRef] [Green Version]
  15. Lei, M.; Zhang, X.; Ding, H.; Yu, B. Fairness-aware resource allocation in multi-hop wireless powered communication networks with user cooperation. Sensors 2018, 18, 1890. [Google Scholar] [CrossRef] [Green Version]
  16. Zhu, Z.; Peng, J.; Gu, X.; Li, H.; Liu, K.; Zhou, Z.; Liu, W. Fair resource allocation for system throughput maximization in mobile edge computing. IEEE Access 2018, 6, 5332–5340. [Google Scholar] [CrossRef]
  17. Naderi, M.Y.; Nintanavongsa, P.; Chowdhury, K.R. RF-MAC: A medium access control protocol for re-chargeable sensor networks powered by wireless energy harvesting. IEEE Trans. Wirel. Commun. 2014, 13, 3926–3937. [Google Scholar] [CrossRef]
  18. Iqbal, A.; Kim, Y.; Lee, T.-J. Access mechanism in wireless powered communication networks with harvesting access point. IEEE Access 2018, 6, 37556–37567. [Google Scholar] [CrossRef]
  19. Ha, T.; Kim, J.; Chung, J.-M. HE-MAC: Harvest-then-transmit based modified EDCF MAC protocol for wireless powered sensor networks. IEEE Trans. Wirel. Commun. 2018, 17, 3–16. [Google Scholar] [CrossRef]
  20. Ju, H.; Zhang, R. Throughput maximization in wireless powered communication networks. IEEE Trans. Wirel. Commun. 2014, 13, 418–428. [Google Scholar] [CrossRef] [Green Version]
  21. Hadzi-Velkov, Z.; Nikoloska, I.; Chingoska, H.; Zlatanov, N. Opportunistic scheduling in wireless powered communication networks. IEEE Trans. Wirel. Commun. 2017, 16, 4106–4119. [Google Scholar] [CrossRef]
  22. Yao, Q.; Huang, A.; Shan, H.; Quek, T.Q.S.; Wang, W. Delay-aware wireless powered communication networks—Energy balancing and optimization. IEEE Trans. Wirel. Commun. 2016, 15, 5272–5286. [Google Scholar] [CrossRef]
  23. Cho, S.; Lee, K.; Kang, B.J.; Joe, I. A hybrid MAC protocol for optimal channel allocation in large-scale wireless powered communication networks. EURASIP J. Wirel. Commun. Netw. 2018, 2018, 1–13. [Google Scholar] [CrossRef] [Green Version]
  24. Iannello, F.; Simeone, O.; Spagnolini, U. Medium access control protocols for wireless sensor networks with energy harvesting. IEEE Trans. Commun. 2012, 60, 1381–1389. [Google Scholar] [CrossRef] [Green Version]
  25. Xia, M.; Aissa, S. On the efficiency of far-field wireless power transfer. IEEE Trans. Signal Process. 2015, 63, 2835–2847. [Google Scholar] [CrossRef] [Green Version]
  26. Nobar, S.K.; Niya, J.M.; Tazehkand, B.M. Performance analysis of cognitive wireless powered communication networks under unsaturated traffic condition. IEEE Trans. Green Commun. Netw. 2020, 4, 819–831. [Google Scholar] [CrossRef]
  27. Kwon, J.-H.; Kim, E.-J. Asymmetric directional multicast for capillary Machine-to-Machine using mmWave communications. Sensors 2016, 16, 515. [Google Scholar] [CrossRef]
  28. Cai, L.X.; Cai, L.; Shen, X.; Mark, J.W. REX: A randomized exclusive region based scheduling scheme for mmWave WPANs with directional antenna. IEEE Trans. Wirel. Commun. 2010, 9, 113–121. [Google Scholar] [CrossRef] [Green Version]
  29. Bianchi, G. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Sel. Areas Commun. 2000, 18, 535–547. [Google Scholar] [CrossRef]
  30. Babu, A.V.; Jacob, L. Fairness analysis of IEEE 802.11 multirate wireless LANs. IEEE Trans. Veh. Technol. 2007, 56, 3073–3088. [Google Scholar] [CrossRef]
Figure 1. System architecture of REE-MAC.
Figure 1. System architecture of REE-MAC.
Sensors 21 07617 g001
Figure 2. WET and WIT superframe structure.
Figure 2. WET and WIT superframe structure.
Sensors 21 07617 g002
Figure 3. Overall operation of REE-MAC.
Figure 3. Overall operation of REE-MAC.
Sensors 21 07617 g003
Figure 4. Timing diagram: (a) successful transmission, (b) collision.
Figure 4. Timing diagram: (a) successful transmission, (b) collision.
Sensors 21 07617 g004
Figure 5. Average harvested energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 5. Average harvested energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g005
Figure 6. Average consumed energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 6. Average consumed energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g006
Figure 7. Average freezing time: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 7. Average freezing time: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g007aSensors 21 07617 g007b
Figure 8. Residual energy distribution of individual PRUs: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 8. Residual energy distribution of individual PRUs: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g008
Figure 9. Throughput distribution of individual PRUs: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 9. Throughput distribution of individual PRUs: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g009
Figure 10. Fairness index for residual energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 10. Fairness index for residual energy: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g010
Figure 11. Fairness index for throughput: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Figure 11. Fairness index for throughput: (a) packet size of 100 bytes; (b) packet size of 200 bytes.
Sensors 21 07617 g011aSensors 21 07617 g011b
Table 1. Simulation parameters.
Table 1. Simulation parameters.
ParameterValueParameterValue
Number of PRUs2–20 d 0–4 m
Data rate2 MbpsMaximum battery capacity1 mJ
WET superframe1 sInitial residual energy0.6 mJ
WIT superframe1 sActive threshold0.6 mJ
DPS length10 msEnergy threshold0.1 mJ
Number of DPSs100 C W min 31
Beacon subslot40 µs C W max 1023
P-Tx/Rx switching subslot10 µs G t 12
WET subslot9950 µs G r 1
RTS20 bytes P t x 31.47 mA
CTS14 bytes P r x 26.94 mA
ACK14 bytes P i d l e 0.00156 mA
SIFS10 µs P t 3000 mW
DIFS50 µs α 2.7
Beacon15 bytes η 0.85
Packet size100–200 bytesSlot length20 µs
Table 2. Average harvested energy (mJ).
Table 2. Average harvested energy (mJ).
Packet SizeProtocolNumber of PRUs
2468101214161820
100 bytesREE-MAC2.651.561.030.760.610.520.480.410.360.31
FF-WPT2.571.470.950.670.510.410.360.300.250.21
HE-MAC1.310.720.480.350.280.240.200.180.160.14
200 bytesREE-MAC2.651.561.030.760.610.520.460.410.360.31
FF-WPT2.571.470.950.670.510.410.360.300.250.21
HE-MAC1.200.650.440.320.250.210.180.160.140.13
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Lee, S.-B.; Kwon, J.-H.; Kim, E.-J. Residual Energy Estimation-Based MAC Protocol for Wireless Powered Sensor Networks. Sensors 2021, 21, 7617. https://doi.org/10.3390/s21227617

AMA Style

Lee S-B, Kwon J-H, Kim E-J. Residual Energy Estimation-Based MAC Protocol for Wireless Powered Sensor Networks. Sensors. 2021; 21(22):7617. https://doi.org/10.3390/s21227617

Chicago/Turabian Style

Lee, Sol-Bee, Jung-Hyok Kwon, and Eui-Jik Kim. 2021. "Residual Energy Estimation-Based MAC Protocol for Wireless Powered Sensor Networks" Sensors 21, no. 22: 7617. https://doi.org/10.3390/s21227617

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop