2021 IEEE 4th International Conference on Computing, Power and Communication Technologies (GUCON)
University of Malaya, Kuala Lumpur, Malaysia. Sep 24-26, 2021
Green Communication: Optimal Charger
Deployment based on TBM (OCD-TBM) in IoT
Ankita Jaiswal Pankaj Kashyap
School of Computer and Systems Sciences, School of Computer and Systems Sciences,
Jawaharlal Nehru University Jawaharlal Nehru University
2021 IEEE 4th International Conference on Computing, Power and Communication Technologies (GUCON) | 978-1-7281-9951-1/21/$31.00 ©2021 IEEE | DOI: 10.1109/GUCON50781.2021.9573775
New Delhi-110067, India New Delhi-110067, India
ankita79_scs@jnu.ac.in pankaj76_scs@jnu.ac.in
Abstract— Towards Green communication, wireless Power
transfer technology is a convenient and reliable method designed for
supply power to energy scare Internet of Things nodes. This technique
efficiently solves the finite battery power problem of the nodes.
Previously proposed models on optimal charger deployment have not
considered the effect of data traffic distribution in the network pertain
to energy consumption of devices. Traffic distribution causes non-
uniform energy consumption of nodes turnout to deteriorate the
network performance. In this context, we propose a model to find
optimal location for charger deployment based on transferable belief
model (TBM). Further, placement of charger is determined that
provide maximum energy in the IoT network over traffic flow and
TBM. Furthermore, an algorithm optimal charger deployment based
on TBM (OCD-TBM) is presented to find the optimal number of
chargers to be deployed in the IoT network. The presented algorithm
optimizes the network performance in terms of energy cost in effective
way by increasing the network lifetime. Extensive simulation is
performed to show the robustness of proposed algorithm by varying
network size and charger placement angle. Further, comparative
analysis from random deployment approach shows that proposed
OCD-TBM outperforms in terms of charger deployment with less
numbers than that of traditional approach.
Keywordsെ Optimal charger deployment, Internet of
Things, radio frequency energy transfer, transferable belief
model.
I. INTRODUCTION
In the last few years, considerable attention has been
given on Internet of Things (IoT) market and technologies
[1-2]. It is considered to be the Green communication
technological revolutions for the upcoming generation [3, 4].
Generally, finite size batteries are used as a power source for
energy limited IoT devices (sensors), so they face problem of
restricted lifespan. Numerous researches have been done on
effectively dealing with the problem of finite battery power,
comprising the efficient power utilization [5], effectual
routing protocol [6] and so on. Nevertheless, the above
solution did not solve the fundamental aspect of the problem.
Even though they can successfully increase the lifespan of
the network, despite that the network cannot be utilized in
the end, when the battery of the sensors totally drained out.
In Green communication, sensors can be recharged in
two different ways. One way is to allow sensors to recharge
their batteries with the energy harvested (EH) from the
surroundings. However, EH using ambient sources, for
example, wind, solar, vibration, etc. is not as effectual as
anticipated because of its uneven and unpredictable nature.
Hence, the contemporary approach in wireless energy
transfer using radio frequency signal can be embraced to
enhance the lifespan of IoT network. EH from a source
which emits RF signal, is better founded and controllable to
assure a definite amount of needed energy transfer as
compared to natural sources. Another approach is to deploy
chargers in the locality of sensing devices and recharge their
978-1-7281-9951-1/21/$31.00 ©2021 IEEE
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
Sushil Kumar
School of Computer and Systems Sciences,
Jawaharlal Nehru University
New Delhi-110067, India
skdohare@mail.jnu.ac.in
batteries by exploiting the wireless energy transfer technique.
This new technology has allured attentiveness of industrial
professional and academic researchers, because of its high
stability nature and convenient use. Since chargers are
expensive, there should be minimum number of chargers
deployed in the region.
Contrarily, the performance of the sensor is significantly
affected by the amount of the energy provided by the
charger. Thus, efficaciously minimizing the quantity of
chargers while also improving the efficiency of the entire
wireless network becomes an important problem in IoT
system. In spite of the fact that, a lot of research works
relating to the placement of chargers have been published in
last few years, these researches did not consider some critical
aspects. As an illustration, former research has solved the
charger’s deployment problem without considering the effect
of traffic flow in the network [9, 10]. Former studies assume
an even power consumption of the devices, yet it is not the
case in a practical scenario. In this context, this paper
proposes the novel data traffic conscious charger deployment
method based on TBM for an IoT system. The target is to
enhance network lifespan with optimal number of chargers.
The key contributions of the paper can be summarized as
follows:
1) Firstly, we develop a model for optimal charger
deployment based on transferable belief model.
2) Secondly, we propose an algorithm to find optimal
number of chargers to be deployed in the network.
3) Finally, the proposed work is simulated against state-of-
the-art algorithms.
The rest of the paper is organized in following sections.
Section II presents the related works. In section III, we
present the system model. Section IV presents the optimal
TBM model for charger deployment. Section V presents the
proposed algorithm. Section VI presents the simulation
results and their analysis. Finally, the conclusion of the paper
is given in section VII.
II. RELATED WORK
In this section, a qualitative review on optimal charger
deployment in wireless sensor networks to enhance the
network lifetime is presented [7-10]. Two heuristic
algorithms, viz; the greedy cone covering and the adaptive
cone covering are proposed for optimum placement of
directional chargers in the network [12]. Deployment region
has been discretized into grids and chargers’ charging range
has been modeled as a cone. Since charging space is
considered as a cone, accurate value of sensor’s charged
energy may not be calculated. The problem of optimal
1
placement of mobile chargers with the knowledge of event
happening has been considered and is solved by utilizing the
integer linear programming method [13]. Profit minimizes
with growth in the number of missions and sleep scheduling
of sensor has not been considered, which may diminish the
performance of the network. Optimization algorithm based
on particle swarm optimization method has been proposed to
optimally place omnidirectional chargers in the monitoring
region to enhance the lifetime of the network [14].
Optimization problem has been formulated as a function of
space between nodes and charger, and angle between
antenna of charger and vector going from charger to sensor.
Limitation of the solution is that, it is practically applicable
only on indoor wireless rechargeable sensor network. The
problem of optimal number of charger deployment has been
considered as a minimum dominating set problem [15]. The
notion of virtual grid has been utilized to represent the
monitoring region.
An efficient algorithm has been designed for optimal
charger deployment using the knowledge of sensors’
mobility path [16]. Moreover, for large number of grid
points, there is an increase in complexity of the algorithm
with decrease in distance between the grids. A scheduling
problem for the placement of a multiple wireless charging
vehicle has been considered to provide energy to a large-
scale wireless network [17]. However, under the novel
charging model the travelling path of the vehicle is
complicated because the vehicle needs to do both the task of
deployment and collection of chargers when charging task is
done.
The above studies did not consider the traffic flow of the
network that have effect on energy consumption and
assumed an even power consumption of the devices which is
not the case in a practical scenario.
III. SYSTEM MODEL
In this section, the network model for an IoT enabled
wireless rechargeable sensor network is presented. We
assume that the monitoring area is circular in shape with
radius ܴ. Let ܵ number of sensors is randomly deployed in
the region; C be the number of chargers and a sink is placed
at the center of the circular region. According to the
assumption of the network, it can be observed that sensed
information in the whole network eventually reach the center
of the monitoring region. Sensors near the sink exhaust their
battery faster in this type of sensor deployment approach.
Hence, for even distribution of sensors, we divide the
monitoring area in concentric circles with approximately
equal gap. Data traffic follows geometric distribution when
transmitted from outer annulus to inner annulus towards the
sink by the sensors [18-19]. The objective of the proposed
work is to deploy optimal number of directional chargers.
Each charger can be placed anywhere in the monitoring area.
It is considered that each node can be charged by multiple
chargers and each charger can provide energy to multiple
sensors. The wireless chargers can be placed in an unlimited
number of locations in the real monitoring environment and
sensors can get affected by the chargers differently. The
selected region should be divided into limited sub-regions, so
that the problem can be solved and charger deployment
location limited to a finite number of positions. We assume
that the circular monitoring area is first divided into many
concentric circles of equal gap and after that it is divided into
sectors, which means each sector in partitioned into a
2
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
number of area and each sector is given a number to identify
it. The different sector partitions are to be taken as charger
deployment locations as shown in the Fig. 1.
Fig. 1. Network Architecture with chargers’ deployment
A. RSSI model for sensor’s location calculation
In this section, from each location for charger
deployment, distance of every sensor node is calculated.
Each node determines its distance from the charger
deployment locations using received signal strength indicator
(RSSI). Eq. (1) computes the received signal strength.
ௗ
‫ܫ‬௥ ൌ  ‫ܫ‬௢ ൅ ͳͲᎆ݈‫ ݃݋‬ቀ ೝ ቁ ൅ ߜ (1)
ೃೄೄ಺షಉ
ௗ೚
‫ܦ‬௥ ൌ ݀௥ ͳͲ భబഁ (2)
Where ‫ܫ‬௢ (in dbm) is the reference signal strength at
distance ݀௢ (݀௢ ൌ ͳ݉) and ᎆ is indicates path loss exponent
ሺʹ ൑ ᎆ ൑ Ͷሻ and݀௥ is the actual distance. ߜrepresents
Gaussian random variable which has mean zero and variance
ɐଶ ሺͶ ൑ ɐ ൑ ͳʹሻ. By Eq. (2) the distance between charger
deployment location and node is calculated. Where
αrepresents the strength of received signal in ͳ݉distance
from the charger deployment location without any obstacle.
B. Energy Model
In this section, we present the energy model of the
proposed network architecture. We assume that, the sensor
nodes are operating uninterrupted for ܶ௔௖௧ seconds, for
harvesting duration ofܶseconds. The duty cycle is defined as
݉ൌ
்ೌ೎೟
(3)
்
The network functionality can be activated through
regular data collection with rate throughout during
period,Ͳ ൏ ݉ ൏ ͳ.We presume that the data transmission
rate is not uniform therefore, it is represented by a random
variable. It is assumed that the wireless chargers are
directional charger and its coverage area is assumed to be a
sector with radius ‫ ݓ‬and charging angle be θ. However,
energy received by the sensors which are outside of the
charging region is too small. Let the maximum transmit
power of ܿ ௧௛ charger be ܲ௖ and maximum battery capacity of
each sensor be ‫ܤ‬௠௔௫ . Let ”୩ be the harvesting rate of sensor
node݇. The energy harvested at a sensor node ݇ from charger
ܿis given as
‫ܪܧ‬௞ ൌ ᢡ௞ ܲ௖ ሺ݀௞௖ ሻିᎆ ߝ௞ ܺ௞ ܶ (4)
 ௚௬ ௭௣
where ሺͲ ൏ ᢡ୩ ൏ ͳሻrepresents the energy harvesting ‫ܧ‬௣ ൌ ݆ ൅ ݉ܶ ൈ ሾ‫ܧ‬௬ାଵ ሾᤂሿሺ݄ ൅ ൅ ‫݌‬ሻȂ ൅  ሺ݅ ൅
௬ାଵ ௡
coefficient for sensor node ݇from chargerܿ, Ͳ ൏ ɂ୩ ൏ ೥
௭
ͳrepresents the sensor݇ energy conversion efficiency,†୩ୡ is ‫݌‬ሻ ‫׬‬଴ ሺ െ ᤂሻ ܲ௬ାଵ ሺᤂሻ݀ᤂሿ
೙ (7)
௡
the distance between the node ݇ and charger ܿ, and ᎆ is the
path-loss exponent.୩ represents the composite fading Clearly, the energy consumption is influenced by the
୸
channel. Because of the random nature of ୩ , the harvested coupling point, , and by the data transmission rate PDF per
୬
energy  ୩ is also a random variable. The mean value of sensor node,୷ାଵ ሺᤂሻ.Since we have mentioned earlier that,
harvested energy can be written as
data traffic flow follow geometric distribution, ୷ାଵ ሺᤂሻ
തതതതതത௞ ൌ ᢡ௞ ܲ௖ ሺ݀௞௖ ሻିᎆ ߝ௞ തതത
‫ܪܧ‬ ܺ௞ ܶ ൌ ‫ݎܪ‬௞ ܶ (5) ଵ
with probability of success “ ൌ ሺ୷ାଵሻ୰is given as
”୩ is deterministic but varies for different nodes
because the distance between the charger and the different ܲ௬ାଵ ሺᤂሻ ൌ ሺͳ െ ‫ݍ‬ሻᤂିଵ ‫ݍ‬ (8)
sensor nodes is not same. Next, we compute the total energy where r is the network data rate. For ᤂ ൐ Ͳǡ in this case, the
utilized by sensor݇ in time T. expected value of ᤂ is ୷ାଵ ሾᤂሿ ൌ ሺ› ൅ ͳሻr bps. By using (8)
When the network is activated, it uses distributed or in (7), we obtain
centralized mechanisms for steady-state, even, collision free ௚௬
function and we presume that to achieve these each sensor ‫ܧ‬௣ ൌ ݆ ൅ ݉ܶ ൈ ሾሺ‫ ݕ‬൅ ͳሻ‫ ݎ‬ቀ݄ ൅ ൅
௬ାଵ
೥
node consumes ݆ Joule of energy. Each sensor node ‫݌‬ቁ Ȃ
௭௣ ௭
൅ ሺ݅ ൅ ‫݌‬ሻሺ ቀͳ െ ሺͳ െ ‫ݍ‬ሻ ቁ െ ೙
consumes ݄ Joule-per-bit on an average for processing and ௡
೥
௡
transmission. The rate of data transmission (in bps) is ଵିሺଵି௤ሻ೙ ௭ ೥

represented by a random variable ᤂ with PDFܲሺᤂሻ. The ቆ ቇ െ ‫ ݍ‬ሺͳ െ ‫ݍ‬ሻ೙ ሻሿ (9)

௤ ௡
application layer of each receiver sensor node receives data
with the rate of ‫ ݖ‬bps. At the same annulus data is IV. OPTIMAL CHARGER DEPLOYMENT WITH TBM
transmitted by ݊ homogeneous sensors, for each receiver In this section, we consider a TBM [18] based approach
௭
sensor node in each annulus the ratio is defined as coupling to deploy optimal number of chargers to maintain the
௡
point. Because of the variability in transmission rate of data network functional, so that network lifetime would be
per node, we experience the following two cases: (i) under enhanced. Also, this approach is used to find optimal
௭
loading of receiver sensor node, where ᤂ ൏ and it location in the network, where charger can be placed. The
௡
consumes “idle” energy with rate ݅ Joule-per-bit (J/b); (ii) TBM works in two level, namely, credal and pignistic. In the
௭ credal phase, a charger ‫ܥ‬௩ is placed at each partition of sector
overloading of receiver sensor node, where ᤂ ൐ and it
௡ in random fashion, there after it is rotated in ͵͸Ͳ଴ directions
consumes energy with rate ‫ ݌‬J/b for buffering the data before to find the direction in which charger can supply maximum
transmission. We give components for the energy consumed amount of energy in the network. To calculate the
by sensor node in the duration of ݉ܶ seconds during which beliefሺܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻሻof each sensor depends upon two factors,
the sensor is in active mode i.e., transmitting (h J/b), first the sensor must be in the range of charger and second
receiving (g J/b), buffering (p J/b), beaconing (݅ J/b), sensing the amount of energy harvested by the sensor must satisfy
and runtime operations. Each sensor node consumes energy the constraint,‫ ܧ‬௧௛௥ of minimum energy harvest. In the
∞
given by ݉Š ‫׬‬଴ ᤂ୷ାଵ ሺᤂሻ†ᤂ ൌ ݉Š୷ାଵ ሾᤂሿ J in order to pignistic phase, the collective belief ‫ܲݐ݁ܤ‬ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻis
transfer its own data along with the data transferred to it from calculated as given in Eq. (13) by using the belief computed
‫ ݕ‬other sensor nodes. ‫ܧ‬௬ାଵ ሾᤂሿ ‫ ؠ‬ሺ› ൅ ͳሻሾᤂሿ and for each at credal phase and is used to find optimal location for
sensor node that is not a relay ሾᤂሿ is the expected charger deployment. The calculation of beliefs and collective
transmission rate. The energy consumed by each sensor node beliefs in the reference of TBM are described in the
for receiving and buffering data from ‫ ݕ‬other nodes before following section.
ஶ
transferring it is, ݉‰ ‫׬‬଴ ᤂ୷ ሺᤂሻ†ᤂ ൌ ݉‰୷ ሾᤂሿ J. The A. Frame of Discernment (FoD)
೥
idle energy consumed by each sensor node is, ݉݅ ‫׬‬଴ ሺ െ ೙
௭ In TBM, a setɊ which contains every possible states of
௡ the network system is called FoD. In the reference of optimal
ᤂሻܲ௬ାଵ ሺᤂሻ†ᤂJ. The penalty energy consumed by each charger deployment, the set of locations in the monitoring
ஶ
sensor node for data buffering is, ݉‫׬ ݌‬೥ ሺᤂ െ area is considered as FoD, and is given as
೙
௭
ሻܲ ሺᤂሻ†ᤂ J. Thus, the total consumed energy of sensor Ɋ ൌ  ‫ܮ‬௫ǡ௬ ሺ‫ܥ‬௩ ሻǡძ‫ܥ‬௩ ‫ܥ ג‬ (10)
௡ ௬ାଵ
node k is given as
where, ‫ܮ‬௫ǡ௬ ሺ‫ܥ‬௩ ሻ represents the location information of
೥
௚௬ ௭ the candidate location for charger deployment and ‫ ܥ‬denote
‫ܧ‬௣ ൌ ݆ ൅ ݉ܶ ൈ ሾ‫ܧ‬௬ାଵ ሾᤂሿ ቀ݄ ൅ ቁ ൅ ݅ ‫׬‬଴ ቀ െ
೙
௬ାଵ ௡ set of chargers in terms of coordinates.
ஶ ௭
ᤂ൯ ܲ௬ାଵ ሺᤂሻ݀ᤂ ൅ ‫׬ ݌‬೥ ቀᤂ െ ቁ ܲ௬ାଵ ሺᤂሻ݀ᤂሿ (6) B. Belief Calculation
௡ ೙

We are using the relationship‫ ›׊‬൐ Ͳǣ ୷ାଵ ሾᤂሿ ൌ Let ‫ܥ‬௩ denotes a charger at location (‫ݔ‬௩ ‫ݕ‬௩ ሻ,‫ݓ‬be its
୷ାଵ charging radius, ߠ be its charging angle and ܴ௩ be a distance
୷ ሾᤂሿ in (6), because with respect to y the expected such as Ͳ ൑ ܴ௩ ൑ ‫ݓ‬. The certain charging zone of sensor ݇is
୷
transmission rate linearly increases in a homogeneous WSN. when it lies within the sector of angleߠ and radius ሺ‫ ݓ‬െ ܴ௩ ሻ.
౰
୸ In this range sensor is charged maximum. The uncertain
Adding and subtracting’ ‫׬‬଴౤ሺᤂ െ ሻ୷ାଵ ሺᤂሻ†ᤂin୬ ,
୬ charging zone of sensor is complement of certain zone and is
we get divided into two sub-parts: partial ignorance zone and total

3
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
ignorance zone. Partial ignorance zone is defined as sector of 1. Initialize ܰ௦௘௖ =8, sec=0, C=0, ‫ܮ‬௢௣௧ = Ф, a=1
angle ߠ with radius between ሺ‫ ݓ‬െ ܴ௩ ሻ and‫ݓ‬. And total 2. while (a=1) do
ignorance zone is defined as complement of partial ignorance 3. for (sec= 1+2sec to ܰ௦௘௖ -1)
4. for (‫ܮ‬௖ =1 to 3)
zone. Sensor݇ provides information on energy charged by 5. Find belief ‫ܲݐ݁ܤ‬ሺ‫ݔ‬௩ ǡ ‫ݕ‬௩ ሻ for each ‫ܮ‬௖ by using Eq. (13) and store into
charger ‫ܥ‬௩ placed at location (‫ݔ‬௩ ‫ݕ‬௩ ) with a belief ܾ௞௩ and is set ‫ܮ‬௖௦௘௧ = {‫ ݐ݁ܤ‬ଵ ǡ ‫ ݐ݁ܤ‬ଶ ǡ ‫ ݐ݁ܤ‬ଷ }
given as 6. ‫ݐ݁ܤ‬௠௔௫௖
= max {‫ܮ‬௖௦௘௧ }
7. ‫ܮ‬௢௣௧ =‫ܮ‬௢௣௧ U {‫ݐ݁ܤ‬௠௔௫ ௖
}
ୌ୰ౡ ୘
„୩୴ ሺš୴ ›୴ ሻ ൌ ǡͲ ൑ „୩୴ ሺš୴ ›୴ ሻ ൑ ͳ (11) 8. end for
୆ౣ౗౮
9. sec=sec++
Altogether, depending on the distance between a sensor 10. end for
and a charger, the sensor provides the belief functions; (i) 11. ‫ݐ݁ܤ̴ܮ‬௠௔௫௖
ൌ ƒšሼ‫ܮ‬௢௣௧ ሽ
12. Place charger at location ܲሺ‫ݔ‬௩ ǡ ‫ݕ‬௩ ሻ where ‫ݐ݁ܤ‬௠௔௫
௖
within certain charging zone,ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ ൌ ͳ,ܾ௞௩ ሺɊሻ ൌ Ͳ (ii) 13. C=C+1
ୌ୰ ୘
within partial ignorance zone, ܾ௞௩ ሺɊሻ ൌ  ሺͳ െ ౡ ሻ(iii) 14. Calculate ൫ തതതതത୩ െ ୮ ൯, ძkϵS
஻೘ೌೣ
15. if ൫തതതതത୩ െ ୮ ൯ ൒ ‫ܧ‬௥௘௦ , ძ k ϵ S then
within total ignorance zone, ܾ௞௩ ሺɊሻ ൌ ͳ.
16. {a=0; return ‫ܥ‬௢௣௧ =C}
C. Belief Combination 17. else
18. for (sec= 2(sec) +2 to ܰ௦௘௖ )
Applying a conjunctive combination, we construct a new 19. repeat step 4 to13
belief representing the consensus of the belief obtained from 20. Calculate ൫ തതതതത୩ െ ୮ ൯ , ძkϵS
sensors for optimal location of charger ‫ܥ‬௩ . We combine the തതതതത୩ െ ୮ ൯ ൒ ‫ܧ‬௥௘௦ , ძ k ϵ S then
21. if ൫
belief of all sensors that are within the range of charger and 22. { a=0;return‫ܥ‬௢௣௧ =C}
whose charged energy from charger ‫ܥ‬௩ at location (‫ݔ‬௩ ‫ݕ‬௩ ሻis 23. else
greater than some threshold, ‫ ܧ‬௧௛௥ . Similarly, combined belief 24. Go to step 3
is calculated for all locationsɊ. 25. end while

௖௟
ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ ൌ In this section, an algorithm-1 optimal charger
ςௌ௞ୀଵ ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ ൅ deployment based on TBM (OCD-TBM) is proposed to find
ܾ ሺ‫ ݕ ݔ‬ሻܾ ሺ‫ ݕ ݔ‬ሻܾ ሺ‫ ݕ ݔ‬ሻǤ Ǥ Ǥ ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ optimal number of chargers to be deployed in the network.
 ௔௩ ௩ ௩ ௕௩ ௩ ௩ ௟௩ ௩ ௩ σௌ ሺͳ െ The input parameters in the proposed algorithm-1 are: ܰ௦௘௖ ,
ͳǣ ܵ െ ͳ‫ݏ݉ݎ݁ݐ‬ǡ ܽǡ ܾ ǥ ݈ ൌ ͳ ǥ ܵǡ ܽ ് ܾ ് ݈ ് ݇ ௞ୀଵ
sec, C, ‫ܮ‬௢௣௧ , a and output parameter is ‫ܥ‬௢௣௧ . Here, we start
ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻሻ (12)
by considering that the monitoring region is first divided into
D. Decision making ‫ܮ‬௖ number of concentric circles and then partitioned into
The pignistic transformation that allows the construction ܰ௦௘௖ , number of sectors, which can be identified by an
of probabilities that is used for selection of optimal location identifier as even or odd sector. In order to find minimum
is based on selecting the location with maximum pignistic number of chargers, first we choose a random position in the
probability. first partition of sector-1 (odd sector) and place a charger.
After that we rotate the charger continuously in ͵͸Ͳ଴
‫ܲݐ݁ܤ‬ሺ‫ݔ‬௩ ǡ ‫ݕ‬௩ ሻ ൌ direction to find the direction in which maximum energy is
ςௌ௞ୀଵ ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ ൅ harvested by each sensor that are covered by the charger and
ܾ ሺ‫ ݕ ݔ‬ሻܾ ሺ‫ ݕ ݔ‬ሻܾ ሺ‫ ݕ ݔ‬ሻǤ Ǥ Ǥ ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻ
 ௔௩ ௩ ௩ ௕௩ ௩ ௩ ௟௩ ௩ ௩ σௌ ሺͳ െ has minimum harvesting energy greater than‫ ܧ‬௧௛௥ . We use
ͳǣ ܵ െ ͳ‫ݏ݉ݎ݁ݐ‬ǡ ܽǡ ܾ ǥ ݈ ൌ ͳ ǥ ܵǡ ܽ ് ܾ ് ݈ ് ݇ ௞ୀଵ the energy of sensors to calculate belief of the sensors.
σೄ
ೖసభሺଵି௕ೖೡ ሺ௫ೡ ௬ೡ ሻሻ Similarly, we calculate the belief at all locations in all odd
ܾ௞௩ ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻሻ ൅ (13)
ௌ sectors and choose the location ሺ‫ݔ‬௩ ǡ ‫ݕ‬௩ ሻ with maximum
belief using Eq. (13), where we place first charger (Step 3
Thus, optimal location for charger deployment is selected to11) and increase charger by one. Then we check ൫ തതതതത୩ െ
whose pignistic probability isƒšሺ‫ܲݐ݁ܤ‬ሺ‫ݔ‬௩ ‫ݕ‬௩ ሻሻ. Further,
optimal number of chargers can be found by ensor has ୮ ൯ ൒ ‫ܧ‬௥௘௦ for all sensors. If this condition is true for all
minimum residual energy ‫ܧ‬௥௘௦ , which can keep the network sensors, then algorithm terminate (Step 14-16) and we get
alive. The problem can be formulated as- optimal number of chargers ‫ܥ‬௢௣௧ . Otherwise, same above
steps are repeated for even sectors (18-22). We reapply the
തതതതത୩ െ ୮ ൯ ൌ ‫ܧ‬௥௘௦ ሻ
‫ܥ‬௢௣௧ ൌ ‹ሺ‫ܥ‬ǡ ‫ݐ݄ܽݐ݄ܿݑݏ‬൫ (14) strategy until all sensors meet its energy requirement൫തതതതത୩ െ
for all sensors k, where ‫ܥ‬௢௣௧ represents the optimal ୮ ൯ ൒ ‫ܧ‬௥௘௦ . So, finally we get optimal number of chargers
number of chargers. To solve the problem (14), an algorithm and their locations required for the network.
is given in Algorithm-1. VI. SIMULATION AND RESULTS
V. PROPOSED ALGORITHM The performance of the proposed OCD-TBM algorithm
Algorithm-1 OCD-TBM (S, ‫ ܮ‬,sec, ܰ௦௘௖ , C,‫ܥ‬௢௣௧ )
௖ for optimal charger deployment is evaluated using different
//S=Total number of sensor nodes with its location, ‫ܮ‬௖ =Number of
parameters in MATLAB 2017a. The parameters which are
partitionsin each sector, ܰ௦௘௖ =Total number of //sectors, C=Number of used for better understanding of the scenario are charger’s
directional chargers, ‫ܥ‬௢௣௧ = Minimum number of chargers, ‫ܮ‬௖௦௘௧ = Set of transmission range, i.e., charger’s charging radius‫ ݓ‬and
belief of each sector, //‫ ݐ݁ܤ‬௖ = Belief at each sector at location ‫ܮ‬௖ , ‫ܮ‬௢௣௧ = Set angleߠ, number of sensor nodes ܵ and total monitoring area
of optimal location of maximum belief with dimension, ܴ are provided in Table 1.
Input:
ܰ௦௘௖ , sec, C, ‫ܮ‬௢௣௧ , a
Output:
‫ܥ‬௢௣௧

4
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
 TABLE I. SIMULATION PARAMETERS The reason behind it is that as the charging angle increases,
Parameter Value Parameter Value the charging region of charger also increases, which can
ᢡ୩ 0.8 ݉ ͲǤͳͳʹ cover a greater number of chargers at a time. It can also be
Ŵ 2 θ Ͷͷ଴ ǡ ͻͲ଴ ǡ ͳ͵ͷ଴ observed that charger with larger charging radius can supply
ɂ୩ ͳ h ʹǤʹͻʹ ൈ ͳͲିହ J/b
more energy in the network, which in turn decreases the
 ʹͳ͸ͲͲ‫ܿ݁ݏ‬ ܲ௖ Ͷ͸݀‫݉ܤ‬ number of chargers required for the network to be functional.
z ͳͶͶܾ݇‫ݏ݌‬ ݆ ͳ͸ͷǤ͸mJ Here we consider radius ‫ ݓ‬ൌ ሼʹͷ݉ǡ ͷͲ݉ǡ ͹Ͳ݉ሽ for the
‫݌‬ ͵Ǥͺͻ͵ ൈ ͳͲିହ J/b ‫ܤ‬௠௔௫ 0.0005 J evaluation work.
݅ ʹǤͳ͹͵ ൈ ͳͲିହ J/b ݃ ʹǤͻʹ͵ ൈ ͳͲିସ J/b
C. Number of Chargers over different sensor nodes and
A. Effect of the Sensor Quantity on Average Energy varying network size
Supplied by the Chargers in the Network

Fig. 2. Average energy charged over number of sensor nodes

This section analyzes the effect of the sensor quantity on

average energy supplied by the chargers in the network. In
the fig.2, different charging angle of the chargerߠ ൌ
ሼͶͷ଴ ǡ ͻͲ଴ ǡ ͳ͵ͷ଴ ሽ is considered. Sensors are deployed 5(a)
randomly in the monitoring area of radius ͳͲͲ݉ and it
varies fromʹͲ‫ͳ݋ݐ‬ͺͲ. Numbers of chargers are fixed, i.e.,
‫ ܥ‬ൌ ͸ with radius ʹͲ݉.It can be analyzed from the Fig. 3
that the average energy supplied in the network increases
with increase in the number of sensors. However, for ܵ ൐ ͺͲ
the change in average energy supplied in the network is not
enough to be noticed. The reason behind it is that each sensor
can be charged through multiple chargers and at some point,
no extra energy can be supplied in the network when the
network reaches at its stable state. And it can also be
observed that energy supplied in the network increases with
increase in the charging angle of chargers.
B. Impact of Charging angle ߠ 5(b)
5(c)

Fig. 4. Number chargers required by varying number of nodes and

transmission range (a)ܴ ൌ ͷͲ݉, (b)ܴ ൌ ͳͲͲ݉, (c)ܴ ൌ ʹͲͲ݉.

From the Fig 4, we can observe that for different size of

Fig. 3. Charging angle vs number of chargers
In the fig.3, the effect of charging angle ߠ on the
quantity of chargers required to charge the network
efficiently is analyzed. From the Fig. 4 it can be observed
that the quantity of chargers needed to charge the sensors
minimizes with increase in the charging angle of chargers.
monitoring area and number of sensor nodes, when the
radius or transmission range of the charger increases, the
quantity of chargers’ requirement for supplying energy in the
network decreases. The reason behind that, when the
transmission range increases more number of sensors can be
in the range of charger that can recharge their battery.
Accordingly, the number of chargers required for the
network minimizes. Here, it can be observed that chargers’
requirement minimum for larger value of charger radius, i.e.,
70 and charger requirement is more for small value of radius.
It can also be analyzed that with increase in the number of

5
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
sensor nodes, minimum charger requirement to keep network
alive also increases. The reason behind it is that, as the
sensor nodes in the network increases, the energy
requirement of the network also increases accordingly to
perform the required operation. Another criterion that can be
analyzed for performance evaluation of the network is its
dimension, ܴ. In a large monitoring area, sensors are
deployed randomly and are scattered in all direction. For
such a network, more chargers are required for supplying
energy to all the sensing nodes. In the Fig 4(a)-5(c), to
analyze the network performance, with area with
radiusͷͲ݉ǡ ͳͲͲ݉ܽ݊݀ʹͲͲ݉. With charger transmission
radius 50 and number of sensor node 100, the number of
chargers required is ͷfor area with radius ͷͲ݉Ǥ whereas, for
the same parameter and area with radius ͳͲͲ݉ܽ݊݀ʹͲͲ݉ ,
the chargers’ requirement is 7 and 9 respectively.
D. Performance Comparison for Optimal Charger
Deployment over number of sensor nodes
A comparison of the proposed OCD-TBM charger
deployment algorithm with the random deployment in terms
of number of sensors and number of chargers is shown in the
fig. 5 with parameters, directional charger with radius ͹Ͳ and
charging angleͳ͵ͷ଴ . The radius of circular area for charger
deployment is considered ofͳͲͲ݉. It is observed from the
result that the proposed algorithm requires a smaller number
of chargers than random deployment approach to be
deployed in the network for supplying continuous energy to
keep the network functional. This enhances the network
performance in terms of cost and network lifetime.
OCD-TBM
Fig. 5. Comparison of TBM based approach with random deployment
VII. CONCLUSION
In this paper, we have proposed a TBM based solution
for optimal charger deployment based on belief function in
the IoT network. Traffic flow is another parameter
considered along with belief function to minimize the energy
consumption in the network. Moreover, that enhances the
network performance in terms of cost and network lifetime.
Here, we consider directional chargers for the network
because of its low cost and stable power coverage. From the
simulation result, it has been clearly shown that proposed
OCD-TDM algorithm outperforms compared to random
deployment approach in the placement of charger. In future
direction, charger recharging, omnidirectional charger etc.
can be considered to optimize the proposed algorithm using
machine learning approaches towards better network
lifetime.
6
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on October 18,2023 at 05:48:21 UTC from IEEE Xplore. Restrictions apply.
REFERENCES
[1] A. Jaiswal, S. Kumar, O. Kaiwartya, M. Prasad, N. Kumar, & H.
Song, “Green computing in IoT: Time slotted simultaneous wireless
information and power transfer,” Computer Communications, 168,
pp. 155-169, 2021.
[2] A. Jaiswal, S. Kumar, O. Kaiwartya, N. Kumar, H. Song and J.
Lloret, "Secrecy Rate Maximization in Virtual-MIMO Enabled
SWIPT for 5G Centric IoT Applications," in IEEE Systems Journal,
doi: 10.1109/JSYST.2020.3036417.
[3] A. Jaiswal et al., "Quantum Learning Enabled Green Communication
for Next Generation Wireless Systems," in IEEE Transactions on
Green Communications and Networking, doi:
10.1109/TGCN.2021.3067918.
[4] P. K. Kashyap, S. Kumar, A. Jaiswal, M. Prasad and A. H. Gandomi,
"Towards Precision Agriculture: IoT-enabled Intelligent Irrigation
Systems Using Deep Learning Neural Network," in IEEE Sensors
Journal, doi: 10.1109/JSEN.2021.3069266.
[5] A. Jaiswal, S. Kumar and U. Dohare, "Green Computing in
Heterogeneous Internet of Things: Optimizing Energy Allocation
Using SARSA-based Reinforcement Learning," 2020 IEEE 17th
India Council International Conference (INDICON), New Delhi,
India, 2020, pp. 1-6, doi: 10.1109/INDICON49873.2020.9342200.
[6] Kumar, V., Kumar, S.: Energy balanced position-based routing for
lifetime maximization of wireless sensor networks. Ad Hoc
Networks, vol. 52, pp. 117-129, 2016.
[7] P. K. Kashyap, S. Kumar and A. Jaiswal, "Deep Learning Based
Offloading Scheme for IoT Networks Towards Green Computing,"
2019 IEEE International Conference on Industrial Internet (ICII),
Orlando, FL, USA, 2019, pp. 22-27, doi: 10.1109/ICII.2019.00015.
[8] Fu, L., Cheng, P., Gu, Y., Chen, J., & He, T.: Optimal charging in
wireless rechargeable sensor networks. IEEE Transactions on
Vehicular Technology, 65(1), pp. 278-291, 2016.
[9] He, T., Chin, K. W., & Soh, S.: On maximizing min flow rates in
rechargeable wireless sensor networks. IEEE Transactions on
Industrial Informatics, 14(7), pp. 2962-2972, 2017.
[10] Arivudainambi, D., & Balaji, S.: Optimal placement of wireless
chargers in rechargeable sensor networks. IEEE Sensors
Journal, 18(10), pp. 4212-4222, 2018.
[11] Li, Y., Chen, Y., Chen, C. S., Wang, Z., & Zhu, Y. H.: Charging
While Moving: Deploying Wireless Chargers for Powering Wearable
Devices. IEEE Transactions on Vehicular Technology, 67(12),
11575-11586, 2018.
[12] Jiang, J. R., & Liao, J. H.: Efficient wireless charger deployment for
wireless rechargeable sensor networks. Energies, 9(9), p. 696, 2016.
[13] Erol-Kantarci, M., & Mouftah, H. T.: Mission-aware placement of
RF-based power transmitters in wireless sensor networks. In 2012
IEEE symposium on computers and communications (ISCC), pp.
000012-000017, 2012.
[14] Chen, Y. C., & Jiang, J. R.: Particle swarm optimization for charger
deployment in wireless rechargeable sensor networks. In 2016 26th
International Telecommunication Networks and Applications
Conference (ITNAC), pp. 231-236, 2016.
[15] Lin, T. L., Li, S. L., Chang, H. Y., Chang, W. K., & Lin, Y. Y.: An
Effective Wireless Charger Deployment Method for Complete
Coverage in Wireless Chargeable Sensor Networks. In 2016
International Conference on Networking and Network Applications
(NaNA), pp. 379-382, 2016.
[16] Chiu, T. C., Shih, Y. Y., Pang, A. C., Jeng, J. Y., & Hsiu, P. C.:
Mobility-aware charger deployment for wireless rechargeable sensor
networks. In 2012 14th Asia-Pacific Network Operations and
Management Symposium (APNOMS), pp. 1-7, 2012.
[17] Zou, T., Xu, W., Liang, W., Peng, J., Cai, Y., & Wang, T.: Improving
charging capacity for wireless sensor networks by deploying one
mobile vehicle with multiple removable chargers. Ad Hoc Networks,
63, pp. 79-90, 2017.
[18] P. K..kashyap, S.Kumar, U. Dohare,, V. Kumar,, &, R Kharel.:
Green Computing in Sensors-Enabled Internet of Things: Neuro
Fuzzy Logic-Based Load Balancing. MDPI Electronics, 8(4), pp. 384-
405, 2019.
[19] P. K. Kashyap, S.kumar: Genetic-fuzzy based load balanced protocol
for WSNs. International Journal of Electrical & Computer
Engineering, 9(2), 1168–1183, (2019).