Radio Frequency Energyharvestingand Managementfor Wireless Sensor Networks
Radio Frequency Energyharvestingand Managementfor Wireless Sensor Networks
net/publication/327185347
CITATIONS READS
58 574
4 authors, including:
Some of the authors of this publication are also working on these related projects:
Special Collection on Wireless Sensor Networks for Pests and Diseases Monitoring: Detection and Control View project
Network Traffic Analysis in an Industrial Environment: A case of BIUST network View project
All content following this page was uploaded by Murtala Zungeru Adamu on 25 August 2018.
Radio Frequency
Energy Harvesting and
Management for Wireless
Sensor Networks
Adamu M. Zungeru, Li-Minn Ang,
S. R. S. Prabaharan, and Kah Phooi Seng
Contents
13.1 Introduction............................................................................................. 342
13.2 RF Energy Harvesting............................................................................. 342
13.3 Review of Energy Harvesting Systems and Power Consumption in
WSNs....................................................................................................... 344
13.3.1 Ambient RF Sources and Available Power.................................... 344
13.4 RF Energy Harvesting and the Use of the Powercast Harvester................345
13.4.1 Intentional Energy Harvesting...................................................... 346
13.4.2 The Powercast TX91501 Powercaster Transmitter......................... 348
13.4.3 Powercast Power Harvester Receiver............................................. 348
13.4.4 Measurement of RF Power Received and Gains.............................349
13.4.4.1 Friis Transmission Equation............................................349
13.4.4.2 Power Density.................................................................350
13.4.5 Energy Storage............................................................................... 351
341
342 ◾ Adamu M. Zungeru, et al.
13.1 Introduction
Radio frequency (RF) energy harvesting holds a promising future for generating
a small amount of electrical power to drive partial circuits in wireless commu-
nicating electronics devices. Reducing power consumption has become a major
challenge in wireless sensor networks. As a vital factor affecting system cost and
lifetime, energy consumption in wireless sensor networks (WSNs) is an emerging
and active research area. This chapter presents a practical approach for RF energy
harvesting, and management of the harvested and available energy for WSNs using
the improved energy efficient ant-based routing algorithm (IEEABR) as our pro-
posed algorithm. The chapter looks at measurement of the RF power density, cal-
culation of the received power, storage of the harvested power, and management of
the power in WSNs. The routing uses IEEABR technique for energy management.
Practical and real-time implementations of the RF energy using Powercast™ har-
vesters and simulations using the energy model of our Libelium Waspmote to verify
the approach were performed.
The chapter is organized in the following format: The first part of the chap-
ter, provided in section 13.2, covers a general perspective and the objective of the
chapter. Section 13.3 reviews energy harvesting systems and power consumption
in WSNs. Section 13.4 gives a detailed explanation of our RF energy harvesting
method using the Powercast harvesters. Section 13.5 looks into the management of
the harvested energy in our WSNs. Section 13.6 presents experimental setup and
results, while also looking at the simulation results and its environment. Finally,
section 13.7 concludes the chapter with an open research problem and future work
to be done, and a comparative summary of our results with the EEABR algorithm,
and ad hoc on-demand distance vector (AODV), which form strong energy man-
agement protocols.
a capacitor that can disperse a constant required voltage for the sensor and circuit
when there is not a sufficient supply of incoming energy. Most circuits use a float-
ing gate transistor as the diode, which converts the signal into generated power,
but is linked to the drain of the transistor, and a second floating gate transistor
linked to a second capacitor can enable a higher output voltage once the capacitors
reach full potential [31].
The effectiveness of energy harvesting depends largely on the amount and pre-
dictable availability of energy sources, whether from radio waves, thermal differ-
entials, solar or light sources, or even vibration sources. There are three categories
for ambient energy availability: intentional, anticipated, and unknown, as shown
in Figure 13.1.
Our research relies basically on the intentional use of the Powercast harvester.
Data Rate 250 kbps 250 kbps 250 kbps 250 kbps
receivers. The intentional energy approach is appropriate for other types of energy
as well, such as placing an energy harvester on a piece of industrial equipment that
vibrates when it is operating. Using an intentional energy source allows designers
to engineer a consistent energy solution. A quick look at the basic operation of the
transmitter and receiving circuit is discussed below.
Figure 13.1 Pictorial view of intentional, anticipated, and unknown energy sources.
348 ◾ Adamu M. Zungeru, et al.
Figure 13.2 (a) A side view and (b) a real view of a TX91501 Powercaster trans-
mitter in its transmission state.
Radio Frequency Energy Harvesting and Management ◾ 349
P2110 1. Design for battery charging and 1. Harvesting range
direct power applications from 850–950 MHz
2. Provide intermittent/pulsed power 2. Works with standard
output 50-ohm antennas
3. Configurable, regulated output
voltage up to 5.25 V
4. Power management and control
I/O for system optimization
P1110 1. Design for battery charging and 1. Harvesting range
direct power applications from 850–950 MHz
2. Configurable over voltage protection 2. Works with standard
up to 4.2 V 50-ohm antennas
3. Connect directly to rechargeable
batteries including alkaline, lithium
ion, and Ni-MH.
2
Pr ⎛ λ ⎞
= Gt Gr ⎜ (13.1)
Pt ⎝ 4 πR ⎟⎠
350 ◾ Adamu M. Zungeru, et al.
where Pr is the received power in watts (W), Pt is the transmitted power, Gt is the
transmitting antenna’s gain, Gr is the receiving antenna’s gain, λ is the wavelength
of the transmitted and received signal in meters, and R is the distance between the
antennas in meters. The gain of the antennas, usually measured in decibels, can be
converted to a power ratio using;
GDB
G = 10 10 (13.2)
c
λ= (13.3)
f
where C is the speed of light in meters per second, and f is the frequency in Hz.
Hence, C is equal to 3 × 108 m/sec.
A simplified version of the Friis equation [33] is provided by the Powercast com-
pany for quick and easy calculation on a spreadsheet, where a reasonable estimate
of the amount of power generated, received, and available for use are calculated.
Pt
PD = (13.4)
4 πR 2
where Pt is the peak or average power, PD the power density, and R the distance
between the transmitter and the receiving antenna. Radars use directional anten-
nas to channel most of the radiated power in a particular direction. The gain (Gt)
of an antenna is the ratio of power radiated in the desired direction as compared to
the power radiated from an isotropic antenna, or:
The power density at a distant point from the radar with an antenna gain of
Gt is the power density from an isotropic antenna multiplied by the radar antenna
gain. Power density from the radar:
PG
t t
PD = (13.6)
4 πR 2
c
T = (13.7)
In
consumption rate higher than the rate of diffusion of the active elements in the
electrolyte. If this process continues for a long time, the electrodes run out of active
material even though the electrolyte has not yet exhausted its active materials. This
situation can be overcome by intermittently drawing current from the battery and
also proper power management techniques.
1. Compared to the complexity of the task they carry out, sensing, processing,
self-managing, and communication, the nodes have been very small in size to
accommodate high-capacity power supplies.
2. While the research community is investigating the contribution of renewable
energy and self recharging mechanisms, the size of nodes is still a constrain-
ing factor.
3. Ideally, a WSN consists of a large number of nodes. This makes manually
changing, replacing, or recharging batteries almost impossible.
4. The failure of a few nodes may cause the entire network to fragment
prematurely.
The problem of power consumption can be approached from two angles. One
is to develop energy efficient communication protocols (self-organization, medium
access, and routing protocols) that take the peculiarities of WSNs into account. The
other is to identify activities in the networks that are both wasteful and unnecessary
and mitigate their impact. Wasteful and unnecessary activities can be described as
local (limited to a node) or global (having a scope network-wide). In either case, these
Radio Frequency Energy Harvesting and Management ◾ 353
If no record is found, the node saves the required information, restarts a timer, and
forwards the ant to the next node. If a record containing the ant identification is
found, the ant is eliminated. When a node receives a backward ant, it searches its
memory to find the next node to where the ant must be sent. In this section, we
modify the EEABR to improve the energy consumption in the nodes of WSNs and
also to improve the performance and efficiency of the networks. The main focus of
this chapter is on IEEABR power management strategies in WSNs.
The algorithm of our proposed power management techniques is as follows.
1
Pld = (13.8)
Nk
∑ l ∈N k
Pld = 1; d = 1, , N (13.9)
9N k − 5
Pdd = (13.10)
4 N k2
Also, for the rest of the neighboring nodes among the neighbors for which
m ∈ Nk will then be:
⎧ 4N k − 5
⎪ , if N k > 1
Pdm = ⎨ 4 N k2 (13.11)
⎪ 0, if N k = 1
⎩
Radio Frequency Energy Harvesting and Management ◾ 355
Of course, equation (13.10) and equation (13.11) satisfy equation (13.9). But,
if none of the neighbors is a destination, equation (13.8) applies to all the
neighboring nodes. Or
4. The forward ant selects the next hop node using the same probabilistic rule
proposed in the ACO (ant colony optimization) metaheuristic:
⎧
⎪
⎪
⎪⎪ [τ(r , s )]α.[ E ( s )]β
Pk (r , s ) = ⎨ , s ∉ Mk
∑
⎪
[τ(r , u )]α.[ E ( s )]β (13.12)
⎪ u∉Mk
⎪
⎪⎩ 0, else
where pk(r, s) is the probability with which ant k chooses to move from node r
to node s, τ is the routing table at each node that stores the amount of phero-
mone trail on connection (r, s), Ε is the visibility function given by (C −1es ) (c is
the initial energy level of the nodes and es is the actual energy level of node s),
and α and β are parameters that control the relative importance of trail versus
visibility. The selection probability is a trade-off between visibility (which says
that nodes with more energy should be chosen with high probability) and
actual trail intensity (which says that if on connection (r, s) there has been a
lot of traffic, then it is highly desirable to use that connection).
5. When a forward ant reaches the destination node, it is transformed into a
backward ant whose mission is now to update the pheromone trail of the path
it used to reach the destination and that is stored in its memory.
6. Before backward ant k starts its return journey, the destination node com-
putes the amount of pheromone trail that the ant will drop during its journey:
1
Δτ = E Mink − Fd k ⎤ (13.13)
C − ⎡⎢
⎣ E Avg k − Fdk ⎦⎥
And, the equation used to update the routing tables at each node is
⎡ Δτ ⎤
τ(r , s ) = (1 − ρ) ∗ τ(r , s ) + ⎢ ⎥ (13.14)
⎣ φ.Bdk ⎦
where ϕ is a coefficient and Bdk is the distance travelled (the number of visited
nodes) by the backward ant k until node r, in which the two parameters will
force the ant to lose part of the pheromone strength during its way to the
source node. The idea behind the behavior is to build a better pheromone
distribution (nodes near the sink node will have greater pheromone levels)
356 ◾ Adamu M. Zungeru, et al.
and will force remote nodes to find better paths. Such behavior is important
when the sink node is able to move, because pheromone adaptation will be
much quicker [41].
7. When the backward ant reaches the node where it was created, its mission is
finished and the ant is eliminated.
By performing this algorithm in several iterations, each node will be able to know
which are the best neighbors (in terms of the optimal function represented by equa-
tion (13.14)) to send a packet toward a specific destination. The flow chart describing
the action of movement of a forward ant for our proposed algorithm is shown in
Figure 13.3. The backward ant takes the opposite direction of the flow chart.
Start
Initialize the
routing table and
get list of
neighboring nodes
No
No
Yes
Die
End
Data Header
after only listening to the NID field of the packet. The Nk is updated with an incre-
ment by one after ensuring that SN is not in the list of the tabus (routing table) of
the chosen node. The next node is determined to update the NID field by performing
the same operation as performed earlier by the first node and the sequence continues
until the packet gets to the sink node. The reversed operation is done for the back-
ward ant as for the acknowledgment, which gets to the source: now the last bus stop
for the backward ant, and it dies off after reaching the source.
12 85 71 952.32
15 37 31 2169.12
18 11 9 7360.56
20 1 1 68339.28
Radio Frequency Energy Harvesting and Management ◾ 359
20 102 85 797.50
25 50 41 1639.00
30 19 16 4353.00
35 5 4 15517.00
36 1 1 70019.00
6 259 65 888.72
7 86 22 2659.92
10 366 92 627.60
12 93 23 2475.00
13 26 7 8750.00
9 15
P2110, Dipole antenna
8
Time between Packets (sec)
Figure 13.5 Variation in time between Packets received and distance of harvesting.
Radio Frequency Energy Harvesting and Management ◾ 361
9 8000
P2110, Dipole antenna P2110, Dipole antenna
8 P2110, Patch antenna 7000 P2110, Patch antenna
7
6000
6
5000
5
4000
4
3000
3
2 2000
1 1000
0 0
4 6 8 10 12 14 16 18 20 22 4 6 8 10 12 14 16 18
Distance (feet) Distance (feet)
(a) Comparison of packet received with (b) Comparison of battery recharge time,
distance using different antenna using dipole and patch antennas with P2110
Figure 13.6 Comparison of power harvesting using dipole and patch antennas
with P2110.
Packet Size 1 Mb
they will be forced to periodically transmit data. Simulations were run for 60 min-
utes (3,600 seconds) each time the simulation started, and the remaining energy of
all nodes was taken and recorded at the end of each simulation. The average energy
was calculated while also noting the minimum energy of the nodes. Figure 13.8
presents the results of the simulation for the studied parameters: the average energy,
and minimum energy of AODV, EEABR, and IEEABR. As can be seen from the
results presented in Figure 13.8, the IEEABR protocol had better results in both
the average energy of the nodes and the minimum energy of nodes experienced at
the end of simulation. The AODV as compared to the EEABR performs worst in all
cases. In term of average energy levels of the network, IEEABR as compared with
EEABR average energy values varies between 2 and 8 percent, while AODV is in
the range of 15 to 22 percent also to the minimum energy of the nodes. Figure 13.7
shows a screenshot of a NAM window of the simulation environment for 10 nodes
randomly deployed, while the results of the simulations are as shown in Figure 13.8.
13.6.3 Real-Time Implementation of RF
Powercast Energy Harvester
The real-time implementation in harvesting RF energy from Powercast harvest-
ers and the management of the power that is harvested, using the IEEABRA, is
1
1
0.95
0.9 0.9
0.85
0.8 0.8
0.75
0.7 0.7
0.65
AODV AODV
0.6 EEABR 0.6 EEABR
0.55 IEEABR IEEABR
0.5 0.5
0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 80 90 100
No. of Nodes No. of Nodes
(a) Average energy of network nodes (b) Energy of node with minimum energy
Figure 13.8 Performance analysis of AODV, EEABR, and IEEABR energy man-
agement protocols.
presented in Figure 13.9. The experiment was set up and available power mea-
sured while also varying the distance between the harvester and transmitter. The
time between each packet delivery, i.e., the harvesting period, were noticed and
recorded. The power consumption of the Waspmote under consideration can be
found in Waspmote: Technical Guide–Libelium [25] and Zigbee Protocol [26].
(d) (e)
The battery powering of the Waspmote is 1,150 mAh at 3.7 V, which can suffi-
ciently power each of the nodes separately under constant transmission or recep-
tion for 19.39 h. For our management protocol that was applied, the maximum
energy consumed was found to be 23 percent of the supply energy amounting
to total current drawn to be 264.5 mA for 1 h. It then means that the battery
can sufficiently power the node with the minimum energy for 4.35 h without
recharging. For the recharging of the battery at 15 ft, as shown in Table 13.6, it
takes 429.4 h to fully recharge when empty, and 91.9 h to replenish the drawn
current of 264.5 mA. However, with constant harvesting, it then means that the
total energy of the battery remains without reduction, which can then sustain
the network for the required number of years needed for sensing. A quick look at
the receiver in its receiving and conversion state with dipole and patch antenna
connected for the application of harvesting from the Powercast transmitter and
the harvesting mode of the receiver 3 ft (0.914 m) away from the transmitter,
respectively, are shown in Figure 13.9a-c. Shown are the P2110 Powercast har-
vester receiver with (a) dipole (omnidirectional) antenna, (b) patch (directional)
antenna, (c) TX95101 Powercaster transmitter in its harvesting mode, (d) with
Waspmote, and (e) Gateway connected to the sink. The results of the measure-
ments of the harvested RF energy are presented in Table 13.5 to Table 13.8 and
Figure 13.5a,b.
REFERENCES
[1] F. E. Little, J. O. McSpadden, K. Chang, and N. Kaya, “Toward Space Solar Power:
Wireless Energy Transmission Experiments Past, Present and Future.” AIP Conference
Proceedings of Space Technology and Applications International Forum, vol. 420, pp. 1225–
1233, 1998.
[2] D. Bouchouicha, F. Dupont, M. Latrach, and L. Ventura, “Ambient RF Energy
Harvesting,” International Conference on Renewable Energies and Power Quality
(ICREPQ’10), Granada (Spain), March, 2010.
[3] S. P. Beeby, M. J. Tudor, and N. M. White, “Energy Harvesting Vibration Sources for
Microsystems Applications,” Measurements Science and Technology, vol. 17, pp. 175–
195, 2006.
[4] R. M. Dickinson, “Evaluation of a microwave high-power reception-conversion array
for wireless power transmission,” Tech. Memo 33-741. Jet Propulsion Laboratory,
California Institute of Technology, Pasadena, CA, Sept. 1975.
[5] H. Hayami, M. Nakamura, and K. Yoshioka, “The Life Cycle CO2 Emission
Performance of the DOE/NASA Solar Power Satellite System: A Comparison of
Alternative Power Generation Systems in Japan,” IEEE Transactions on Systems, Man,
and Cybernetics Part C: Applications and Reviews, vol. 35, no. 3, August 2005.
[6] T. W. R. East, “Self-Steering, Self-Focusing Phased Array for SHARP,” Antennas and
Propagation Society International Symposium, 1991, AP-S, Digest 24–28, pp. 1732–
1735, vol. 3, June 1991.
[7] RF HAMDESIGN Microwave equipments and parts. Online at: http://www.rfham-
design.com/products/parabolicdishkit/1682909a390cc1b03/index.html
[8] Y. Zhang, L. D. Kuhn, and M. P. J. Fromherz, “Improvements on Ant Routing for
Sensor Networks,” Ant Colony, in Optimization and Swarm Intelligence, Lecture Notes
Computer Science, 2004, 3172, pp. 289–313.
[9] P. X. Liu, “Data Gathering Communication in Wireless Sensor Networks Using
Ant Colony Optimization,” 2004 IEEE International Conference on Robotics and
Biomimetics, 2004, pp. 822–827.
[10] Y.-Feng Wen, Y.-Quan Chen, and M. Pan, “Adaptive ant-based routing in wireless sen-
sor networks using Energy*Delay metrics,” Journal of Zhejiang University SCIENCE A,
vol. 9, Mar. 2008, pp. 531–538.
[11] R. GhasemAghaei, M. A. Rahman, W. Gueaieb, and A. El Saddik, “Ant Colony-
Based Reinforcement Learning Algorithm for Routing in Wireless Sensor Networks,”
2007 IEEE Instrumentation & Measurement Technology Conference (IMTC), May
2007, pp. 1–6.
366 ◾ Adamu M. Zungeru, et al.
[29] T. T. Le, “Efficient Power Conversion Interface Circuits for Energy Harvesting
Applications,” PhD disser., Oregon State University, Corvallis, 2008.
[30] Powercast Documentation. Online at: http://Powercastco.com/
[31] B. Dixon, “Radio Frequency Energy Harvesting.” Online at: http://rfenergyharvesting.
com/
[32] J. A. Shaw, “Radiometry and the Friis Transmission Equation.” Online at: http://www.
coe.montana.edu/ee/rwolff/EE548/sring05%20papers/Friis_Radiometric_2005Feb9.
pdf
[33] Wireless Power Calculator. Online at: http://Powercastco.com/wireless-power-calculator.
xls
[34] Power Density. Online at: http://www.phys.hawaii.edu/~anita/new/papers/military-
Handbook/pwr-dens.pdf
[35] R. Struzak, “Basic Antenna Theory.” Online at: http://wirelessu.org/uploads/
units/2008/08/12/39/5Anten_theor_basics.pdf
[36] N. Dusit, H. Ekram, M. R. Mohammad, and K. B. Vijay, “Wireless Sensor Networks
with Energy Harvesting Technologies: A Game-Theoretic Approach to Optimal Energy
Management,” IEEE Wireless Communications, vol. 14, no. 4, pp. 90–96. September 2007.
[37] D. Waltenegus and P. Christian, Fundamental of Wireless Sensor Networks: Theory and
Practice, New York: Wiley Series on Wireless Communication and Mobile Computing,
pp. 207–213, 2010.
[38] A. Kansal, J. Hsu, S. Zahedi, and M. B. Srivastava, “Power management in energy har-
vesting sensor networks,” in Proceedings of ACM Transactions on Embedded Computing
Systems, vol. 6, September 2007, pp. 32–66.
[39] A. G. A. Elrahim, H. A. Elsayed, S. El Rahly, and M. M. Ibrahim, “An Energy Aware
WSN Geographic Routing Protocol,” Universal Journal of Computer Science and
Engineering Technology, vol. 1, no. 2, Nov. 2010, pp. 105–111.
[40] W. Li, M. Chen, and M-M. Li, “An Enhanced AODV Route Protocol Applying in the
Wireless Sensor Networks,” Fuzzy Information and Engineering, vol. 2, AISC 62, pp.
1591–1600, 2009.
[41] T. C. Camilo, Carreto, J. S. Silva, and F. Boavida, “An Energy-Efficient Ant Based
Routing Algorithm for Wireless Sensor Networks,” In Proceedings of 5th International
Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels, Belgium, pp.
49–59, 2006.
[42] C. Alippi, G. Anastasi, M. D. Francesco, and M. Roveri, “Energy management in
Wireless Sensor Networks with Energy-Hungry Sensors,” IEEE Instrumentation and
Measurements Magazine, vol. 12, April 2009, pp. 16–23.
[43] X. Jiang, J. Taneja, J. Ortiz, A. Tavakoli, P. Dutta, J. Jeong, D. Culler, P. Levis, and
S. Shenker, “Architecture for Energy Management in Wireless Sensor Networks,” ACM
SIGBED Review, Special issue on the workshop on wireless sensor network architec-
ture, vol. 4, no. 3, pp. 31–36, July 2007.
[44] K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Maximum Lifetime Data Gathering
and Aggregation in Wireless Sensor Networks,” in Proceedings of IEEE International
Conference on Networking, vol. 42, no. 6, August 2003.
[45] NS2 installation on Linux. Online at: http://paulson.in/? p=29
[46] NS-2 Module for Ant Colony Optimization (AntSense). Online at: http://eden.dei.
uc.pt/~tandre/antsense/
View publication stats