Professional Documents
Culture Documents
I. I NTRODUCTION
In a Wireless Sensor Network (WSN), the constrained
energy storage in batteries limits the network lifetime or
connes its short-term application. Thus, the limited battery
issue has become a big challenge in WSNs. To solve this
problem, energy-efciency has been widely studied in the literature where duty-cycling and various energy-efcient medium
access and routing protocols have been proposed. Existing energy conservation schemes can slow down energy consumption
rate, but cannot compensate energy depletion. To address the
problem of energy decay, harvesting energy from surrounding
energy sources including solar [1], vibration [2], wind [3],
biochemical process [4] or passive human movement [5] has
been proposed. However, the drawback of these schemes lies
in those high reliance on unpredictable and uncontrollable
ambient conditions. For instance, it is impossible to harvest
energy for some sensor nodes deployed in shadow areas or
cloudy weather at a satised level.
Wireless energy transfer technology can be adopted to
increase the lifetime of a new class WSN, called wireless
rechargeable sensor network. With this ever-lasting energy
replenishment, we have found two particular breakthroughs in
94
Ds
^
^^
^
dW
Fig. 1. System Model overview. The MCV starts from the SS and travels
in the optimal path. When it arrives at a docking spot (ds) i, it will charge
all the sensor nodes nearby wirelessly. After a time period ti , the MCV will
move to the next ds( i + 1).
2
Pr
= Gs Gr (
) ,
Ps
4d
A. System Model
(1)
where (Ps ) means the power from MCV, (Pr ) is the received
power, Gs is the source antenna gain, Gr is the receiver
antenna gain, is the signal wavelength (electromagnetic
wave) and is a path-loss exponent ( [2, 5]). Except for
95
(2)
jD
G
G
(4)
Fig. 3. The Selection of Docking Spot. Given two selected docking spots, a
longer tour for d2 and a shorter tour for d1 . Both d1 and d2 can cover all
these sensor nodes.
KP SN (j)
96
In our algorithm, designated docking points are characterized by boundary points, where several circles cross to make
the whole path length shorter. As shown in Fig 4, point a and
point b are both the intersection points. We choose the right a
instead of the left b, because a makes the tour length shorter
generally perceived as the best candidate. For isolated circle,
the best candidate point is the one gliding along the circular
trajectory and making distance between two adjacent points
shortest theoretically.
Fig. 5. Rounds and Slots. The rst stage is to initialize the whole system.
The rest rounds are all divided into 3 slots. Note that different rounds have
different length mainly because of different numbers of nodes imperative to
charge energy.
97
the MCV will add it into the recharging node set R. In the
judgment slot, MCV uses Algorithm 1 CalculateDS(R) to
compute the docking spots. A docking spot should be optimal
geometric position to cover multiple sensors for wireless
energy transfer. Then, all sensors in set R are assigned to
different Docking Spots Set D. In the charging slot, MCV
starts to travel around the optimized path to charge multi-nodes
simultaneously at every docking spot. The traveling path for
charging is a Hamiltonian cycle.
V. ALGORITHM ANALYSIS
In this section, we analyze how our MRCR can prolong the
lifetime of a WSN as well as its computation complexity.
The purpose of the recharging WSN is to make its lifetime
as long as possible even immortal. To analyze this, we rst
assume a node generates sensory data packet on a xed rate
during the whole network lifetime similar to [10]. i,t is
denoted as . T is the network lifetime. fi,j is the total number
of packets transmitted from node i to j during the network
lifetime. Eac is average energy consumed for MCVs charging
operation and k is the MCVs charging efciency. Then, eta
is the total amount of time that theMCV charges at docking
spot k. Derivation is as follows:
P urpose : maxT
fj,i =
fi,j
T +
jP SN (j)
T
es T + er
jP SN (j)
In this section, extensive simulations are conducted to evaluate the performance of our MRCR algorithm under different
congurations of large-scale networks.
A. Experimental Setup
We consider a rectangular eld of 1000m*1000m where
N = 100, 500, 1000 and static sensor nodes are randomly
deployed. The base station is placed in the center of the eld
at (500,500) and the MCVs home service station is assumed to
be at the origin. Table I lists the default simulation parameters.
We suppose all sensor nodes are homogeneous, whose battery
for each is the regular NiMH 1.2V/2.5Ah. Bmax = 1.2V
2.5A 3600sec = 10.8KJ and Bmin = 0.05% Bmax =
540J hold. We set the wireless energy transfer max range
Rmax = 2.7m. We adopt the TSP in the Concorde package
[21]. This algorithm is a fast and effective heuristic even for
large-sized instances.
We will compare our algorithm MRCR with L.Xies renewable sensor networks(LX) [10]. In [10], a cellular structure is
used in which the MCV visits these cells and charges sensor
nodes from the center of a cell. Assuming that the MCV
is powered enough for all sensor nodes renewable, we have
r = 2.7m both for our circle radius and cells length of side.
(6)
(7)
jP SN (j)
fj,BS
(8)
fi,j
(9)
Emax + k Eac
k T
(10)
iS
jP SN (BS)
fi,j + et
jP SN (j)
(11)
kD
Output : fi,j , k
(12)
98
TABLE I
SIMULATION PARAMETERS
Parameter
Bmax
Bmin
Eac
Meaning
Battery maximum capacity of each
node
Battery minimum capacity of each
node
Average Energy consumed for MCVs charging operation
Energy consumed for transmitting
a packet
Energy consumed for receive a
packet
MCVs charging efciency
MCVs moving speed
Data generating rate
Value
10.8(KJ)
540(J)
3(J)
0.05(J/pkt)
0.06(J/pkt)
1.5(%)
5(m/s)
15(pkt/h)
Fig. 6. The Comparison Results with 1000 nodes in the Concorde. The top
one is the random situation without group nodes. The middle is the result of
LX and the bottom is the MRCRs result.
2400
LX
MRCR
Original
2200
2000
1800
1600
1400
1200
1000
800
600
400
100
120
140
160
180
200
220
240
260
280
300
Fig. 7. TSP Length with Different Nodes. With N = 100, TSP length is 5302
meters long for LX and 7304 for MRCR. With N = 500, TSP length is 12146
meter long for LX and 11903 for MRCR. With N = 1000, TSP length are
16651 meter long for LX and 13121 for MRCR.
99
14
13
LX
MRCR
12
11
10
9
8
7
6
10
Round
Fig. 8. TSP length From Round 1 to 10. The unit for y-coordinate is kilometer.
3.0
LX
MRCR
2.8
2.6
2.4
2.2
2.0
1.8
1.6
1.4
10
Round
Fig. 9. The Charging Time for MCV From Round 1 to 10. The unit of the
y-coordinates is thousand second.
VII. C ONCLUSION
In this paper, we have designed and validated an optimized
algorithm Multi-node Renewable based on Charging Range
(MRCR) in the large-scale WSN. Our MRCR can provide effectiveness on energy usage and prolong the network lifetime.
Simulation results show that our MRCR can possess better
performance. In the future work, we will deeply study how to
schedule multiple chargers simultaneously.
ACKNOWLEDGMENT
This research is sponsored in part by the National Natural Science Foundation of China (contract/grant number:
No.61173179, No.61202441, No.61402078) and Program for
New Century Excellent Talents in University (NCET-13-0083).
This research is also sponsored in part supported by the
Fundamental Research Funds for the Central Universities
(No.DUT14YQ212, No.DUT14RC(3)090).
[3] C. Park and C. P.H., Ambimax: Autonomous energy harvesting platform for multi-supply wireless sensor nodes, in Sensor and Ad Hoc
Communications and Networks, 2006 3rd Annual IEEE Communications
Society on, vol. 1. Reston, VA: IEEE, Sept. 2006, pp. 168177.
[4] M. C. for Biomedical Engineering (CBE), Preventing forest res with
tree power: Sensor system runs on electricity generated by trees.
[5] T. Starner, Human-powered wearable computing, IBM Systems Journal, vol. 35, pp. 618629, 1996.
[6] A. K. A. Kurs and R. Moffatt, Wireless power transfer via strongly
coupled magnetic resonances, Science, vol. 317, no. 5834, pp. 8386,
Jun 2007.
[7] H. J. S. D. Cannon, B.L. and S. Goldstein, Magnetic resonant coupling
as a potential means for wireless power transfer to multiple small
receivers, IEEE Transactions on Power Electronics, vol. 24, no. 7, pp.
18191825, July 2009.
[8] J. B. C. P. G. K. Kang, Y. S. Meng and G. Ceder, Electrodes with high
power and high capacity for rechargeable lithium batteries, Science,
vol. 311, no. 5763, pp. 977C980, Feb. 2006.
[9] R. M. A. Kurs and M. Soljacic, Simultaneous mid-range power transfer
to multiple devices, Applied Physics Letters, vol. 96, no. 4, pp. 044 102
1C044 1023, Jan. 2010.
[10] H. Y. Yi Shi, Liguang Xie and S. H.D., On renewable sensor networks
with wireless energy transfer, in INFOCOM, 2011 Proceedings IEEE.
IEEE, April 2011, pp. 13501358.
[11] W. Z. Zi Li, Yang Peng and D. Qiao, J-roc: A joint routing and charging
scheme to prolong sensor network lifetime, in Network Protocols
(ICNP), 19th IEEE International Conference on. Vancouver, BC: IEEE,
Oct. 2011, pp. 373382.
[12] , Study of joint routing and wireless charging strategies in sensor networks, in Proceedings of 5th International Conference WASA.
Berlin, Heidelberg: ACM, Aug. 2010, pp. 125135.
[13] W. Z. Y. Peng, Z. Li and D. Qiao, Prolonging sensor network lifetime
through wireless charging, in Real-Time Systems Symposium (RTSS),
2010 IEEE 31st. San Diego, CA: IEEE, Nov. 2010, pp. 129139.
[14] P. E. Perez D. and W. D., Solving the physical traveling salesman
problem: Tree search and macro actions, Computational Intelligence
and AI in Games, IEEE Transactions on, March 2014.
[15] E. H. and R. S., Animation of the traveling salesman problem, in
Southeastcon, 2013 Proceedings of IEEE. Jacksonville, FL: IEEE,
April 2013, pp. 16.
[16] J. W. Ho S.L. and F. W.N., A comparative study between novel witricity and traditional inductive magnetic coupling in wireless charging,
Magnetics, IEEE Transactions on, vol. 47, no. 5, pp. 15221525, May
2011.
[17] P. C. Lingkun Fu and Y. Gu, Minimizing charging delay in wireless
rechargeable sensor networks, in INFOCOM, 2013 Proceedings IEEE.
Turin: IEEE, April 2013, pp. 29222930.
[18] S. H. Fachang Jiang and P. Cheng, On optimal scheduling in wireless
rechargeable sensor networks for stochastic event capture, in Mobile
Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on. Valencia: IEEE, Oct. 2011, pp. 6974.
[19] S. N. Constantinos Marios Angelopoulos and T. P. Raptis, Efcient energy management in wireless rechargeable sensor networks, in
Proceedings of the 15th ACM international conference on Modeling,
analysis and simulation of wireless and mobile systems (MSWiM 12).
New York, NY, USA: ACM, Oct. 2012, pp. 309316.
[20] K. J. D. M. Omprakash Gnawali, Rodrigo Fonseca and P. Levis,
Collection tree protocol, in Proceedings of the 7th ACM Conference
on Embedded Networked Sensor Systems (SenSys 09). ACM, 2009,
pp. 14.
[21] C. H. C. T. Solver, http://www.math.uwaterloo.ca/tsp/concorde/index.html.
R EFERENCES
[1] Z. Z. KaiWei Fan and P. Sinha, Steady and fair rate allocation for
rechargeable sensors in perpetual sensor networks, in Proceedings of
the 6th ACM conference on Embedded network sensor systems. New
York, NY, USA: ACM, Nov. 2008, pp. 239252.
[2] R. A. A. P. C. S. M. Jose, J. O. Mur-mir and J. H. Lang, Vibrationto-electric energy conversion, IEEE Transactions on Very Large Scale
Integration (VLSI) Systems, vol. 9, no. 1, pp. 6476, Feb. 2001.
100