Proof of Publications

Published conference paper

Output type Published conference paper

Title of output Energy Efficient Localization in Wireless Sensor Networks Using

Computational Intelligence

Author(s) Junaid Akram​, Zeeshan Najam, Haider Rizwi

Name and date of 2018 15th International Conference on Smart Cities: Improving Quality
conference of Life Using ICT & IoT (HONET-ICT). October 09, 2018

URL to output https://ieeexplore.ieee.org/abstract/document/8551332/

Published conference paper

Output type Published conference paper

Title of output Efficient Resource Utilization in Cloud-Fog Environment Integrated with

Smart Grids

Author(s) Junaid Akram​, Zeeshan Najam, Arslan Rafi

Name and date of 2018 International Conference on Frontiers of Information Technology

conference (FIT). December 17, 2018

URL to output https://ieeexplore.ieee.org/abstract/document/8616989/

Published conference paper

Output type Published conference paper

Title of output Lexicon and Heuristics Based Approach for Identification of Emotion in
Text

Author(s) Junaid Akram​, Arsalan Tahir

Name and date of 2018 International Conference on Frontiers of Information Technology

conference (FIT). December 17, 2018

URL to output https://ieeexplore.ieee.org/abstract/document/8617007/

Published conference paper

Output type Published conference paper

Title of output Handover Management in 5G Software Defined Network Based V2X

Communication

Author(s) Haider Rizvi, ​Junaid Akram

Name and date of 2018 12th International Conference on Open Source Systems and
conference Technologies (ICOSST). December 19, 2018.

URL to output https://ieeexplore.ieee.org/abstract/document/8632180/

Published conference paper

Output type Published conference paper

Title of output Efficient resource distribution in cloud and fog computing

Author(s) Mubashar Mehmood, Nadeem Javaid, ​Junaid Akram​, Sadam Hussain

Abbasi, Abdul Rahman, Fahad Saeed

Name and date of International Conference on Network-Based Information Systems.

conference September 05, 2018.

URL to output https://link.springer.com/chapter/10.1007/978-3-319-98530-5_18

Published conference paper

Output type Published conference paper

Title of output Statistical Topic Modeling for Urdu Text Articles

Author(s) Anwar Ur Rehman, Zobia Rehman, ​Junaid Akram​, Waqar Ali, Munam
Ali Shah, Muhammad Salman

Name and date of 2018 24th International Conference on Automation and Computing
conference (ICAC). September 06, 2018.

URL to output https://ieeexplore.ieee.org/abstract/document/8748975/

Published conference paper

Output type Published conference paper

Title of output Efficient Energy Utilization in Fog Computing based Wireless Sensor
Networks

Author(s) Arslan Rafi ; Adeel-ur-Rehman ; Gulsayyar Ali ; ​Junaid Akram

Name and date of 2019 2nd International Conference on Computing, Mathematics and
conference Engineering Technologies (iCoMET). January 30, 2019.

URL to output https://ieeexplore.ieee.org/abstract/document/8673423

 Energy Efficient Localization in Wireless Sensor
Networks Using Computational Intelligence
Junaid Akram Zeeshan Najam
RCMS, NUST SEECS, NUST
Islamabad, Pakistan Islamabad, Pakistan
jakram.mscse15@rcms.nust.edu.pk zeeshan.najam@seecs.edu.pk
Abstract—Wireless Sensor Networks consist of many sensing
devices which are distributed inside of a given area. Each sensor
node consists of multiple heterogeneous components such as
power supply, CPU, memory, and a transceiver. Since the location
of sensors is needed in most of the WSNs, Trilateration-based
localization (TBL) has been used to locate the sensors in the
network. This study formulates the concern on how wireless
sensor networks can take advantage of the computational intel-
ligent techniques using both single and multi-objective particle
swarm optimization (PSO) with an overall aim of concurrently
minimizing the required time for localization, minimizing energy
consumed during localization, and maximizing the number of
nodes fully localized through the adjustment of wireless sensor
transmission ranges while using TBL process. A parameter-study
of the applied PSO variants is performed, leading to results that
show algorithmic improvements of up to 21% in the evaluated
objectives.
Index Terms—Wireless Sensor Networks, Trilateration, Local-
ization, Particle Swarm Optimization
I. I NTRODUCTION
Wireless sensor networks (WSN) consist of many sensing
devices which are distributed inside of a given area. Sensors in
the network carry out different tasks such as recording weather
conditions, sensing motion, or recording sounds in addition to
many other tasks. In WSNs, sensors cooperate with each other
to formulate a fully connected network to allow information
sharing between the network nodes. Such networks have
many applications both for civilian and military purposes, the
position of sensing devices that record the humidity of a place
or the position of a military vehicle in a war zone are two
examples of such applications where knowing the location of
the information source is very important.
Wireless sensor nodes in WSNs may be positioned perma-
nently or dynamically in a field depending on the localization
protocol and nodes functionalities as thoroughly discussed in
[1]. For permanent localization scenarios, knowing the location
of the sensor is not a problem throughout the life time of the
network; but in dynamic networks, localizing nodes can be
time and power consuming and, in some scenarios, a lack
of accuracy may occur. To solve problems of localization
accuracy and increase the number of localized nodes in a
time critical localization scenarios, meta-heuristic solutions
and novel range-based iterative localization algorithms have
previously been proposed in [2], [3] and [4]. Additionally, to
allow mapping localization solutions into real world scenarios
978-1-5386-8354-5/18/$31.00 ©2018 IEEE
Haider Rizwi
RCMS, NUST
Islamabad, Pakistan
hani-rizvi@hotmail.com
relaxations to the localization problem regarding the nodes
ordering, anchor nodes distribution, or global information
sharing were also discussed in [5] and [6].
Trilateration-based localization (TBL) and Multilateration-
based localization (MBL) techniques are among the well-
known and most used methods for localization. In this study,
the various performance aspects of the TBL algorithm are
examined through the application of single and multi-objective
variants of particle swarm optimization (PSO). We imple-
mented two version of PSO in this study to allow nodes to
vary the transmission power level when broadcasting messages
during localization. Trade-offs between multiple objectives
(the number of transmitted messages, number of localized
nodes, power consumption and the time needed to localize
as many nodes as possible) are studied.
The paper present the results of two implemented versions
of the particle swarm optimization and clearly show the
performance of them while trying to optimize the WSN work.
The key novelty of this paper is the optimization of the
power consumption of the whole network without the need to
cluster or build any small sensor islands such as in [7]. This
study takes advantage of the functionalities of toady’s WSNs
nodes to enhance the performance of the whole network, the
ZigBee technology of transceivers in wireless nodes made
that possible by allowing us to use multiple transmission
power levels, where the different variants of PSO were used
to programmically change the transmission level after the
evaluation of the designed fitness functions.
II. L ITERATURE R EVIEW
WSNs consist of many sensing devices which are distributed
inside of a given area. Sensors in the network carry out
different tasks such as recording weather conditions, sensing
motion, or recording sounds in addition to many other tasks
[8]. In WSNs, sensors cooperate with each other to formulate a
fully connected network to allow information sharing between
the network nodes. The collected information can also be
sent to a command and control center for processing and
decision making. Such networks have many applications both
for civilian and military purposes, yet finding the actual
location of a single sensor in any type of WSN is important.
For example, it can be used in military applications to detect
78
infiltration and target tracking or for environmental monitoring
and forest fire control.
A. WSN Localization
Each sensor node consists of multiple heterogeneous
components such as power supply, CPU, memory, and a
transceiver. Since the location of sensors is needed in most
of the WSNs, sensors can be equipped with an additional
component such as a Geographic Positioning System (GPS)
device. However, sensor nodes are spread in significantly large
quantities, therefore, it does not seem to be a cost-effective
solution to equip all nodes with a GPS device. As a result, a
scheme other than GPS is needed to locate the sensors.
Localization in WSNs is a challenging task due to the
inherent characteristics of the network such as the constrained
resources of sensor nodes which lead to limited computational
and communication capabilities, and power limitations due
to the use of batteries to power the nodes. Further, the
information regarding an entire network, including its topology
and technology, is often not available at a single node. Due
to this lack of information, there is a requirement for the
localization protocol of a given network to be distributed.
A wireless network can be formed by spreading sensors
in a terrain manually or through an airplane depending on
the terrain conditions. Additionally, nodes in WSNs may be
positioned permanently or dynamically in a field [1]. For
permanent localization scenarios, knowing the location of the
sensor is not a problem throughout the life time of the network,
but in dynamic networks localizing nodes can be time and
power consuming and, in some scenarios, a lack of accuracy
may occur.
To avoid high costs, two different types of nodes are used
within a typical WSN: Anchor and Blind nodes. Anchor nodes
are the ones aware of their positions through the use of the
aforementioned devices which allow the node to obtain its
position in the global coordinate system (using GPS), or by
deploying the node in known positions in the local coordinate
system. Blind nodes then rely on the anchor nodes to estimate
their positions in the respective coordinate system [1]. Trilat-
eration and multilateration based localization (TBL and MBL)
techniques are among the best known and most used methods
for localization. TBL and MBL allow blind nodes to localize
themselves based on the difference in distance between the
blind nodes and the neighbor anchor nodes [9].
B. Power Consumption in WSNs
Wireless sensor nodes often use solar cells to extend the bat-
tery life in order to allow nodes to run for longer times. Other
methods of extending battery life are the intelligent slowing
of power consumption through a reduction in listening time
[10], increasing the sleep time [11], or modifying sampling
rates [12]. Another method of accomplishing power reduction
is the use of multiple transmission ranges as is seen in the well-
known CC2420 ZigBee RF transceivers [13]. CC2420 allow
nodes to transmit messages using eight discrete output power
levels, as discussed in section 28 of the transceiver data sheet
[14]. On the other hand, the Atmel AT86RF230 transceiver,
as the CC2420, allow varying the output power but not only
between 8 levels, instead, between 16 discrete levels ranging
from 3 dBm to 17:2 dBm. Having more output power levels
allow minimum length of intervals than what the CC2420 can
provide.
Previous studies took advantage of such functionalities and
tried to optimize the power consumption by varying the output
power as in [15], where the output power of nodes were varied
based on the distance between the communicated nodes after
sharing the information using the Request to Send/Clear to
Send mechanism. Additionally, in [16] a localization proto-
col was proposed to optimize the power consumption after
clustering nodes based on the used power levels. In most of
the simulations and studies done in literature, they tried to
change the power level sequentially while observing the effect
of using different power levels, or assign power levels to nodes
randomly.
Table 6.1 of the CC2420 data sheet [17] lists the five differ-
ent modes in which the transceiver consumes different amount
of power, the five modes are: Voltage regulator off(OFF);
Power Down mode (PD); Idle mode (IDLE); Receive mode;
and finally, the Transmit mode. Depending on the localization
protocol, all of the other modes including the transmit mode
will be affected by the steps and behavior of the localization
procedure. For example, longer localization time means more
power consumption due to the power consumed while in the
idle mode.
III. P ROBLEM F ORMULATION
The method proposed in this study involves the use of
single- and multi-objective PSO to choose the appropriate,
discrete or continuous output power levels for each wireless
sensor node, in order to optimize various single or combi-
nations of objectives including localization time, messages
sent during localization, and power consumed. Appropriately,
the remainder of this section will examine the use of the
previously discussed three discrete power ranges and the
continuous transmission ranges in the variants of the designed
PSO.
In order to implement PSO, multiple objective functions
as well as a problem specific representation are defined in
the following sections. Two variants of PSO are presented
including 1) A binary single objective PSO, and 2) A binary
multi-objective PSO.
A. Objective Functions
As previously mentioned, the SOPSO and MOPSO algo-
rithms are used in order to intelligently adjust the various
discrete power ranges or the continuous transmission ranges
of each sensor node. Accordingly, a representation consisting
of N dimensions is used in order to represent each sensor that
is deployed in the field. Furthermore, the objective functions
for messages sent, time required for localization, power con-
sumption, and number of nodes localized are calculated as
follows:
79
 • Messages sent: Depending on the localization procedure
and communication mechanism between nodes, the num- ⎧
⎪
⎨mRange If vi < mRange
ber of messages sent back and forth between nodes
vi = xRange If vi > xRange (2)
will vary. However, in this study we assume that each ⎪
⎩
already localized node will broadcast once in order to vi If mRange ≤ pi ≤ xRange
help other non-localized nodes achieve localization. Thus, 1
the number of sent messages depends on the number of s(pi ) = (3)
1 + e−pi
localized nodes.
• Time required: In the proposed method, one unit of time 
mRange If s(pi ) ≤ Ran
is equivalent to one step in which sender nodes broadcast pi = (4)
their locations and receivers receive the information. xRange otherwise
The step ends by running the location estimation using Here s(pi ) is the sigmoid function value of the particle i.e.
TBL method for each blind node that receives at least is Euler’s number, and ran is any random binary. Sigmoid
three messages from three different localized nodes. The function was used in the equation to scale the value to stay
localization procedure is going to terminate when no any in the range [0, 1]. The inertia weight (ω) in Eq. 1 can
new blind node was able to localize itself by the end of be modified dynamically (instead of a constant value) using
each step. mechanisms such as the Simulated Annealing to increase
• Power consumption: The variance in this objective mainly the probability of finding a near-optimal solution in fewer
comes from the use of discrete and continuous transmis- iterations and with less computational time
sion ranges, leading to various levels of power consump-
tion. The power consumption is measured based on the IV. S IMULATIONS AND D ISCUSSION
power level or the transmission range each node uses to Fig. 1 shows the flow chart of the simulation procedure.
broadcast its message. Accordingly, the power consump- Note that in Step-2, the implemented Java code reads the
tion is the sum of each node’s power consumption as positions of each node from a saved topology file, where each
chosen by PSO. node’s types: anchor or blind node, in addition to the X and
Y coordinates of the anchor nodes are saved. For this study a
TABLE I: Binary PSO Positions Matrix
random WSN topology file containing 240 nodes, 40 of which
Range Min Mid Max
are anchor nodes, are scattered among a field of 1000 × 1000
node1 0 1 0 meters. In Step-3, one of the two proposed PSO versions is
node2 1 0 0 used.Step-4 and Step-5 is part of the fitness function where
node3 0 0 1
each particle’s solution is examined by flooding the network
and using the TBL localization method.
• Number of nodes: Choosing which power range a node
will use to transmit messages or the transmission range
of each node plays a significant role in the number
of localized nodes. Through use of this objective, the
proposed method maximizes the number of nodes capable
of localizing using the least amount of consumed power,
which means the least average transmission ranges of all
nodes.

B. Binary PSO Representation

In all versions of PSO, each particle represents a potential
solution of the localization problem. The variant of binary
PSO (the single and multi-objective implementations) used
in this study creates a random positions matrix where each
element in the matrix takes the value of 0 or 1. Each row of the
matrix represents a single node and consists of three columns
corresponding to the min, mid, and max power ranges. An Fig. 1: Simulation Flow Chart
example of the matrix is shown in Table I. In this particular
example, nodes 1, 2, and 3 are assigned the mid, min, and max
power ranges. The velocity matrix of each particle also look A. Binary SOPSO Results
like the positions matrix but with continuous values ranges Driven by the baseline solutions, Binary SOPSO(BSOPSO)
between 0 and 1. was used to explore the potential methods of improving the
solutions to the presented problem. Accordingly, SOPSO was
vi = ωvi + c1 r1 (p̂i − pi ) + c2 r2 (ĝ − pi ) (1) applied using each objective function previously discussed.

80
 used will aid in decreasing the localization time, representing
a clear trade-off between these two objectives.

TABLE III: BSOPSO Parameters Value

Parameter Value
Particles 100
Iterations 200
Min Tran Range 64
Max Tran Range 132
C1 and C2 1.49445
Inertia Weight (ω) RIW

Fig. 2: Simulation Panels showing three different simulation

scenarios using the (a) minimum, (b) medium, and (c)
maximum output power levels. Lines between nodes Fig. 3: Results from 50 Trials of BSOPSO with an objective
represents a 1-hop connection between nodes. of maximizing localizability.

TABLE II: Baseline Results using Multi Power Levels

Run1 Run2 Run3

Range Min Mid Max
Transmission Ranges 63.28 91.47 132.22
Time 480 1200 960
Energy Consumption 20.55 171.21 758.95
Localized Nodes 41 136 240

The values of the SOPSO parameters are listed in Table III,

where a version of the random inertia weight is implemented
to make sure that PSO will not stuck in the local optima
and improve the exploration ability by using a version of the
simulated annealing method.
Fig. 3 shows 50 trials of simulating the WSN topology
chosen, where the objective function was to maximize the
number of the localized nodes only. In this scenario, the
number of non-localized nodes ranged from 0 to 10 nodes,
which means that the worst solution PSO was able to find
was 5% worse in terms of the number of localized nodes.
However, the power consumption was also reduced in addition
to increasing the number of nodes localized. Yet, since the
main focus of the trials was to maximize the number of
localized nodes, the total time required for localization was
worse, by 50% to 225%.
An obvious conclusion would be that whenever the larger
power ranges are used, the overall power consumption will
increase. Additionally, increasing the power ranges may in-
crease the number of localized nodes. Fig. 4 suggests that a
tremendous decrease in the number of lower power ranges
Fig. 4: Number of transmitted messages when using multiple
discrete output power levels over 50 Trials of BSOPSO with
an objective of maximizing Localizability.
B. Binary MOPSO Results
Binary MOPSO(BMOPSO) was used to overcome the low
quality of solutions found by SOPSO when minimizing the
time needed for localization as well as power consumption
while maximizing the number of localized nodes. The values
of the MOPSO parameters are listed in Table IV, where a
binary mutation method was implemented and a Fixed Inertia
Weight (FIW) was chosen.
The method was able to find a balance between all compet-
ing objectives and give solutions that outperforms the baseline
and the SOPSO methods as detailed in Fig. 5, where the
results of 50 trials are shown. It was able to find a balance
between all of the competing objectives and, in some cases,

81
it outperformed the two previous methods at all levels, (i.e.
localizing all nodes during the shortest time possible and with
power consumption less than any other solutions found by the
methods before).
During the 50 trials, 115 different, yet optimal, solutions
were found. Of these, 28 outperformed the baseline in terms of
power consumption while maintaining the same time and num-
ber of localized nodes. The total power consumption ranged
from 4% to 21% lower than the baseline measurements. In the
best case, the MOPSO method improved power consumption
by 29%, but was only capable of localizing 145 nodes — a
clear trade-off.
TABLE IV: BMOPSO Parameters Value
Parameter Value
Particles 100
Iterations 200
Min Tran Range 64
Max Tran Range 132
Mutation Percentage 15%
Mutation Value Min Tran Range
C1 and C2 1.49445
Inertia Weight (ω) RIW
Fig. 5: Power consumption, localization time, and number of
localized nodes of a solution set containing 115 solutions
while using the BMOPSO method over 50 trials.
V. C ONCLUSIONS
This paper has presented single-objective and multi-
objective binary PSO-based solutions for the power con-
sumption of WSN during trilateration-based localization. The
overall performance of the TBL algorithm was evaluated and
improved through the simultaneous optimization of various
objective functions. Results clearly show that the use of
SOPSO and MOPSO to optimize the TBL algorithm in terms
of power consumption is effective, providing improvements
up to 21% only on the Transmit mode of transceivers. Also,
as shown by the study, using single global output power is
less stable in localizing nodes than using multiple levels and
using the maximum possible output level is not cost effective
solution to the stability of localization, therefore, PSO was
found to solve the problem without negatively affect the TBL
work in terms of localizability in particular. However, our
study can be mapped to real test beds using techniques such
as the component based localization, nodes clustering, and
RTS/CTS methods, in addition to many others, as suggest by
[5] and [6].
R EFERENCES
[1] K. M. Modieginyane, B. B. Letswamotse, R. Malekian, and A. M.
Abu-Mahfouz, “Software defined wireless sensor networks application
opportunities for efficient network management: A survey,” Computers
& Electrical Engineering, vol. 66, pp. 274–287, 2018.
[2] S. K. Rout, A. K. Rath, P. K. Mohapatra, P. K. Jena, and A. Swain, “A
fuzzy optimization technique for energy efficient node localization in
wireless sensor network using dynamic trilateration method,” in Progress
in Computing, Analytics and Networking. Springer, 2018, pp. 325–338.
[3] E. Tuba, M. Tuba, and M. Beko, “Two stage wireless sensor node
localization using firefly algorithm,” in Smart Trends in Systems, Security
and Sustainability. Springer, 2018, pp. 113–120.
[4] S. Arora and S. Singh, “Node localization in wireless sensor networks
using butterfly optimization algorithm,” Arabian Journal for Science and
Engineering, vol. 42, no. 8, pp. 3325–3335, 2017.
[5] T. Liu, X. Luo, and Z. Liang, “Enhanced sparse representation-based
device-free localization with radio tomography networks,” Journal of
Sensor and Actuator Networks, vol. 7, no. 1, p. 7, 2018.
[6] X. Wang, Y. Liu, Z. Yang, K. Lu, and J. Luo, “Robust component-
based localizationin sparse networks,” IEEE Transactions on Parallel
and Distributed Systems, vol. 25, no. 5, pp. 1317–1327, 2014.
[7] W. Cheng, N. Zhang, X. Cheng, M. Song, and D. Chen, “Time-
bounded essential localization for wireless sensor networks,” IEEE/ACM
Transactions on Networking, vol. 21, no. 2, pp. 400–412, 2013.
[8] C. Sivaranjani, A. Surendar, and T. Sakthevel, “Energy efficient de-
ployment of mobile node in wireless sensor networks ‘,” International
Journal of Communication and Computer Technologies, vol. 1, no. 20,
pp. 75–78, 2013.
[9] G. Han, J. Jiang, C. Zhang, T. Q. Duong, M. Guizani, and G. K.
Karagiannidis, “A survey on mobile anchor node assisted localization in
wireless sensor networks.” IEEE Communications Surveys and Tutorials,
vol. 18, no. 3, pp. 2220–2243, 2016.
[10] B. Martinez, M. Monton, I. Vilajosana, and J. D. Prades, “The power
of models: Modeling power consumption for iot devices,” IEEE Sensors
Journal, vol. 15, no. 10, pp. 5777–5789, 2015.
[11] J. J. Robles, S. Tromer, M. Quiroga, and R. Lehnert, “A low-power
scheme for localization in wireless sensor networks,” in Meeting of the
European Network of Universities and Companies in Information and
Communication Engineering. Springer, 2010, pp. 259–262.
[12] M. Z. A. Bhuiyan, G. Wang, J. Cao, and J. Wu, “Energy and bandwidth-
efficient wireless sensor networks for monitoring high-frequency events,”
in Sensor, Mesh and Ad Hoc Communications and Networks (SECON),
2013 10th Annual IEEE Communications Society Conference on. IEEE,
2013, pp. 194–202.
[13] W. Everywhere, “Wirelessly connecting everywhere,” Wireless Connec-
tivity, no. 2Q, pp. 1–72, 2013.
[14] T. Instruments, “Cc2420: 2.4 ghz ieee 802.15. 4/zigbee-ready rf
transceiver,” 2006.
[15] H. Ren and M. Q.-H. Meng, “Power adaptive localization algorithm for
wireless sensor networks using particle filter,” IEEE Transactions on
Vehicular Technology, vol. 58, no. 5, pp. 2498–2508, 2009.
[16] K.-B. Chang, Y.-B. Kong, and G.-T. Park, “Clustering algorithm in wire-
less sensor networks using transmit power control and soft computing,”
in Intelligent Control and Automation. Springer, 2006, pp. 171–175.
[17] T. Instruments, “Cc2420 datasheet,” Reference SWRS041B, 2007.
82
 2018 International Conference on Frontiers of Information Technology (FIT)
Efficient Resource Utilization in Cloud-Fog
Environment Integrated with Smart Grids
Junaid Akram
RCMS, NUST
Islamabad, Pakistan Islamabad, Pakistan
jakram.mscse15@rcms.nust.edu.pk zeeshan.najam@seecs.edu.pk
Abstract—The cloud and fog computing integration with Smart
Grid (SG) improve the efficiency of SG. SG is a modern electricity
network that improves performance, reliability, stability and
energy consumption. The SG integration with cloud computing
improves allocation of resources. Another concept, fog computing
is introduced to reduce the load on cloud and improve the
allocation of resources. The fog provides the same services as
the cloud. However, fog is closest to the end users that improve
response time and resource utilization. Fog cover small area
than cloud and store data temporarily for permanent storage
fog communicate with the cloud. The main features of fog are
mobility, low latency and location awareness. In this paper,
we presented cloud and fog based framework for information
management. Fog computing makes the system efficient by using
load balancing algorithm to allocate Virtual Machines (VMs).
The load balancing algorithms evaluated in this paper are
Round Robin, Throttled, Active Virtual Machine, Particle Swarm
Optimization, Ant Colony Optimization and odds algorithm.
Particle Swarm Optimization outperform other algorithms.
Index Terms—Fog Computing, Microgrid, Smart Grid, Re-
sponse Time, Tasks Scheduling, Load Balancing, Cloud Comput-
ing
I. I NTRODUCTION
The Smart Grid (SG) manage the distribution of energy and
allows Internet of things (IoT) devices to exchange information
with each other. SG provides two-way interaction between
end-users and service provider which enable them to monitor
their energy consumption and pricing. Due to a large number
of SG user, SG requires response time and processing time.
To manage a large number of requests yielding by the large
number of devices such as a smart meter which requires to
managed, processed and stored by cloud. Evolution of cloud
has minimized the need of large computation power [1].Smart
grid gets private data usage and energy usage information
through the smart meter which is stored permanently on
the cloud. The cloud with IoT integration provide numerous
services and permit data to manipulate smartly.
Rapid growth of IoT devices has caused response time and
processing time on the cloud to increase which is crucial for
big applications. SG provide privacy when transmitting data
to the cloud [2]. As the end-users increases in the cloud, it
becomes difficult to manage requests and load balancing issues
arise in the cloud [3]. Cloud and fog concept is introduced to
manage a large number of requests.
978-1-5386-9355-1/18/$31.00 ©2018 IEEE
DOI 10.1109/FIT.2018.00040
Zeeshan Najam Arslan Rafi
SEECS, NUST RCMS, NUST
Islamabad, Pakistan
arslanrafi@ymail.com
Internet of Things is integrated with cloud computing be-
cause of its useful features, and to fulfill the promise of our
connected world. One of the feature is storage, cloud provides
large volume of storage facility based on your requirements.
Similarly, computing and analyst is another important feature
for IoT. Cloud provides better and faster online computing
services for processing your task, and attach with modern
algorithms to analysis data and present data in different visual
form. Moreover, it provides meter service which means we
will pay only for what we have used. Self service is another
dashing feature, where all the IT resources we need will have
self service access so that we can customized as we want [4].
Fog provides various important features such as location
recognition and low response time. Fog computing maximizes
the validity of SG and increases security issue, decrease
computation cost and response time [5]. In cloud-fog based
platform the request of end-users are sent to fog which are
forwarded to get Micro Grid (MG) services. The consumers
send requests to fog and fog search for the nearest MG and
make interaction with the microgrid controller. With the help
of fog the processing time and response time minimizes and
overall performance increases.
In this paper, a cloud and fog integrated smart grid model
is proposed. In the proposed model, fog manages the flow
of data and forwarding requests for electricity to microgrid.
Load is managed dynamically on the fog servers. Each fog
server consists of virtual machines. VMs are responsible for
processing of requests. These requests are to be balanced on
servers using load balancing techniques for efficient utiliza-
tion of resources. Six load balancing algorithms have been
discussed in this paper.
II. M OTIVATION
Due to the rapid increase of Internet of things devices
computation power of smart grid is adversely affected so a
centralized cloud and fog based platform is presented [6].
Request response time and data storage have become a critical
issue from the past few decades, to manage this fog computing
concept is presented [7]. Fog Computing acts as an extra level
of computational and communication nodes that unburden the
Cloud from multi-tasking while handling large amounts of user
requests [4]. The key concern with the fog computing is to
manage the incoming requests from the user in a competent
188
way with least RT and prevent the underutilization of resources
at the same time. Many algorithms are used for fulfilling
clients request with a least RT by allocating the requests to the
virtual machines. Load balancing is very important because
each virtual machine in the fog does the equal amount of
work throughout, therefore reducing the RT and increasing the
output. The utilization of a particular machine can be balanced
by dynamically changing the load to VMs or nodes which
have fewer loads at the time. In cloud, for the management of
user requests, different load balancing techniques are defined
in literature [8].
A. Contribution
Fog is very close user so it provides low latency and respond
faster as compare to the cloud. Provides better allocation
of resources and optimize load in the on-peak hours. We
have optimized load-balancing and minimized response and
processing time.
III. R ELATED W ORK
This section consists of recent related work. The authors
in [9], work on the load balancing technique named as
dragonfly algorithm. This algorithm performs efficiently than
other algorithms in term of processing time and task allo-
cation. The authors in [10], implements the self-similarity
based technique for load balancing. The authors compare this
algorithm with various others algorithms and results show
that this algorithm outperforms other techniques. In [11], the
authors proposed an algorithm named as cloud load balancing
and by comparing with other algorithms results shows that
this technique performs better than others algorithms. In [12],
authors implement bacterial foraging algorithm and social
spider algorithm. Results show that social spider optimization
algorithm performs better in term of user comfort and peak
to average ratio. The authors in [13], implements Harmony
Search and Firefly algorithms. Comparison results with other
algorithms demonstrate that Harmony Search algorithm out-
performs other techniques in term of electricity cost and peak
to average ratio. In [14], the authors proposed the Harmony
Search algorithm and to evaluate the result of harmony al-
gorithm authors uses social spider algorithm. The proposed
algorithm performs well in reducing the peak to average
ration and electricity bill. The authors in [15], implement a
semi-online framework to reduce the wastage of resources.
The algorithm uses bin packing to map tasks to machines.
The authors in [16] use MSLBL technique. The proposed
algorithm preallocate tasks to minimize the scheduling length.
The results demonstrate that MSLBL in various condition
reduces the scheduling length of tasks. The authors in [17],
identified security challenges and solutions in IoT devices.
IV. S YSTEM M ODEL
The proposed model is Cloud and Fog integrated. Fog
encompasses software and hardware resources. It acts as an
intermittent layer between the Cloud and users and manages
the requests coming from different regions in the world
189
regarding the electricity consumption, thereby sharing the load
on the Cloud. The proposed system model constitutes of three
layered architecture. The first and topmost layer is the cloud
layer. The second and intermittent layer is the fog layer. The
third and the last layer is the user layer. In order to fulfill
the requests of the users these layers communicate with each
other. The proposed system model contains six regions that
are geographically dispersed in the entire world. Requests are
sent from the users to the fog regarding electricity demands
via smart meters which is part of the automatic metering
infrastructure (AMI). The fog in turn communicates with the
micro grid to fulfill the user demands. If Microgrid is unable
to provide the required electricity, than fog corresponds with
cloud for providing closer utility in order to meet the required
user demand. To manage the user requests regarding electricity
demands on the Fog various load balancing techniques have
been employed which are using the concept of virtualization.
The end-user layer contains two clusters of buildings with
multiple homes. Requests coming from the building are sent
to fog through the smart meter. When fog receives request
it looks for the nearest MG and establishes communication
with MG to fulfill users demand. If MG has the capacity
to fulfill the demand then respond back to respective fog
otherwise fog send the request to the cloud to search other MG.
Fog encompass various VMs to manage request and provide
services with optimized response time. Fog layer retains data
temporarily and to store data permanently fog send the request
to cloud. Fog is closer to the end-users and provides the same
services as the cloud. In this manner, end-users get services
with low delay time. Fog contains virtual machines to process
user requests. MGs are connected with fogs, users send the
request to fog to get energy from MG.
The cloud layer contains remote servers to provide on-
demand processing and management of data. Fogs are inter-
linked with the cloud. Fogs store user data temporarily. For
permanent storage data is sent to cloud.
The world is comprised of six regions which are Oceania,
Africa, Asia, Europe, South America, North America. In this
paper, region 3 and 4 i.e. Asia and Europe are assumed because
these regions contain a dense population and load balancing
issues arise in these regions. Two fogs are placed in each
region and fog are connected with the cluster of buildings.
A. Problem Formulation
The proposed model consist of fog and cloud. Fog encom-
passes software and hardware resources. It acts as an inter-
mittent layer between the Cloud and users and manages the
requests coming from different regions in the world regarding
the electricity consumption, thereby sharing the load on the
Cloud. The proposed system model constitutes of three layered
architecture. The first and topmost layer is the Cloud layer. The
second and intermittent layer is the Fog layer. The third and the
last layer is the User layer. In order to fulfill the requests of the
users these layers communicate with each other. The proposed
system model contains six regions that are geographically
dispersed. The user send requests via Smart Grid (SG) to
 





   

  



 

 






 








           

Fig. 1: Proposed System Model.

fog for computations and other required operations. The fog The following equation gives the number of houses in a
entertains the users request by efficient utilization of resource. particular cluster of building.
This efficient utilization of resources is obtained by the various
Load Balancing techniques employed at fog. Virtualization b

is used for efficient utilization of resources. In virtualization BLT otal = (BLm ) (3)
multiple Virtual Machines (VMs) are created at a single server m=1

providing services to the users. The RT is the time duration Let Total number of user requests UR a Fog can handle is
between uses’r request sent to fog and a response is received given by the Eq. below.
against that request. The processing time (PT) is the time
during which the fog process the user’s request The load u

balancing algorithms and virtualization help in reducing the U RT otal = (U Rj ) (4)
RT and PT of the fog. The total number of VMs associated j=1
with a particular fog is given by the following equation. The PT of a user request is given in equation below where
is the processing time and Sc is the task assigned to each of
v
 the request:
V MT otal = (V Mi ) (1)
i=1 m
n 

PT = (Pck ∗ Sc ) (5)
The number of clusters of buildings in a region is specified c=1 k=1
by the following equation.
Response Time is calculated using the following Equation:
c

CLT otal = (CLn ) (2)
n=1
RT = DelayT ime + F inishT ime − ArrivalT ime (6)

190
 V. L OAD BALANCING A LGORITHMS in this way equal numbers of the tasks are assigned to each
Load balancing is the process of fair distribution of re- virtual machine. No virtual machine is underutilized.
sources for efficient resource utilization. Resources may in-
clude nodes, network resources and processing units. Efficient D. Particle Swarm Optimization
resource utilization means to decrease the response, increase In PSO algorithm, solutions are known as particle and
throughput, and minimizing overheads. Details of the tech- population is known as the swarm. Each particle in PSO
niques are discussed below: consists of fitness value through which fitness function is
A. Round Robin evaluated. Each particle has a particular position in the entire
group. This algorithm is used to allocate users requests.
Round robin processes the request by selecting the virtual
machines randomly and then the workload gets allocated in the
circular manner. However it does not consider the processing E. Ant Colony Optimization
time. A request has to wait in queue if no virtual machine is ACO algorithm finds the suitable path from large range by
available. seeking the optimal path. In real-world ants roam to find food
B. Throttled and after finding food ants return back to their colony by laying
down a pheromone track. The other following ants follow the
Throttled algorithm assigns the workload uniformly to the same path to find food by searching the shortest path.
virtual machines. It takes care of the predefined amount of the
tasks are allocated to the virtual machine. Throttle maintains
index table with information of virtual machine. Throttle
assigns requests to that virtual machine that has the capacity
to fulfill end-user demand. Data center controller receives the
request and is then sent to the load balancer to allocate virtual
machine. From the index table, load balancer search for the
available virtual machine and allocate the virtual machine to
respective tasks.
C. Active Vm Algorithm
Active Vm distributes the workload equally to all the virtual
machines. Requests sent to datacenter are kept in queue. So

191
F. Odds Algorithm TABLE I: Response Time Summary
To search the virtual machine that can available to perform
Algorithms Average Minimum Maximum
useful tasks, odds algorithm use optimal stopping technique. (ms) (s) (ms)
In odds technique, virtual machines are checked one by one Round Robin 116.01 41.79 584.69
and stop on the first virtual machine that has enough capacity Active Vm 63.03 40.56 87.37
to perform tasks. ACO 143.60 42.63 577.13
Throttled 63.07 38.70 87.37
VI. S IMULATIONS AND D ISCUSSION Odds 144.10 42.63 581.35
PSO 63.02 38.70 87.37
A system having Core i3 processor, four GB ram and
windows 7 operating system is used for simulations. In this
thesis, for simulation purposes, the comparison of PSO is 150
done against round robin, Active Vm, ant colony optimization,
throttled and odds algorithm. The performance parameters
considered are response time and response time. CloudAnalyst

Overall Response Time ( ms )

is used to performing the simulation.
Load balancing based on resource utilization dynamically 100

allocates the tasks to a particular VM which is determined by

VM’s speed, memory and power consumption. After finishing
the processing of the request, it evaluates the start time, finish
time, execution time and cost of the job.
50

160

140
0
RR Active ACO Throt Odds PSO
120 Algorithms
Response Time ( ms )

100 Fig. 3: Overall RT of Fogs

80

Round Robin
60 Active Vm
Round Robin ACO
40 Active Vm Throttle
ACO Odds
Throttle PSO
20 Odds
PSO 120
0
Cluster 1 Cluster 2 Cluster 3 Cluster 4 100
Processing Time ( ms )

Clusters
80
Fig. 2: Average RT of Clusters.
60

PSO optimizes the load on the fog by efficient allocation 40

of recourses. PSO finds the most optimal solution for every
task and schedules the requests in most efficient way. Results 20

show that it is better for load balancing as compared to

0
robin, Active Vm, ACO, throttled and odds algorithm. Results Fog1 Fog2 Fog3 Fog4
show a very little difference between odds algorithm and ant Fogs

colony optimization. Round robin perform better than both
odds algorithm and ant colony optimization. Table I shows
the response time summary of above mentioned algorithms.
PSO outperforms other algorithms.
Fig. 3 display average response times obtained by robin,
Active Vm, ACO, PSO, throttled and odds algorithm is 116.01
ms, 63.03 ms, 143.60 ms, 63.07 ms, 144.10 ms and 63.02 ms
respectively.
Fig. 4: Average PT Of Fogs
PSO optimizes the load on the fog by efficient allocation
of recourses. PSO finds the most optimal solution for every
task and schedules the requests in most efficient way. Results
show that it is better algorithm for optimizing processing time
in comparison to robin, Active Vm, ACO, throttled and odds

192
algorithm. Results show a very little difference between odds R EFERENCES
algorithm and ant colony optimization. Round robin perform [1] Z. Cao, J. Lin, C. Wan, Y. Song, Y. Zhang, and X. Wang, “Optimal
better than both odds algorithm and ant colony optimization. cloud computing resource allocation for demand side management in
Table II shows the processing time summary of above men- smart grid,” IEEE Transactions on Smart Grid, vol. 8, no. 4, pp. 1943–
1955, 2017.
tioned algorithms. PSO outperforms other algorithms. [2] J. Kim and Y. Kim, “Benefits of cloud computing adoption for smart
grid security from security perspective,” The Journal of Supercomputing,
TABLE II: Processing Time Summary vol. 72, no. 9, pp. 3522–3534, 2016.
[3] M. A. Al Faruque and K. Vatanparvar, “Energy management-as-a-service
over fog computing platform,” IEEE internet of things journal, vol. 3,
Algorithms Average Minimum Maximum no. 2, pp. 161–169, 2016.
(ms) (s) (ms) [4] M. Chiang and T. Zhang, “Fog and iot: An overview of research
Round Robin 66.33 0.30 531.56 opportunities,” IEEE Internet of Things Journal, vol. 3, no. 6, pp. 854–
Active Vm 13.40 0.17 26.12 864, 2016.
ACO 93.95 1.14 530.31 [5] M. Hussain, M. S. Alam, M. Beg et al., “Fog computing in iot
Throttled 13.45 0.30 26.12 aided smart grid transition-requirements, prospects, status quos and
Odds 94.59 0.64 530.53 challenges,” arXiv preprint arXiv:1802.01818, 2018.
[6] G. Ramadhan, T. W. Purboyo, and R. Latuconsina, “Experimental
PSO 13.39 0.17 26.12 model for load balancing in cloud computing using throttled algorithm,”
International Journal of Applied Engineering Research, vol. 13, no. 2,
pp. 1139–1143, 2018.
[7] F. Luo, J. Zhao, Z. Y. Dong, Y. Chen, Y. Xu, X. Zhang, and K. P. Wong,
“Cloud-based information infrastructure for next-generation power grid:
100
Conception, architecture, and applications,” IEEE Transactions on Smart
90
Grid, vol. 7, no. 4, pp. 1896–1912, 2016.
[8] S. Bera, S. Misra, and J. J. Rodrigues, “Cloud computing applications
80 for smart grid: A survey,” IEEE Transactions on Parallel & Distributed
Overall Processing Time ( ms )

Systems, no. 5, pp. 1477–1494, 2015.

70
60
50
40
30
20
10
0 [13] A. U. Rehman, S. Aslam, Z. U. Abideen, A. Zahra, W. Ali, M. Junaid,
RR Active ACO Throt
Algorithms
Fig. 5: Overall PT of Fogs.
Fig. 5 display average response times obtained by round
robin, Active Vm, ACO, throttled, odds algorithm and PSO is
66.33 ms, 13.40 ms, 93.95 ms, 13.45 ms, 94.59 ms and 13.39
ms respectively.
VII. C ONCLUSIONS
The model proposed in this paper is three layered, which is
based on Fog environment along with its integration with the
SG. The fundamental objective of the proposed model is to op-
timally manage the resources of SG. Six regions are considered
in the proposed scenario which are geographically dispersed as
six continents of the world. Two regions are considered in this
scenario with two fogs in each region to manage the request
of the users with two cluster of buildings in each region. The
simulations are performed in CloudAnayst for comparing the
performance of various load balancing algorithms. The results
of all mentioned algorithms are compared under the same
scenario as explained in the paper. PSO outperform round
robin, Active Vm, ACO, throttled and odds algorithm in terms
of response and processing time.
[9] S. R. Branch and S. Rey, “Providing a load balancing method based
on dragonfly optimization algorithm for resource allocation in cloud
computing,” 2018.
[10] C. Li, H. Zhuang, Q. Wang, and X. Zhou, “Sslb: Self-similarity-based
load balancing for large-scale fog computing,” Arabian Journal for
Science and Engineering, pp. 1–12, 2018.
[11] S.-L. Chen, Y.-Y. Chen, and S.-H. Kuo, “Clb: A novel load balancing
architecture and algorithm for cloud services,” Computers & Electrical
Engineering, vol. 58, pp. 154–160, 2017.
[12] W. Ali, A. U. Rehman, M. Junaid, S. A. A. Shaukat, Z. Faiz, and
N. Javaid, “Home energy management using social spider and bacterial
foraging algorithm,” in International Conference on Network-Based
Information Systems. Springer, 2017, pp. 245–256.
Odds PSO and N. Javaid, “Efficient energy management system using firefly and
harmony search algorithm,” in International Conference on Broadband
and Wireless Computing, Communication and Applications. Springer,
2017, pp. 37–49.
[14] M. Junaid, M. H. Rahim, A. U. Rehman, W. Ali, M. Awais, T. Bilal,
and N. Javaid, “Demand side optimization in smart grid using harmony
search algorithm and social spider algorithm,” in International Confer-
ence on P2P, Parallel, Grid, Cloud and Internet Computing. Springer,
2017, pp. 16–25.
[15] V. Armant, M. De Cauwer, K. N. Brown, and B. O’Sullivan, “Semi-
online task assignment policies for workload consolidation in cloud
computing systems,” Future Generation Computer Systems, vol. 82, pp.
89–103, 2018.
[16] W. Chen, G. Xie, R. Li, Y. Bai, C. Fan, and K. Li, “Efficient task schedul-
ing for budget constrained parallel applications on heterogeneous cloud
computing systems,” Future Generation Computer Systems, vol. 74, pp.
1–11, 2017.
[17] W. Ali, G. Dustgeer, M. Awais, and M. A. Shah, “Iot based smart home:
Security challenges, security requirements and solutions,” in Automation
and Computing (ICAC), 2017 23rd International Conference on. IEEE,
2017, pp. 1–6.

193
 2018 International Conference on Frontiers of Information Technology (FIT)
Lexicon and Heuristics Based Approach for
Identification of Emotion in Text
Junaid Akram
RCMS, NUST
Islamabad, Pakistan
jakram.mscse15@rcms.nust.edu.pk
Abstract—Recognition of emotion from text is emerging as
new field of research which can add another dimension to the
analysis of textual data. People directly or indirectly express their
emotion through facial expressions, speech or written content.
People are putting a lot of textual content on social media
and microblogging platforms. This data can be very useful in
discovering different aspects including emotions. Recognition of
emotion is a very complex task. We propose a technique which
uses word lexicons, emoticons, negations and intensity modifiers.
Our approach follows Ekman’s emotion model. Word lexicons
are generated using WordNet from a set of seed words collected
manually. Twitter is used to collect emoticons. Negations and
intensity modifiers are collected manually from literature. Several
heuristic rules are designed to support our keyword spotting
technique. Experiments on data obtained from Twitter shows
high precision and recall for all emotional classes.
Index Terms—emotion recognition, natural language process-
ing, text analysis, text classification
I. I NTRODUCTION
In the current era of smart phones and social networks,
people like to share their successes, emotions and sentiments
in the form of audio and video files. Popularity of interactive
interfaces is increasing day by day, but most of the people on
social media still use text as the medium of interaction and
communication.
To express opinion toward some person, event or thing,
text is still the preferred medium. Identification of emotion
from text is still a very challenging task. It become easier to
identify emotion from textual content if every word has an
emotional context associated with it. But in majority cases,
the text doesn’t have a clear emotion and has a mixture of
different emotions. Sometimes emotion is represented in a
subtle way. In some cases, textual content is ambiguous and
has multiple meanings. With the evolution of language there
are many slangs that are very common. Sarcasm is also very
hard to identify automatically. In the text available online,
there are spelling mistakes, incorrect grammar and acronyms
used widely. Automatic emotion extraction from is a very
challenging task due to above mentioned limitations. But it
is a very popular task among researchers.
We propose a novel approach to identify emotion in text
which uses a mixture of lexicon spotting and several heuristic
rules. Our approach is based on the use of keywords which
relate to emotion categories. Our approach works in three
978-1-5386-9355-1/18/$31.00 ©2018 IEEE
DOI 10.1109/FIT.2018.00058
Arsalan Tahir
RCMS, NUST
Islamabad, Pakistan
atahir.mscse17@rcms.nust.edu.pk
steps. First, we make a lexicon of words, then we use
both the human judgment power and WordNet [1]. We used
seed words to automatically generate emotion lexicons using
WordNet. Second one is, consider ”:)”, ”¿: O” and ”ROFL”
through a large emoticons dataset and third one is to reduce
many problems linked with keyword spotting techniques us-
ing various heuristic rules. Our approach classifies text into
Ekman’s six emotion classes i.e. Happiness, Sadness, Anger,
Fear, Disgust and Surprise [2]. Therefore, we can say that
described technique can analyze the online fragmented text
communication that is rich in contextual expressions.
We concluded that our proposed algorithm gives promising
results which shows high precision and recall for classification.
The detailed study of results and methods is discussed in
further sections.
II. R ELATED W ORK
There are different approaches like, statistical language
processing, and large-scale knowledge-based approaches to
identify emotional keywords. According to inaccuracy of
human emotions and the texts they express, available methods
are not suitable. There are some disadvantages and advantages
of available methods.
In the field of research that is like the identification of
emotions, but the analysis of emotions is different. Both areas
target on the identification of emotions and use different mod-
els of representation. The analysis of sentiments describes the
problem of classifying the negative / positive behavior ( [3],
[4]), while the analysis of the emotion represents classification
of text into fine-grained emotions. As we focus on dividing
the text into six categories of emotions and determining the
actual emotional weights, we target mainly on the emotion
recognition.
A. Keyword-Spotting Approach
Established and natural approach to the identification of
emotions based on the recognition of emotional keywords.
It is very straightforward approach in which keywords are
matched from the dataset of keywords. Usually Noun, Ad-
jectives, Verbs and Adverbs (NAVA) carry emotional context.
So NAVA words chosen from the input using Part-of-Speech
tagging. Then the extracted words are compared to the list
of words representing different emotions. Different techniques
293
 TABLE I: Summary of Related Work

Author(s) Approach(es) Emotion(s) Feature(s) Limitation(s)

Summa et Machine Learning Ekman model Combines linguistic, temporal, and spatial infor- Low accuracy
al. [5] mation; computes similarity between tweet nodes
Sen et al. Machine Learning Circumplex model Multitasking Neural Networks are used to train the -
[6] [7] system
Gupta et al. Machine Learning Angry, happy, sad Naive bayes, decision trees and SVM used. High Can’t handle context
[8] accuracy
Jain et al. Machine Learning Ekman model Corpus-based features used. gives detailed survey -
[9] on election prediction tweets
Dini et al. Lexicon-Based, Ekman model two corpus created. On lexicon based and one ML Quality verification
[10] Machine Learning based. needed for corpora
Mohammad Regression Anger, fear, joy, sad- Intensity detected. Four datasets of tweets used. Accuracy not verified
et al. [11] ness
Kang et al. Bayesian Inference Anger, anxiety, ex- Semantic dimensions computed. HDWET and -
[12] pect, hate, joy, love, DWET applied. High accuracy achieved by DWET.
sorrow, surprise
Perikos et Machine Learning Circumplex model polarity detection, analysis by three classifiers, Lack of lexical re-
al. [13] [7] voting system decides output sources, low accuracy
Tiwari et Machine Learning, Ekman Model gives survey of emotion detection methods. NAVA small dataset used
al. [14] Rule-Based extracted by POS tagging. Machine learning used which makes results
with set of rules unreliable
Kanger et Fuzzy Logic, Neu- Anger, Happy, Sad Features extracted by fuzzy rules. Neural Network three emotions only
al. [15] ral Network classifies text
Grover et Keyword Spotting, Ekman model Features extracted by rule-based engine. SVM and For Punjabi language
al. [16] Machine Learning Naive Bayes used for classification only
Joshi et al. Lexicon Based Angry, Anxious, Computes emotion from tweets in real time. Com- Lack of detection of
[17] Happy, Sad putes excitement during cricket matches. subjectivity
Ghazi et al. keyword spotting, Ekman model syntactic and semantic feature extraction. Classifi- Lack of generalization
[18] machine learning, cation of text is done using machine learning and of features
regression logical regression

are applied if more than one emotion keyword is found
in a sentence. . In [19], a computational keyword spotting
technique is proposed. It combines syntactic and semantic
information to detect emotion. The emotion matched with the
keywords is considered the emotion of the sentences. There a
lot of techniques to create dictionaries for different emotions.
One of the free tool available is WordNet, which categorizes
words in the form of set of synonyms.
the quality and size of dataset. The dataset should contain
annotated emotion rich text. In [20], a large dataset of tweets
is collected. Support Vector Machines and majority classifier
is used to predict emotion from input text.
This alternative to keyword identification also increase
problems: lack of semantic precision large corpus required for
built execution and rejection in many cases and other syntactic
constructions [21].

B. Lexicon-Based Approach and WordNet D. Rule-Based and Hybrid Approaches

Emotion Recognition by this approach involves making and
using lexical resources with emotional keywords. Lexicons
are generated which are associated with emotional weights.
The weights are calculated for each word in a sentence
and the emotion is identified based on the highest weight.
WordNet is also very popular in this approach. WordNet
approaches use semantic links between words for the English
language [1]. In [11], lexicon based approach is used with a
regression model. Intensity of emotion is also computed in
this approach. In [10], two corpus have been developed. One
corpus for machine learning and other for symbolic lexicon
based approach. Lexicon based approach performs better.
C. Machine Learning Approaches
Statistical and machine learning approaches are also very
commonly used for emotion detection. These approaches
require a dataset to train the classifier. Accuracy depends on
There are many other approaches, such as language ap-
proaches based on advanced rules, that target on the recog-
nition of text. In [22], a system is proposed consisting of
a character identification platform and an emotion classifier.
The classifier uses the artificial neural network based on
Knowledge Based Artificial Neural Network, which uses rules
and knowledge domain. In [21], a rules-based approach is
introduced for emotion recognition called AAM (Affected
Model Analysis). Words, emoticons and slangs based dictio-
nary is used in this approach.
In hybrid approaches, two are more methods in a combi-
nation are used. Hybrid approaches usually show very high
accuracy( [19], [14]).
III. DATA C OLLECTION
Our approach is hybrid which combines keyword spotting
techniques with several heuristic rules. Keyword spotting

294
is based on lexicons generated from Wordnet synsets and Algorithm 1 Generation of Emotion Lexicon Dataset
emoticons from twitter and other social networking sites. Some
1: Input: Seed Words for lexicon generation
common abbreviations and slangs are also included in the
2: Output: Emotion Lexicon Dataset
emoticon dataset. Emoticon dataset is generated manually.
3:
Both lexicon and emoticons are associated with weights which
4: SW = Set of Seed Words
relate to corresponding to Ekman’s six basic emotions i.e. hap-
5: SW.type = Emotion Category of Word
piness, sadness, fear, anger , surprise, disgust. Each emotion
6: // 1 = Happy, 2 = Sad, 3 = Angry,
is weighted between 0 and 1. We chose Ekman’s emotional
7: // 4 = Fear, 5 = Disgust, 6 = Surprise
model because it is most commonly used for textual emotion
8: SW.Iter = Iteration of Seed word
classification.
9: LD = Lexicon Dataset
10: LD.emo = 6-tuple of weights of emotion categories
11:
A. Lexicon Dataset
12: for i = 1 to I = 3 do
The method we use to generate lexicons is proposed by 13: N = number of seed words
[23]. We start with a small set of seed words which are unam- 14: for n = 1 to N do
biguously semantically synonymous to the relevant emotional 15: Find synsets of SW[n]
category. These seed words act as a starting point to start 16: Add synsets to SW
collecting lexicons from WordNet. Our approach assumes that 17: Category of synsets = SW[n].type
the closer the word is to the seed words semantically higher 18: Iteration of synsets = (SW[n].Iter + 1)
the weightage of the emotion. In order to create the set of
seed words we conducted a study with three persons related to 19:
20: if SW[n] do not exist in LD then
English literature. We asked them to list at least six words for 21: Add SW[n] to LD
each emotion which is synonymous to the relevant emotion. 22: end if
We selected these words to be our seed words. Such words 23:
were “satisfaction” for happiness, “depression” for sadness, 24: value = 1 - (SW[n].Iter * 0.1)
“panic” for fear, “frustration” for anger, “unexpected” for 25: if SW[n] exist in LD then
surprise, “filth” for disgusting etc. 26: if value > LD.emo[SW[n].type] then
Then we use these seed words to generate synsets from 27: LD.emo[SW[n].type] = value
WordNet. A synset is a group of synonyms which are seman- 28: end if
tically similar. Many words can have more than one meaning 29: else
and can show different intensities of different emotions. So, it 30: LD.emo[SW[n].type] = value
is likely that they can be found in more than one synset. The 31: end if
rules for generation of lexicons are described in Algorithm 1. 32: Delete SW[n] from SW
The algorithm explains that the WordNet is searched for 33: end for
synsets based on the seed words. The word used to generate 34: end for
synsets is then added to the lexicon dataset with calculated
weights of the emotional categories. These synsets are then
added to the list of seed words with the emotion category
and the iteration number. This step is repeated I times. In B. Emoticon Dataset
our case I is 3. 1400 words are commonly used in the 70%
of communication. I is set to 3 because in three iterations,
more than 3700 lexicons are generated which can sufficiently An emoticon is a symbol that is used to express emotion by
recognize the emotion in text. With each iteration the weights typographically making a facial expression, such as :(, :’(, :).
are penalized by 10 percent. When all lexicons have been Emoticons are used to tag the text with an emotion, showing
generated, they are stored in a file. The lexicon dataset consists more explicitly that how a text should be perceived.
of more than 3700 words. With the wide use emoticon in online communication plat-
forms such as Facebook and Twitter we argue that any textual
TABLE II: A Small Portion of Lexicon Dataset emotion recognition algorithm should consider emoticons.
Unfortunately, WordNet or any other lexical database do not
Word Happy Sad Anger Fear Disgust Surprise contain emoticons. Therefore, we manually created the emoti-
frustrated 0 0 0.6 0 0 0 con dataset. We collected most popular and commonly used
satisfaction 1.0 0 0 0 0 0
emoticons from Skype, Twitter and Facebook. Emoticons are
feisty 0 0.4 0 0.4 0.4 0
offend 0 0.25 0.25 0 0 0.25 quite self-explanatory in expressing their emotional semantics.
sudden 0 0 0 0 0 1.0 So, we assigned them with suitable weights. We also included
slangs and abbreviations like “OMG”, “LOL”, “damn”, “yuck”
in our emoticon dataset.

295
 TABLE III: A Small Portion of Emoticon Dataset Algorithm 2 Emotion Recognition
Emoticon Happy Sad Anger Fear Disgust Surprise
1: Input: A string T of text
:( 0 1.0 0 0 0 0 2: Output: Recognized Emotion E from the text
:) 1.0 0 0 0 0 0 3:
lol 1.0 0 0 0 0 0 4: Split T into Sentences S
damn 0 0.5 1.0 0 0 0
5: N = number of sentences
6: Total Weights = 0
C. Negations and Intensity Modifiers 7: // Happiness = Sadness = Anger = 0
8: // Fear = Disgust = Surprise = 0
Negations are a very important part of a language. Negation
9:
can flip the emotion of a sentence. Like “I am happy” and “I
10: for n = 1 to N do
am not happy” have opposite emotional semantics. Keyword
11: if S[n] has Exclamation Mark then
spotting and machine learning techniques have difficulty deal-
12: Increase emotion weights of S[n] by 20%
ing with negations. So we created a dataset of commonly used
13: end if
negation from the literature, such as ”no”, ”not”, ”wouldn’t”
14: if S[n] has “?!” then
etc. We have developed some heuristics to tackle this problem.
15: Set S[n]’s emotion weight of surprise to 1
There are some adverbs which highly increase the emotional
16: end if
intensity of a sentence. But keywords spotting techniques also
17: Split Sentence S[n] into words W
neglect this. Adverbs don’t carry emotional semantic them-
18: M = number of words
selves but have a huge impact on the intensity of emotions. So
19: for m = 1 to M do
we have collected commonly used adverbs from the literature
20: if W[m] is emoticon then
which act as intensity modifiers of emotions, such as “highly”,
21: W[m] weights = Emoticon’s weights
“extremely”, “eminently” etc.
22: Break for loop
IV. E MOTION R ECOGNITION 23: else
24: if W[m] is in uppercase then
Briefly, our approach gets text as input, parse it into sen-
25: Increase weights of W[m] by 50%
tences, Parse sentences into words, compare these words to
26: end if
lexicon dataset and then applies heuristics to the text. Java’s
27: if W[m] is preceded by intensity modifier
BreakIterator class is used to parse text.
then
We have developed several heuristics to overcome issues
28: Increase weights of W[m] by 50%
associated with keyword spotting techniques, such as detection
29: end if
and handling of negations. Finally, the algorithm computes the
30: end if
overall emotion of the text.
31: end for
The heuristics which apply to text are as follows:
32: if S[n] has negation then
• If there is an exclamation mark in the sentence then the
33: Flip emotion weights of S[n]
emotion gets intensified by 20 34: //Assign Happiness weight to Sadness and
• If the sentence consists of “?!” or “!?” or any other
35: // Assign Sadness + Anger weights to Happiness
random combination of characters then surprise weight 36: end if
is set to zero. 37: Add emotion weights of S[n] to Total Weights
• If a word is in uppercase the emotion is intensified by 50
38: end for
• If a word is preceded by intensity modifier then emotion
39: return emotion with highest weight
get intensified by 50
• If a negation is spotted in a sentence, the values of posi-
tive emotion (happiness) and negative emotions(sadness,
anger, fear and disgust) get switched. V. R ESULTS
Algorithm 2 explains the identification of emotion in text. We have collected random 150 tweets to evaluate our
For example, we take a sentence “I am not brokenhearted!”. system. The collected dataset was presented to five participants
In this sentence the algorithm will only detect the emotion from National University of Sciences and Technology (NUST).
keyword “brokenhearted”, which has the following emotion The participants were fluent in English language and were
vector: [0.0, 0.8, 0.0, 0.0, 0.0, 0.0], which only carries the familiar with the modern day slangs and abbreviations. The
weight of sadness. But there is a negation in the sentence so participants were regularly using social networks and mi-
the emotional weights gets switched. Now happiness carries croblogging platforms. The participants annotated the dataset
weight of 0.8. There is an exclamation mark at the end of based on the Ekman’s six emotions. The emotion of the tweet
the sentence so the weights of the sentence get intensified by was selected through a voting based approach. The emotion
20%. So the new vector will be [0.80, 0.0, 0.0, 0.0, 0.0, 0.0]. selected by the majority of the participants was selected for
The dominant emotion of the sentence is happiness. the respective tweet.

296
 TABLE IV: Precision, Recall, and F-Measure for Each [3] N. Sharma, R. Pabreja, U. Yaqub, V. Atluri, S. Chun, and J. Vaidya,
“Web-based application for sentiment analysis of live tweets,” in
Emotion Class Proceedings of the 19th Annual International Conference on Digital
Government Research: Governance in the Data Age. ACM, 2018, p.
Emotion Precision Recall F-Measure 120.
Happy 0.9512 0.8297 0.886 [4] F. Poecze, C. Ebster, and C. Strauss, “Social media metrics and sentiment
Sad 0.7941 0.7941 0.7941 analysis to evaluate the effectiveness of social media posts,” Procedia
Anger 0.7222 0.9286 0.8125 computer science, vol. 130, no. C, pp. 660–666, 2018.
Fear 0.9 0.6833 0.7832 [5] A. Summa, B. Resch, and M. Strube, “Microblog emotion classification
Disgust 0.9230 0.9230 0.9230 by computing similarity in text, time, and space,” in Proceedings of the
Surprise 0.846 0.7333 0.7856 Workshop on Computational Modeling of People’s Opinions, Personality,
Average 0.8576 0.8153 0.8307 and Emotions in Social Media (PEOPLES), 2016, pp. 153–162.
[6] A. Sen, M. Sinha, S. Mannarswamy, and S. Roy, “Multi-task repre-
sentation learning for enhanced emotion categorization in short text,”
in Pacific-Asia Conference on Knowledge Discovery and Data Mining.
Out of 150, 109 tweets were detected correctly. So the Springer, 2017, pp. 324–336.
system shows 73% accuracy. But accuracy alone is not a [7] J. A. Russell, “A circumplex model of affect.” Journal of personality
and social psychology, vol. 39, no. 6, p. 1161, 1980.
good measure for classification. So we have also computed [8] U. Gupta, A. Chatterjee, R. Srikanth, and P. Agrawal, “A sentiment-
precision, recall and f-measure as shown in TABLE IV. and-semantics-based approach for emotion detection in textual conver-
Our approach show very high precision for happiness, fear sations,” arXiv preprint arXiv:1707.06996, 2017.
[9] V. K. Jain, S. Kumar, and S. L. Fernandes, “Extraction of emotions from
and disgust i.e. 0.9512, 0.9 and 0.923 respectively. Precision multilingual text using intelligent text processing and computational
for sadness and anger is slightly low i.e. 0.7941 and 0.7222 re- linguistics,” Journal of Computational Science, vol. 21, pp. 316–326,
spectively. We have achieved a very high recall value for anger 2017.
[10] L. Dini and A. Bittar, “Emotion analysis on twitter: The hidden
and disgust i.e. 0.9286 and 0.923 respectively. The f-measure challenge.” in LREC, 2016.
scores range from 0.7832 to 0.923 which is significantly above [11] S. M. Mohammad and F. Bravo-Marquez, “Wassa-2017 shared task on
baseline scores for all classes. emotion intensity,” arXiv preprint arXiv:1708.03700, 2017.
[12] X. Kang, F. Ren, and Y. Wu, “Exploring latent semantic information
for textual emotion recognition in blog articles,” IEEE/CAA Journal of
VI. C ONCLUSIONS AND F UTURE W ORK Automatica Sinica, vol. 5, no. 1, pp. 204–216, 2018.
We have proposed an approach to identify emotion in text [13] I. Perikos and I. Hatzilygeroudis, “Recognizing emotions in text using
ensemble of classifiers,” Engineering Applications of Artificial Intelli-
which can handle formal and informal communication. We gence, vol. 51, pp. 191–201, 2016.
have incorporated emoticons and slangs commonly used in [14] S. P. Tiwari, M. V. Raju, G. Phonsa, and D. K. Deepu, “A novel approach
the communication carried out on social networks and mi- for detecting emotion in text,” Indian Journal of Science and Technology,
vol. 9, no. 29, 2016.
croblogging platforms. In addition, we have handles negations [15] N. Kanger and G. Bathla, “Recognizing emotion in text using neural
by making a dataset of commonly used negations. Common network and fuzzy logic,” Indian Journal of Science and Technology,
machine learning based approaches are unable to handle vol. 10, no. 12, 2017.
[16] S. Grover and A. Verma, “Design for emotion detection of punjabi text
negations. We have also collected commonly used adverbs using hybrid approach,” in Inventive Computation Technologies (ICICT),
which intensify the emotion of a sentence. Our approach gets International Conference on, vol. 2. IEEE, 2016, pp. 1–6.
text as input, matches the words with our lexicon and emoticon [17] A. Joshi, V. Tripathi, R. Soni, P. Bhattacharyya, and M. J. Carman,
“Emogram: An open-source time sequence-based emotion tracker and
datasets, set the the emotional weights accordingly. Various its innovative applications.” in AAAI Workshop: Knowledge Extraction
heuristics are designed to support the algorithm. Our approach from Text, 2016.
show very high precision for happiness, disgust and fear. F- [18] D. Ghazi, D. Inkpen, and S. Szpakowicz, “Prior and contextual emotion
of words in sentential context,” Computer Speech & Language, vol. 28,
measure scores are significantly above baseline scores for all no. 1, pp. 76–92, 2014.
the classes. [19] H. Binali, C. Wu, and V. Potdar, “Computational approaches for emotion
In future, we will improve the performance of our approach. detection in text,” in Proceedings of the IEEE international conference
on digital ecosystems and technologies (DEST 2010). IEEE, 2010, pp.
We have achieved relatively lower precision for sadness and 172–177.
anger. We will more focus on these classes. Try to design [20] S. M. Mohammad and S. Kiritchenko, “Using hashtags to capture fine
heuristics which can help us improve the performance for these emotion categories from tweets,” Computational Intelligence, vol. 31,
no. 2, pp. 301–326, 2015.
classes. [21] A. Neviarouskaya, H. Prendinger, and M. Ishizuka, “Affect analysis
We will refine our lexicon dataset and extend the emoticon model: novel rule-based approach to affect sensing from text,” Natural
dataset. Handling negations is a very complex task. For Language Engineering, vol. 17, no. 1, pp. 95–135, 2011.
[22] Y.-S. Seol, D.-J. Kim, and H.-W. Kim, “Emotion recognition from
example, ”Not very disappointed, just a little bit” does not text using knowledge-based ann,” in ITC-CSCC: International Technical
imply that we flip the emotional weights but to decrease the Conference on Circuits Systems, Computers and Communications, 2008,
weights. We will study more about semantics and try to handle pp. 1569–1572.
[23] C. Ma, H. Prendinger, and M. Ishizuka, “Emotion estimation and reason-
the issue. Double negations in a sentence are also a issue we ing based on affective textual interaction,” in International Conference
will like to resolve. on Affective Computing and Intelligent Interaction. Springer, 2005, pp.
622–628.
R EFERENCES
[1] G. A. Miller, “Wordnet: a lexical database for english,” Communications
of the ACM, vol. 38, no. 11, pp. 39–41, 1995.
[2] P. Ekman, “An argument for basic emotions,” Cognition & emotion,
vol. 6, no. 3-4, pp. 169–200, 1992.

297
 ,QWHUQDWLRQDO&RQIHUHQFHRQ2SHQ6RXUFH6\VWHPVDQG7HFKQRORJLHV,&2667

Handover Management in 5G Software Defined

Network Based V2X Communication
Haider Rizvi, Junaid Akram
Research Center for Modeling and Simulation (RCMS)
National University of Sciences and Technology (NUST)
Islamabad, Pakistan
E-mail: hani-rizvi@hotmail.com, jakram.mscse15@rcms.nust.edu.pk,

Abstract—Vehicle-2-Everything (V2X) communication consists
of mainly two types of communication, one is Vehicle to Vehicle
(V2V) and the other is a vehicle to infrastructure(V2I).V2X has
many uses including road safety that can help avoid collisions to
infotainment like traffic information, navigation, and multimedia.
As the driver assistance systems are rapidly growing, user inter-
action and acceptance of these systems has to be evaluated. The
aim of this work is to improve an already existing communication
model for V2X communication by minimizing the handover dura-
tion. IEEE 802.11p has been a standard for V2X communication.
In IEEE 802.11p, due to high density, the data collision occurs.
So we replaced IEEE 802.11p with 5G SDN based approach.
Now the current communication simulation implements the X2
interface based Vehicle Unit Inter-system handover (VUIH)” in
a partially 5G SDN-based V2X communication. Our proposed
approach has achieved much better results than the baseline
results. We have optimized the preparation time of handover by
1.24ms and completion time of handover by 0.8308ms.
Index Terms—Handover, V2X Communication, Software De-
fined Networks, VU Vehicle Unit.
I. I NTRODUCTION
Vehicular communications, especially Vehicle-to-
infrastructure (V2I),use several wireless technologies.
However, they are either capacity limited or coverage limited.
Scalability is another issue considered in such platforms.
The Vehicular Ad-hoc Networks (VANETs) that utilize the
networks standard IEEE 802.11p are proposed to be used
for vehicular communications. Efficient traffic control and its
management is a prime parameter to avoid road accidents
by enabling vehicles to cooperate, in order to balance the
traffic flow steering wheels angles and best end to end
transportation. Various research works have been carried out
on improving the Vehicle-to-Everything (V2X) architecture. In
this research we explore other important aspects that improves
performance and robustness specifically for Vehicle to Vehicle
(V2V),Vehicle to a person (V2P) and Vehicle to Infrastructure
(V2I) communications by using LTE since 3GPP release 16
also supports V2X communications which are a potential
candidate for V2V in terms of latency, reliability, and
throughput. For the procurement of these set requirements
and to address major capacity and coverage issues we have to
utilize radio resource management algorithms or re-encounter
the previous algorithms for decreasing the interference and
enabling a better quality of Services( QoS). The signal from
one place to another place should be transmitted or received
in optimal time which leads to the low latency rate in V2X
communication.
Vehicle to everything (V2X) communication is basically
passing data from vehicle to any element which impact the
vehicle. V2X brings many services like automatic driving,
Traffic information, Current and upcoming position, vehicle
control information, traffic and road safety services. IEEE
802.11p has been standardized the V2X. In IEEE 802.11p, due
to high density the data collision is occurred. So we replace
IEEE 802.11p with 5G SDN based approach.
We have organized the remaining portion of this paper as
followed; In Section II, the relevant literature is reviewed
whereas the proposed system model and methodology in-
cluding handover management and experimental explanation
are considered in section III and IV. Section V presents the
simulation and discussion about the proposed methodology.
Finally section VI infers the overall simulation and results in
the form of conclusion.
II. L ITERATURE R EVIEW
The rapid evolution of mobile data information has been
extensively known and accountable, therefore the vehicular
communication trade is getting ready to deal with a 100x
rise of data by 2021 over 2011 [1]. Additionally, associated
individuals see their smartphone devices as an extension of
their working area whereas on the move and therefore the
continuous enhancement to the mobile specification is turning
into progressively necessary to support the performance needs
for the persistent wireless connections.
Furthermore. due to the growing demand of wireless com-
munications for a wide range of purposes, wireless network
infrastructure required more flexibly and to make them adap-
tive to match the actual demands. In this context during the
recent years Software Defined Networking (SDN) [2] and
Network Function Virtualization (NFV) [3] have been adopted
heaps of courtesy from the analysis community of research and
standardized organizations. SDN provides versatile ways that
to analyze and manage network with efficiency with separation
of control, data plane and virtualization allows the hardware
infrastructure to be provided as a service by abstraction and
sharing of physical resources [4]. SDN and NFV are projected
to play a significant role in 5G [5]. One the other side, SDN
paradigm separates the control and data plane [6]. Control

‹,((( 
 ,QWHUQDWLRQDO&RQIHUHQFHRQ2SHQ6RXUFH6\VWHPVDQG7HFKQRORJLHV,&2667

plane carries signaling traffic for controlling the connections

and the data plane carries user data traffic. Moreover, In
control plane comprises the central logical Controller (CLC)
implemented in software that controls the network devices
that make up the data plane. In brief,the Network application
and controller platform are interconnected and control the data
traffic route from different nodes of network to other nodes as
shown in Fig.2 The CLC monitors the packet statistics of data
plane using OpenFlow Switches (OFS) protocol [7]. Overall
goal is to achieve low latency rate in V2X for ensure the safety.

Fig. 2: Network Infrastructure.

Fig. 1: 4G and 5G Comparison. When cellular network

improves continuously enhance the vehicle safety and
driving experience.

III. P ROPOSED S YSTEM M ODEL

In this work, we optimize the measurements of Handover
(HO) in vehicles when moving from one node to another node.
The objective is to assess the impact of mobility support on
an SDN-Based architecture instead of 4G Conventional archi-
tecture by evaluating the handover preparation, and execution
time in a small test case which is X2 based HO procedure.
There are mainly two techniques followed in HO which is
X2 and S1 interface based approach. In S1 interface handover,
two eNB (evolved node B) is not connected with same
Mobility Management Entity (MME) and an X2 interface
based HO, source and target eNB are directly connected
with same MME. As compared with both techniques, X2
interface is faster than S1, So we consider X2 HO is our
work. 5G SDN Based architecture is now only the logical base
assumption so we use LTE terminologies in this work and our
aim is to reduce the HO Preparation and Execution time by
updating some features of conventional LTE setup like SDN
permits to detach the GTP-tunneling. The conventional LTE
X2 Interface based network shown in Fig.3. To obtain these
targets, we generate a simulator of X2 interface Based HO
inter-system method in SDN based simulation by computing
HO preparation and completion times which is approximately
5.76ms and 7.48ms respectively. The MME is responsible for
paging, authentication, bearer activation and location update
of User Equipment(UE). The main contribution is to achieve
better low latency rate for control and data plane. These results
fulfill the control plane delay requirements of 5G networks of
Vehicle unit(VU).
This section comprises the recent work in SDN based V2X
communication. In heterogeneous network, The logical 5G
architecture of SDN depends on network slicing as given in
Fig. 3: X2AP in LTE Network.
Fig.4 and network support the multiple access technologies
(RATs) for assistance of efficient Cooperation between Small
cells and WiFi (non-3GPP) access points which are closely
arranged to accomplish the growing data traffic demand in
SDN Based V2X Communication [8].
Furthermore, device-to-device (D2D) communications are
used to increase system capacity and improve energy and spec-
trum efficiency while reducing communication delays [9]. The
concept of Network slicing is used by authors in [10] which is
as same as SDN/NFV by slicing the single physical network
into multiple dedicated networks virtually to overcome the
delays and tasks performed in parallel ways efficiently. The
different slices of networks perform different characteristics
like Multimedia, IoT, and V2X. In all virtualization techniques
with respect to 5G, HO is the main event triggered. Adaptive
and flexible handover should be oppressed to support mobility
management in service couturier. However, in [11], the author
has taken mainly three phases for network slicing in which
first phase comprises of virtualization of different networks
elements, in second step, SDN model is involved and in final
step, the virtualized network, Serving Gateway (S-GW) and
Path Gateway(P-GW) are detached. We consider the last phase
for our test case.
Several works have proposed different solution for scalabil-
ity, reliability and mobility in SDN based networks. In [12],


 ,QWHUQDWLRQDO&RQIHUHQFHRQ2SHQ6RXUFH6\VWHPVDQG7HFKQRORJLHV,&2667
Fig. 4: Network Slicing in 5G.
author defines different ways to implement SDN in mobile
system specifically in reference of mobility management such
as IP preservation, session continuity and reliability of HO.
Moreover, the author in [13] evaluates the HO execution time
by using OpenFlow protocol without modifying the current
standard interferences such as S5/S8 defined in 3GPP.
Fig. 5: System Model.
Our virtual system of V2X comprises of mainly three
domains in which 1st is vehicle domain, 2nd is wireless
network domain and last is the Internet domain. In the 1st
domain which is related to vehicle unit, covers many im-
portant functions like enhanced driving support, cloud-based
information, traffic updates and future position of vehicles
through GPS support. In the 2nd phase which is related to the
medium and access point through which the communication
has been done. Our medium is wireless and uses transducers
for receiving and transmitting data from VU to the Internet.
The last one is the internet domain which is the prime entity
of any communication system as shown in fig.5.
IV. M ETHODOLOGY
Here we discuss the HO management of Vehicle unit (VU)
in 3GPP devices and inter-networking between non-3GPP and
3GPP network devices by taking the test case of VU which
is moving from one node to another node. HO management
includes initial call setup and signaling flows of the call
by implementing the control plane commands on data plane
entities.
Moreover Fig.6 shows the overall signaling attachment of
VU during HO management. As we have seen, there are

Fig. 6: Initial Attachment Procedure.
four nodes for attachments and packet transmission during
HO which are named as node-1,2,3 and 4. VU is on node-
1. Node-2 is called as LTE- Evolved Access Node eNB
which is responsible for gateway of initial RQ and initial
VU Command (VUCM) between node 1 and 3. There are
mainly 6 attachment procedures during X2 interface LTE HO
which has been focused in our setup. In 1st step, initial RQ is
sent from node-1 to node-2. The command (CM) on node-2
is embedded in initial OPenFlow(OPF) Command (OPFCM)
refers towards the Network Controller (NC) on node-3. The
authentication and authorization of VU is done by virtual
Mobile management Entity (vMME) and home subscriber
server (HSS) functionalities due to NC, also Serving-GW and
Packet-GW of control plane(CP) performed at node 3. In
2nd phase, initial VUCM send from node-2 to node-3 with
OPF enabled functionalities. After these successful signaling
attachments, the 3rd step is OPF initial Reply CM is sending
back from node-3 to node-2. Now in step-3, node-2 send
the initial setup RQCM to node-3 and VU is registered and
successfully transfers the 1st data packet from node-1 to node-
2 via wireless radio link. In 5th step, node-2 generates the OPF
Packet In CM which is sent to node-3 from node-2. This CM
includes the information regarding to establish the Data plane.
In return of this CM OPF Packet out CM receives from node-3
to node-2 in 6th step. Finally node-3 assesses the packet header
where session continuity information(source and destination
of packet nodes IP addresses) and tunneling information is
stored. NC allocates new IP address to VU and builds the P-
GW and S-GW of data plane according to application where
it is needed on node-4 which is associated with the Virtual
 ,QWHUQDWLRQDO&RQIHUHQFHRQ2SHQ6RXUFH6\VWHPVDQG7HFKQRORJLHV,&2667

PDN. simulator executed in the ns-3 IDE using OpenFlow switch

Note that point to the functionalities of P-GW and S-
GW should be separated into control and data plane for
virtualization. Like LTE-A, Vehicle unit (VU) are terminal
which permits every VU to connect with the network through
eNodeBs. The VU runs user application which uses Data Plane
(DP) traffic. This procedure initiates the LTE control like HO
services [14].
A. Mobility Management
In partially virtualized LTE Network, the control plane
used in similar to that of LTE in our solution for instance.
Several changes required in architecture such as addition of
new process and extensions of functionality of the some LTE
Network elements are supported by mobility. Moreover, there
is a difference between the operation and upgration of data
plane in HO procedure in SDN.
1.3.
The machine hosting the ns-3 environment is standard PCs
with DELL manufactured motherboard, and 3rd generation
INTEL core i3-2370M CPU @ 2.40GHz with 4.00 GB RAM
Operating system is Linux Ubuntu 16.04.2 LTS, kernel version
4.10-generic.
The main module which is used in simulation is OpenFlow
switch1.3 which implements a connection to a controller
through a subclass of the Controller class, which can send
messages to deploy the flow table, in this way, the OpenFlow
switch performs. Besides this, many necessary modules like
point to point helper, core, internet, network and SDN modules
are used to perform simulation successfully.
By using this setup, we simulate that the handover procedure
works successfully and we measure the HO execution time of
our proposed scenario.

B. X2 Interface in Handover TABLE I: Transmission, Processing and Propagation Delay

The different nodes in HO are connected through an X2 Parameters Configuration
interface with each other and support control and data planes.
The Control Plane protocol is X2 Application Protocol be Parameter Value
Number of VU 1
located in Stream Control Transmission Protocol (SCTP). Number of eNB 2
Neighbor Information Table (NIT) is stored by each eNB Number of bearers per VU 2
which represents the Physical Cell Identifier (PCI), IP address Double time 0.03
of other nodes and Evolved Cell Global Identifier (ECGI) of Double distance 10
Double rate 10 Gbps
neighboring nodes. In our work, the S-GW is initiating the Mobility Model X2-interface
data plane request message as shown in Fig.6 and process the MU Speed 5.5m/s
data plane reply command. S-GW contains ECGI of nodes SDN Controller 4ms
eNB 960 μs
and IP addresses of VU Achieve HO.
vSGW 2ms
vMME 2ms
V. S IMULATIONS AND D ISCUSSION Max. Transmission Unit 100
The evaluation of the performances of the Proposed Mobile Speed of Light 300000 km/s
UDP Packets 1000
Network Architecture(PMNA) in accordance to the Handover Simulation Interval 10ms
(HO) measurements (preparation and completion) ns-3 based Event type A3 with offset = 2 dβ,
system level simulations are used. The improvement of the Hysteresis = 0 dβ
Carrier Frequency 3.3GHZ
method includes numerous details. Afterwards, an analytical
eNBT x Power 30dβ
model that is for these complex systems permits it. It further Power loss model Friis
has to present several Simplifying conventions. Hence the
evaluation of the system performance is made conceivable.
This paper outlines our validation test-bed as well as the
B. Handover Execution Setup
hardware and parameter for the experiment. The HO process
by itself is a core element of cellular Networks to support The simulation of the HO preparation and HO completion
user mobility. Therefore, HO management has always been a times at data plane for several VU traffic rates is done by
central research point in the perspective of cellular networks making an allowance of experimental steps. The entire sum
of HO preparation and completion time is the total HO
A. Experimental Setup execution time. We see that HO completion and preparation
In conventional Intersystem Handover (HO), the new and times are approximately equal for data traffic per VU up to
old Base Station Subsystem (BSS) are connected to two 1Gbps.In fig.7 graph indicates the comparison between our
different Mobile Switching Stations (MSCs). In this setup, proposed method and the most efficient method regarding HO
we build a simulator of the X2-Based SDN HO procedure. management [15]]. In this graph we took data rate is up to
The initial test which is function validation test, it implements 1Gbps but in actuality, we use data rate is 10Gbps. The value
the Data Plane (DP) and messages exchange of different of HO preparation and completion is 5.7ms and 7.4792ms
nodes of the network. The procedure runs according to 3GPP respectively. At that point, HO execution time increase due to
standards. Moreover, it modifies the processing, transmission the intermediate links between the core network initiates to
and propagation delays parameter defined in Table-1. This exhibit congestion.


 ,QWHUQDWLRQDO&RQIHUHQFHRQ2SHQ6RXUFH6\VWHPVDQG7HFKQRORJLHV,&2667
We set the parameters for simulation in which data rate is
set upto 1Gbps, UDP packets are set to 1000 and simulation
interval is 10ms as seen in Table I.
Fig. 7: Comparison Chart.
Fig. 8: Simulation graph.
Graph in Fig.8 shows our simulation results of Handover
preparation and completion time between data rate and delay
time. Our system has achieved much better results than the
baseline results. We have optimized the preparation time of
HO by 1.24ms and completion time of HO by 0.8308ms.
VI. C ONCLUSIONS
In this paper, we proposed the implementation of X2-
Based VU Intersystem handover in a partially 5G Software
Defined Network (SDN) based. We have built a simulator
for this network within the ns-3 setup. The application of all
network elements such as exchange the DP and OpenFlow
protocol are fulfilled by simulation We verified our proposed
system experimentally, we achieved an HO Preparation time
is 5.7ms and a HO Completion time is 7.48ms which is
better than the baseline results where HO Preparation and
Completion time is 6.94ms and 8.31ms. Our implementation
and comparisons to existing implementation is shown in Fig.8
and Fig.7 respectively and in addition to that, still, there are
some bugs (as we found in ns-3 discussion forums) related
to X2 handover. Unrelated to these limitations, more analysis
of this simulation is possible by permitting the built-in trace
supports such as PHY Layer Traces, MAC Layer Traces, RLC
Traces, and PDCP Traces etc. So that we can do a quality
research simulation within these limits of this simulator. In
5G we have to achieve better low latency rate for control

and data plane. These results fulfill the control plane delay
requirements of 5G networks.
R EFERENCES
[1] C. V. N. Index, “Cisco visual networking index: global mobile data
traffic forecast update, 2014–2019,” Tech. Rep, 2015.
[2] H. Chan, D. Liu, P. Seite, H. Yokota, and J. Korhonen, “Requirements
for distributed mobility management,” Tech. Rep., 2014.
[3] G. Liu and D. Jiang, “5g: Vision and requirements for mobile commu-
nication system towards year 2020,” Chinese Journal of Engineering,
vol. 2016, 2016.
[4] P. Ameigeiras, J. J. Ramos-Muñoz, L. Schumacher, J. Prados-Garzon,
J. Navarro-Ortiz, and J. M. López-Soler, “Link-level access cloud
architecture design based on sdn for 5g networks.” IEEE network,
vol. 29, no. 2, pp. 24–31, 2015.
[5] J. Costa-Requena, J. L. Santos, V. F. Guasch, K. Ahokas, G. Premsankar,
S. Luukkainen, O. L. Pérez, M. U. Itzazelaia, I. Ahmad, M. Liyanage
et al., “Sdn and nfv integration in generalized mobile network archi-
tecture,” in Networks and Communications (EuCNC), 2015 European
Conference on. IEEE, 2015, pp. 154–158.
[6] T. Taleb, M. Corici, C. Parada, A. Jamakovic, S. Ruffino, G. Karagiannis,
and T. Magedanz, “Ease: Epc as a service to ease mobile core network
deployment over cloud,” IEEE Network, vol. 29, no. 2, pp. 78–88, 2015.
[7] Y. Zhou, K. Chen, J. Zhang, J. Leng, and Y. Tang, “Exploiting the
vulnerability of flow table overflow in software-defined network: Attack
model, evaluation, and defense,” Security and Communication Networks,
vol. 2018, 2018.
[8] H. I CL, “S., xu, z., et al.:‘new paradigm of 5g wireless internet’,” IEEE
J. Sel. Areas Commun, vol. 34, no. 3, pp. 474–482, 2016.
[9] P. Khuntia and R. Hazra, “Resource sharing for device-to-device com-
munication underlaying cellular network,” in 2018 4th International
Conference on Recent Advances in Information Technology (RAIT).
IEEE, 2018, pp. 1–5.
[10] X. Xiaodong, Z. Huixin, D. Xun, H. Yanzhao, T. Xiaofeng, and Z. Ping,
“Sdn based next generation mobile network with service slicing and
trials,” China Communications, vol. 11, no. 2, pp. 65–77, 2014.
[11] A. Nakao, P. Du, Y. Kiriha, F. Granelli, A. A. Gebremariam, T. Taleb,
and M. Bagaa, “End-to-end network slicing for 5g mobile networks,”
Journal of Information Processing, vol. 25, pp. 153–163, 2017.
[12] S. Kukliński, Y. Li, and K. T. Dinh, “Handover management in sdn-
based mobile networks,” in Globecom Workshops (GC Wkshps), 2014.
IEEE, 2014, pp. 194–200.
[13] L. M. Contreras, L. Cominardi, H. Qian, and C. J. Bernardos, “Software-
defined mobility management: Architecture proposal and future direc-
tions,” Mobile Networks and Applications, vol. 21, no. 2, pp. 226–236,
2016.
[14] L. Richardson, M. Amundsen, and S. Ruby, RESTful Web APIs: Services
for a Changing World. ” O’Reilly Media, Inc.”, 2013.
[15] J. Prados-Garzon, O. Adamuz-Hinojosa, P. Ameigeiras, J. J. Ramos-
Munoz, P. Andres-Maldonado, and J. M. Lopez-Soler, “Handover imple-
mentation in a 5g sdn-based mobile network architecture,” in Personal,
Indoor, and Mobile Radio Communications (PIMRC), 2016 IEEE 27th
Annual International Symposium on. IEEE, 2016, pp. 1–6.
 Efficient Resource Distribution in Cloud
and Fog Computing

Mubashar Mehmood1 , Nadeem Javaid1(B) , Junaid Akram2 ,

Sadam Hussain Abbasi1 , Abdul Rahman1 , and Fahad Saeed3
1
COMSATS University, Islamabad 44000, Pakistan
nadeemjavaidqau@gmail.com
2
National University of Sciences and Technology (NUST),
Islamabad 44000, Pakistan
3
COMSATS University Islamabad, Wah Campus 47040, Pakistan
http://www.njavaid.com

Abstract. Smart Grid (SG) is a modern electrical grid with the com-
bination of traditional grid and Information, Communication and Tech-
nology. SG includes various energy measures including smart meters and
energy-efficient resources. With the increase in the number of Internet
of Things (IoT) devices data storage and processing complexity of SG
increases. To overcome these challenges cloud computing is used with SG
to enhance the energy management services and provides low latency. To
ensure privacy and security in cloud computing fog computing concept is
introduced which increase the performance of cloud computing. The main
features of fog are; location awareness, low latency and mobility. The fog
computing decreases the load on the Cloud and provides same facili-
ties as Cloud. In the proposed system, for load balancing we have used
three different load balancing algorithms: Round Robin (RR), Throttled
and Odds algorithm. To compare and examine the performance of the
algorithms Cloud Analyst simulator is used.

Keywords: Fog computing · Cloud computing · Load balancing

Tasks scheduling · Response time · Smart Grid · Microgrid
Virtual machines

1 Introduction

Smart Grid (SG) as a communication system allows devices to interact with

each other. SG is a modern electrical grid which includes various energy mea-
sures including smart meters, energy-efficient resources and renewable energy
resources. SG uses two-way communication between service provider and cus-
tomers enabled them to monitor their pricing and energy consumption. With
the number of end users connected to SG increases, SG requires high process-
ing and high storage. The Internet provides the solution for demand-side energy
management which uses two-way flow of information which is considered as SG
c Springer Nature Switzerland AG 2019
L. Barolli et al. (Eds.): NBiS 2018, LNDECT 22, pp. 209–221, 2019.
https://doi.org/10.1007/978-3-319-98530-5_18
210 M. Mehmood et al.

extension. Internet of Things is presented as extension of internet. As IoT ser-

vices increases, IoT devices are used in various fields such as technology, industry
and several domains.
The factors that affect the IoT growth rate are the cost of devices and reduc-
tion in size of IoT devices. IoT plays an important role in smart homes, business
applications, industry, smart grid, smart city and e-health. IoT has potential to
develop intelligent applications in almost every field. The integration of SG and
IoT is known as the internet of energy (IoE). The primary goal of IoE is to dis-
tribute energy between various sources including industrial consumers, electric
vehicles and distributed energy storage.
To control a large amount of data generated by numerous devices such as
actuators, sensors and smart meter which need to be store process and managed
by cloud computing. The emergence of cloud computing reduces the huge com-
puting power [1]. SG through smart meter gets energy consumption as well as
private data of customers which store on cloud data centre. The integration of
IoT and cloud computing provide ubiquitous services and allow data to process
intelligently. However, an increase in a number of IoE devices increases latency
and response time in the cloud which lead to divergence of time demand for
sensitive applications and devices. During data transmission to the cloud, SG
must ensure privacy [2] which becomes harder when the number of consumers
increases [3]. To overcome these problems fog concept has been proposed.
Fog extended to cloud computing provides an effective solution to get control
of tremendously increasing smart devices by simply moving data to the cloud
[4]. The fog is a middle layer between the cloud and the end user that allo-
cate resources closer to the customers, which reduces response time. The most
important features of fog are location awareness and low latency. Fog comput-
ing increases the reliability of SG, maximize security and reduce computation
cost [5]. Buildings communicate with fog through the smart meter and send the
request to fog. The fog finds the nearest Micro Grid (MG) and establishes a
connection with MG. If MG has efficient power supply then respond back to fog
otherwise fog interact with the cloud to find another nearest MG. Cloud and
fog computing provides three services such as Software As A Service (SaaS),
Platform As A Service (PaaS) and Infrastructure As A Service (IaaS).
Both Cloud and fog provide on-demand services on the internet. In this paper,
Cloud and fog based SG environment are discussed. A system model is designed
which covers two regions of the world based on continent of the world with a
fog in each region. Load balancing algorithms are used for optimal scheduling
of tasks. Therefore, these algorithms are tested for a scenario. The scenario
presented is based on Virtual Machines (VMs) on every fog, to determine the
number of VMs that are sufficient to balance load with better response time,
cost and processing time.

1.1 Motivation
The rapid increase of technologies affects the computing power of SG so a cen-
tralized cloud platform is presented [6]. In the past decade, response time and
 Efficient Resource Distribution in Cloud and Fog Computing 211

storage in the cloud has been a crucial issue, to handle this fog computing con-
cept is presented in [7]. The fog is an intermediate layer between the end user
and the cloud [8] that distribute resources closer to the customers, which reduces
response time. A large number of consumers are using cloud and fog which may
cause load balancing issues [9]. To handle a large number of request load bal-
ancing techniques are used in this paper.

1.2 Contribution

Cloud and fog integration with SG provides benefits to end user. Optimal alloca-
tion of resources to consumers is tackle by load balancing techniques, following
are the contribution of this paper:

• Smart devices are used to provide location awareness services.

• The residential area of the world is divided into six regions based on the six
continents to manage the energy consumption in a balanced way.
• The fog computing concept is used to improve the latency (request time,
response time, processing time) and to access internet services flexibly for
IoT devices used by end users in the residential buildings across the world.
• Odds algorithm is presented to efficiently manage resources

2 Related Work

Cloud and fog computing provides shared resources which allocate VMs to reduce
the load on the cloud. Different load balancing algorithms are applied on the
cloud and fog to manage the tasks. The authors in [10], proposed dragonfly opti-
mization algorithm. The efficiency of this algorithm is outperformed than others
in the term of execution time, response time, tasks migration and load balance
between machines is higher than other algorithms. However, the limitation of
the proposed system is that there is no categorization of the cloud. In [11], the
authors proposed self-similarity-based load balancing mechanism. The efficiency
of SSLB is outperformed than other algorithms in the term of reducing cost and
achieve the best allocation of resources. However, the limitation of the proposed
system is that execution time increase. In [12], the authors presented cloud load
balancing Algorithm. CLB performs better than other load balancing algorithms
for reducing the processing time. However, the limitation of the proposed system
is that cost does not balance.
In [13], authors proposed an Ant Colony Optimization. Ant Colony Optimiza-
tion optimizes response time and balances the load. However, the limitation of
the proposed system is that high execution time occurs. In [14], authors proposed
Particle Swarm Optimization and Pattern Search Algorithm that achieve relia-
bility and power utilization. The proposed algorithm performs better for reduc-
ing cost. However, the limitation is that the main function can be improved for
better performance. In [15], authors proposed energy management system that
212 M. Mehmood et al.

Fig. 1. Proposed system model.

perform well in energy management system. This algorithm is efficient as com-

pared to others. However, limitation of the proposed system is that fuel emission
cells can be replaced.
In [16], authors proposed a framework to minimize the wastage of resources
through consolidation of resources which is achieved by assigning several requests
on the same machine. To implement the semi-online workload consolidation bin
packing is presented. The proposed algorithm is based on bin, each task assigned
with a bin which is then it map to a machine. The proposed algorithm solve the
problem of request consolidation in the real-time assignment of resources. The
proposed algorithm get the information for a short time interval which helps to
take more precise decisions.
In [17], authors presented MSLBL algorithm that places the budget limit of
application to the task budget limit with the budget level which reduces the
scheduling length of applications. The proposed algorithm reduces schedule length
by preallocating the task with budget-level cost. The issue of reducing the schedul-
ing length of applications on the heterogeneous system has two subproblems.
 Efficient Resource Distribution in Cloud and Fog Computing 213

The first issue is the satisfying budget constraint and the second issue is to reduce
the schedule length of applications. The small-time complexity is schedule to
reduce schedule length. The experiment results demonstrate that the proposed
algorithm produce low scheduling length in different condition and the different
budget limit.
In [18], authors presented the tail matching sub-sequence mobility prediction
based approach to predict the mobility pattern of users to put resources near to
users. For optimal offloading decision improved genetic algorithm is proposed. To
enhance the efficiency of genetic algorithm reproduction operations crossover and
mutation are used. Integer encoding is developed to consider multiple cloudlet
scenarios. In this scenario, several cloudlets for a user may be accessible. Exper-
imental demonstration on prediction is performed by using mobility dataset of
humans. Which is used for evaluation of cloudlets reliability and use as a feature
in offloading scenario.
Table 1 shows the summary of related work.

Table 1. Summary of related work

Technique(s) Objective (s) Feature (s) Achievement (s) Limitation (s)

Dragonfly [10] Minimize Schedule the the cost is No
electricity cost load demand minimized and categorization
of home minimize of appliances
appliances response time
SSLB [11] Reduce PAR Allocation of Cost and PAR Increased
and electricity resources is reduced Execution
cost b according to time
user satisfaction
Cloud load Minimization Utilization of Electricity cost Cost is not
balancing [12] of electricity resources is reduced balanced
cost
Ant colony Enhance fuzzy Use fuzzy logic Cost is reduced High
optimization controller to control execution time
[13] simulation solutions
Particle swarm Reliability, Load Efficiency of Main function
optimization- power Balancing energy could be
pattern search utilization and management modified
[14] environmental system
adaptable
Energy Cost saving Confirm Peak to average Fuel emission
management and load performance ratio cells can be
system [15] balancing of Energy minimization replaced
214 M. Mehmood et al.

Remaining paper is categories as; in Sect. 2 literature works has been dis-
cussed, Sect. 3 illustrates the proposed system model, Sect. 4 contains load bal-
ancing algorithm, Sect. 4 simulation results and discussion and Sect. 5 is based
on conclusion.

3 System Model

In this paper, a cloud and fog based environment. Fog is an extension of the cloud.
The cloud and fog combination provide enhanced services to end-users, helps to
minimize latency and minimize load on cloud data centres. Fog computing is
an environment, that provides data storage, computation and communication
between devices and cloud.
Figure 1 shows a fog and the cloud-based platform that comprises three-
layered architecture, the first layer contains cloud, the second layer contains fog
and the third layer comprises of end users. The communication occurs between
all layers. As end users communicate with fog intern the fog interact with the
cloud. The cloud and fogs are connected with MG. The fogs transfer information
with the cluster of buildings directly or through the smart meter.
At the end user layer two clusters of buildings are assumed and these clusters
comprise of multiple homes. Buildings communicate with fog through the smart
meter and send the request to fog. The fog finds the nearest MG and establishes
a connection with MG. If MG has efficient power supply then respond back to fog
otherwise fog interact with the cloud to find another nearest MG. Fogs contain
multiple VMs to handle user requests to achieve minimum response time and
enhance the computing power which is important for load balancing in MG.
The fog layer manages latency problems and manages resources in an effective
way. Fog devices contain resources such as main memory, data storage and com-
putation. To run applications on a single hardware platform, virtual machines
contain processors for executing applications. In virtual machines, numerous
applications on processors are running to execute services. Fog is a middle layer
between cloud and end user.
Cloud layer contains data centres which provide on-demand storage, compu-
tation processing to end users and provide services with pay-as-you-go paradigm
(pay only for necessary services and resources) in cloud architecture. The con-
sumer only pays for the necessary services.
The world is divided into six regions, comprises of six continents as shown in
Table 2. Fogs are placed in different regions of the world. In this paper region 3
and region 4 are assumed in each region two clusters are considered and one fog
is placed per region. These two regions have the energy crisis and load balancing
issues as a large number of end users send the request to MG. The two fogs are
located in these two regions and respond to the cluster of buildings in the region
where fog are located. Different load balancing algorithms are used to manage
the user requests.
 Efficient Resource Distribution in Cloud and Fog Computing 215

Table 2. Region distribution

Region Region Id
North America 0
South America 1
Europe 2
Asia 3
Africa 4
Oceania 5

3.1 Round Robin (RR)

Round Robin use time sharing mechanism. Round Robin algorithm develope
a table of users requests with respect to time arrival. Round Robin algorithm
allocate virtual machines one by one to balance the load of multiple requests on
virtual machines. Round robin algorithm assigns the request to the VMs on the
base of time slice.

3.2 Throttled
Throttle algorithm contains the index table of all VMs which retains information
of all VMs and assigns the requests to VM that can fulfill demand request. For
allocating virtual machines requests sent to load balancer and identify which
machine is able to perform tasks efficiently. If all VMs are busy then it waits for
VMs in the queue.

3.3 Odds Algorithm

The odds algorithm works on optimal stopping strategy to get the best prob-
ability of VMs that can available to assign tasks. The odds algorithm increase
the probability of identifying a VM. The odds-algorithm is the rule to observe
the VMs one after the other and to stop on the first available VMs. The odds-
algorithm count the VMs in reverse order until it reaches the last virtual machine.

3.4 Problem Formulation

In order to increase the stability of platform load of virtual resources on fog
are balanced. Three main performance parameters are considered to enhance
the stability of the system are processing time, cost and response time. These
parameters are formulated by the linear programming [19] In this paper, cloud-
fog based architecture with SG integration is considered. The fog contains n
number of virtual machines vm1 , vm2 , ...vmn . Using load balancing techniques
virtual machine resources are efficiently allocated to optimize the workload on
fog. In this model there are n numbers of buildings and h number of homes
216 M. Mehmood et al.

are considered. All virtual machines have the same capacity and are assigned
to tasks base on users requests. The total numbers of virtual machines (m) and
requests (R) are mathematically demonstrated by Eqs. 1 and 2
m

TV M s = (V Mi ) (1)
i=1

Let Total requests are represented in Eq. 2

k

TR = (Ri ) (2)
j=1

Performance parameters are affected by mapping requests to virtual machines.

[20] User tasks are varying from 0 to n. tasks assign to different virtual machines.
Assignment of VMs to URs is dependent of response time (RT) and processing
time (PT) of VMs

3.4.1 Processing Time:

Processing time of VMs to process the user tasks and state of user tasks is
defined in Eq. 3.

1, If VM is assigned to tasks
S= (3)
0, Otherwise
Processing time can be represented by Eq. 4.
Lt
Pt = (4)
Cvm
where Pt represent processing time. Lt represent length of tasks Cv m repre-
sent capacity of virtual to perform tasks.

3.4.2 Response Time:

Response time (RT) is time taken by the fog to response the request is
presented in Eq. 5.

RT = DelayT ime + F inishT ime − ArrivalT ime (5)

The total time taken by the VM as in Eq. 6.

T otaltime = F inishT ime − StartT ime (6)

Our objective function is to minimize response time (RT) and processing

time Pt .
 Efficient Resource Distribution in Cloud and Fog Computing 217

Algorithm 1. Odds Algorithm

1: Input VMs list, I = VMs, Compute delay
2: Output: VMs id
3: continue = true, stopping threshold = 0
4:
5: while count do
6: sum the VMs id
7: if the sum of n VMs id < 1 then
8: continue = false
9: else
10: stopping threshold = stopping threshold + 1
11: if stopping threshold= n then continue = false then
12: VMs id = stopping threshold
13: return VMs id
14: end if
15: end if
16: end while

4 Simulation and Discussion

In this paper, Cloud Analyst tool is used to perform the simulation. Cloud Ana-
lyst tool use to inspect the performance of load balancing algorithm in the same
scenario. The comparison is done between RR, throttled and Odds algorithm,
on the basis of fog’s response time, processing time and total cost.

4.1 Discussions

Figure 2 shows comparison between response times of RR, Throttled and Odds
Algorithm.
Figure 3 shows the Response time of each algorithm. Total Response time of
throttled in the scenario is 56.94 ms, Round Robin Response time is 57.35 ms
whereas the overall Response time of odds algorithm is 57.42 ms.
Figure 3 shows Response time of odds algorithm and throttled is much better
as compared to Round Robin because, Round Robin allocate the tasks without
looking the task allocation on VMs, which maximize the load on VMs and max-
imize the response time.
Figure 4 shows the average time a fog takes to fulfil a request when RR,
Throttled and odd algorithm are used. RR has high processing time because of
the same reason that is mentioned above.
Figure 5 shows the total cost of fogs processing RR, Priority-based and throt-
tled algorithm, each fog manage multiple requests from clusters. The total cost
includes VMs cost, the cost of the power station and data transfer cost.
218 M. Mehmood et al.

60

50
Overall Response Time

40

30

20

10

0
Odds Throttled RR
Algorithm

Fig. 2. Algorithms.

70

60

50
Response Time (ms)

40

30

20

Odds
10
Round Robin
Throttle
0
Cluster 1 Cluster 2 Cluster 3 Cluster 4
Clusters

Fig. 3. Average response time.

 Efficient Resource Distribution in Cloud and Fog Computing 219

12

Processing Time (ms) 10

2 Odds
Round Robin
Throttle
0
Fog 1 Fog 2
Fogs

Fig. 4. Average processing time.

250

200

150
Cost ($)

100

50
Odds
Round Robin
Throttle
0
Fog1 Fog2
Fogs

Fig. 5. Total cost.

220 M. Mehmood et al.

5 Conclusion
In the given scenario, as proposed in the paper the Throttled algorithm outper-
forms the Round Robin Algorithm. The odds algorithm under some conditions
dominates both Round Robin and Throttled algorithm. But as we increase the
number of requests on fogs from different users residing in the different regions
of the world the odds algorithm behave inefficiently and gets outperformed by
both Round Robin and Throttled algorithm.

References
1. Cao, Z.: Optimal cloud computing resource allocation for demand side management
in smart grid. IEEE Trans. Smart Grid 8(4), 1943–1955 (2017)
2. Kim, J.Y., Kim, Y.: Benefits of cloud computing adoption for smart grid security
from security perspective. J. Supercomput. 72(9), 3522–3534 (2016)
3. Faruque, A., Abdullah, M., Vatanparvar, K.: Energy management-as-a-service over
fog computing platform. IEEE Internet Things J. 3(2), 161–169 (2016)
4. Chiang, M., Zhang, T.: Fog and IoT: an overview of research opportunities. IEEE
Internet Things J. 3(6), 854–864 (2016)
5. Hussain, Md., Alam, M.S., Beg, M.M.: Fog Computing in IoT Aided Smart Grid
Transition-Requirements, Prospects, Status Quos and Challenges. arXiv preprint
arXiv:1802.01818 (2018)
6. Ramadhan, G., Purboyo, T.W., Latuconsina, R.: Experimental model for load
balancing in cloud computing using throttled algorithm. Int. J. Appl. Eng. Res.
13(2), 1139–1143 (2018)
7. Luo, F., Zhao, J., Dong, Z.Y., Chen, Y., Xu, Y., Zhang, X., Wong, K.P.: Cloud-
based information infrastructure for next-generation power grid: Conception, archi-
tecture, and applications. IEEE Trans. Smart Grid 7(4), 1896–1912 (2016)
8. Chiang, M., Zhang, T.: Fog and IoT: an overview of research opportunities.
IEEE Internet Things J. 3(6), 854–864 (2016). https://doi.org/10.1109/JIOT.2016.
2584538
9. Bera, S., Misra, S., Rodrigues, J.: Cloud computing applications for smart grid: a
survey. IEEE Trans. Parallel Distrib. Syst. (2014). https://doi.org/10.1109/TPDS.
2014.2321378
10. Branch, S.R., Rey, S.: Providing a load balancing method based on dragonfly opti-
mization algorithm for resource allocation in cloud computing (2018)
11. Li, C., et al.: SSLB: self-similarity-based load balancing for large-scale fog comput-
ing. Arab. J. Sci. Eng., 1–12 (2018)
12. Chen, S.L., Chen, Y.Y., Kuo, S.H.: CLB: a novel load balancing architecture and
algorithm for cloud services. Comput. Electric. Eng. 58, 154–160 (2017)
13. Dam, S., et al.: An ant-colony-based meta-heuristic approach for load balancing in
cloud computing. Appl. Comput. Intell. Soft Comput. Eng., 204–232 (2018)
14. Gabbar, H.A., Labbi, Y., Bower, L., Pandya, D.: Performance optimization of
integrated gas and power within MG using hybrid PSOPS algorithm. Int. J. Energy
Res. 40(7), 971–982 (2016)
15. Varela Souto, A.: Optimization and Energy Management of a Microgrid Based on
Frequency Communications (2016)
 Efficient Resource Distribution in Cloud and Fog Computing 221

16. Armant, V., De Cauwer, M., Brown, K.N., O’Sullivan, B.: Semi-online task assign-
ment policies for workload consolidation in cloud computing systems. Future
Gener. Comput. Syst. (2018)
17. Chen, W., Xie, G., Li, R., Bai, Y., Fan, C., Li, K.: Efficient task scheduling for bud-
get constrained parallel applications on heterogeneous cloud computing systems.
Future Gener. Comput. Syst. 74, 1–11 (2017)
18. Shi, Y., Chen, S., Xiang, X.: MAGA: a mobility-aware computation offloading
decision for distributed mobile cloud computing. IEEE Internet Things J. 5(1),
164–174 (2018)
19. Devi, D.C., Uthariaraj, V.R.: Load balancing in cloud computing environment
using improved weighted round robin algorithm for nonpreemptive dependent
tasks. Sci. World J. 2016, 1–14 (2016)
20. Wickremasinghe, B., Buyya, R.: CloudAnalyst: a cloudsim-based tool for modelling
and analysis of large scale cloud computing environments. MEDC Project Rep.
22(6), 433–659 (2009)
Proceedings of the 24th International Conference on
Automation & Computing, Newcastle University,
Newcastle upon Tyne, UK, 6-7 September 2018
Statistical Topic Modeling for Urdu Text
Articles
Anwar Ur Rehman, Zobia Rehman, Junaid Akram, Waqar Ali, Munam Ali Shah, Muhammad Salman
Department of Computer Science, Comsats University Islamabad (CUI)
Research Center for Modeling and Simulation (RCMS), National University of Science and Technology (NUST)
Islamabad, Pakistan
it.anwaar@gmail.com Zobia.rehman@comsats.edu.pk mshah@comsats.edu.pk
Abstract—Natural Language Processing (NLP) is a branch
of Artificial Intelligence to help computers manipulate and
interpret human languages. In NLP, text mining is a
technique to derive useful information from text. Topic
Model (TM) is a statistical model to extract topics from a
large collection of unlabeled text using NLP and machine
learning techniques. Several effective TM are available to
fulfill the needs of various languages like English, German,
Arabic etc. However no compelling TM is available for poor
resource South Asian language Urdu. In this research study,
our focus is to work on existing TM like Latent Dirichlet
Allocation (LDA) to overcome the issues of Urdu language
in text mining. We studied and analyzed LDA as an
unsupervised model for the Urdu topic identification.
Hence, we studied LDA deeply for Urdu topic identification
at two levels: Variational Bayes (VB) based LDA for Urdu
(VB-ULDA) with stemmer and without stemmer.
Experiments are performed on a self-created massive
number of Urdu documents in four different corpora.
Experimental study shows that VB-ULDA outperformed in
the identification of topics from Urdu text documents as
compared to existing Urdu LDA (ULDA) in terms of
accuracy and efficiency and results also reveal the high
impact of stemming algorithm in Urdu topic identification.
Keywords-Urdu; topic modeling; Artificial Intelligence; Urdu
language Processing; Natural Language Processing;
variational Bayes
I. INTRODUCTION
1.1 Urdu: Language
Urdu is a widely spoken language in South Asia and it
is most spoken language in Pakistan and India. There are
11 million and 300 million Urdu speakers in Pakistan and
in other parts of the world respectively [1]. It is very
different from the most famous languages like English,
French, Chinese, etc. The Urdu language has different
grammatical forms, various word antonyms, synonyms
and its words meanings varies according to factors such
as word order. Despite these complexities, limited
contribution has been dedicated to the Urdu language in
NLP, especially related to the English language which
has been dealt by many research communities. Majority
of software, an Application Program Interface (APIs) and
tools of NLP do not meet the requirements of Urdu
Language for Information Retrieval (IR), etc. To use
these software and tools for Urdu data, substantial
changes and additional work would be needed for the
better performance. Unlike other languages, Urdu is
written from right to left, with 39 basic alphabets,
typically follows Nastaliq writing script like the Arabic
language [1].
1.1.2 Urdu: Encoding
One of the basic purposes of a computer program is to
recognize the characters in the text of any language.
However, in case of Urdu language, computer program
faces the problem and use Unicode Transformation
Format 8 (UTF-8) encoding to recognize the Urdu
characters.
1.2 Topic models
In recent years, the continuous use of electronic
documents on the web has been extremely increased.
Many news forums like newspapers or news agencies and
journalists or column writers, releasing their daily
updated news and articles on their website respectively.
This shift of news content and other electronic documents
on the internet has brought different challenging task for
the researchers. How can one understand what is
happening in the collection of trillions of an unstructured
document? This is progressively a common challenging
problem: filtering the emails of an organization, deep
searching in a million of news articles for a topic,
identifying a scientific research area, etc. Being capable
of resolving such problems, NLP techniques have been
receiving a strong attention these days.
Topic model (TM) is a statistical [2] method that can
uncover the hidden topics in a text document. TM is
mostly used in text mining to find the hidden linguistic
structure in a text of a particular document. It can deal
automatic understanding, summarization, searching, an
organization of a huge amount of electronic text data. A
group of documents may have various topics and often a
single document may be presenting a mixture of topics.
To select a specific topic through a computer program or
algorithm, TM technique will be needed.
There are various types of TM are available to identify
the topics from a given text documents like the earliest
topic model is Latent Semantic analysis (LSA) was
proposed by Papadimitriou et al. [3], Probabilistic Latent
Semantic analysis (PLSA) [4], the statistical approach for
topic modeling was further improved by David et al. [5]
that is Latent Dirichlet Allocation (LDA), Hierarchical
topic models (hLDA) [6], Correlated Topic Model
(CorrLDA) [7], chong et al. proposed Online variational
inference for LDA in [8] etc. One of the widely used
topic model is LDA to extract and identify the
meaningful topics form the documents and in various
other domain related to text [9].
1.2.1 Latent Dirichlet Allocation
LDA [5] is a generative and Bayesian
probabilistic model in which each text documents are
expressed as a mixture of topics. All topics have
distribution over vocabulary in the form of words.
Suppose a document consists of different subjects. That
document has words which refer to a specific subject.
The basic purpose of LDA algorithm is to map each
word(s) to their corresponding topic(s). LDA is a
probabilistic model that extracts a set of words from text
documents, that set of words has a statistical relation in a
collection of text documents. Table 1 is representing
topics from a text given in Fig.2 and Fig.1 is describing a
graphical form of LDA. The process of generative and
iterative LDA algorithm is as follows:
• For each topic K in a document K ε {1,….K}, βk
is Multinomial distribution
• For every document d ε {1,….M}, ϴd is a
multinomial distribution from Dirichlet
distribution with parameter α
• For every word position n ε {1,…N}, choose a
latent topic Zn form multinomial distribution
with parameter ϴ
• Select observed word Wn from distribution βzn
Figure 1. LDA graphical form.
For English and other western languages, different
methods, tools, and resources are available for topic
modeling, classification and identification like LDA [5],
and other effective techniques like term frequency-
inverse document frequency (TF-IDF) [10], topic
Unigram [10], cache model [10], etc. However, there is
no compelling research available for the Urdu language
as it has lack of resources, annotated datasets, and
complex morphological structure. In this research study,
we will work on the identification of Urdu topics by
explaining TM for Urdu in the research community.
Furthermore, we will deeply study and implement
unsupervised LDA using VB for Urdu topic deification.
We will also create an effective dataset for this purpose.
The rest of the paper is organized as follows: the
introduction is in section 1, related work and
methodology are in section 2 and 3 respectively, section 4
illustrates experiment and discussion and conclusion is in
section 5.
II. RELATED WORK
In recent years, different techniques of TM have been
introduced, which are briefly explained in the survey [9].
However, we will concentrate on approaches for Urdu
topic modeling. Some LDA based proposed approaches
for topic modeling are discussed here.
Authors used LDA as a tool to analyze the huge
collection of news articles in [11]. A New York Times’
nuclear technology articles from 1945 to 2015 as a corpus
was used in topic modeling by the authors. Authors
concluded that LDA performed well to identify topics,
analyze the patterns and trends in a large digital news
article. Arthur et al. [12] highlights the importance and
showed the connection between mostly used inference
technique for TM which are Gibbs sampling, variational
inference, maximum a posterior estimation, etc. Authors
described how, and which techniques are good for
accurate learning, smoothing, hypermeter selection and
identification of topics in TM. Zhai et al. [13] proposed
variational inference for LDA to extract topics from a
large-scale dataset. Authors proposed technique
outperformed in terms of scalability, held-out likelihood
and execution speed.
A stemming based LDA approach is proposed by
authors in [14]. Authors studied different stemming-based
methods for Arabic TM. LDA is used to generate topics
from Arabic news articles. Authors discovered interesting
topics from the news articles by using stemming and
LDA together. Arabic LDA (ALDA) and Arabic Name
Entity Recognition (RenA) is proposed by the authors in
[15]. Authors successfully extracted name and
organization from the online news articles using proposed
RenA and identified topic with high accuracy from online
news using ALDA. RenA and ALDA outperformed as
compared to famous Arabic NER and existing LDA.
Marwa et al. [16] studied Arabic language text for TM.
Authors deeply studied and implemented unsupervised
LDA on Arabic text with two levels: stemming and
selection of hyper parameters of LDA like α and β. Their
study shows that LDA technique is very effective for
topic identification in Arabic text with a right selection of
hyper parameters and strong stemming algorithm.
An experimental study is conducted by the author in
[17] to identify topics in Chinese text. Author extracts
topics using LDA from Center for Chinese Linguistics
corpus and compared the results with K nearest
neighbours algorithm, TF-IDF schema, and probabilistic
latent semantic indexing model. Results showed that
LDA performs better in term of precision as compared to
other existing techniques. Xia et al. [18] classified
Chinese text using LDA. Authors combined LDA with
Support Vector Machine (SVM) and LDA with TF-IDF
and compared their results on Chinese text documents.
An experimental study showed that LDA with SVM runs
better in terms of running time and classification
accuracy.
First and the only one Urdu topic detection
framework is proposed by Khadija et al. in [19]. Authors
proposed Urdu LDA (ULDA) combining LDA with
Gibbs Sampler algorithm. They implemented proposed
‫پاکستان کے زير انتظام کشمير ميں بين االقوامی معيار کے صرف دو کرکٹ‬ There are only two cricket grounds of international standards in
‫گراؤنڈز ہيں ور کچھ کثير المقاصد ميدان بھی ہيں ليکن ان ميں مناسب‬ Pakistan-administered Kashmir. There are also some
multipurpose grounds, but they lack adequate facilities. Due to
‫سہوليات کا فقدان ہے۔ جس کی وجہ سے اکثر نوجوان سﮍکوں اور گليوں‬
which many youngsters appear to play cricket in the streets.
‫ميں کرکٹ کھيلتے نظر آتے ہيں۔ کشمير کے اس عالقے ميں سو کرکٹ‬ There are hundred cricket clubs in this area of Kashmir who are
‫کلب ہيں جو پاکستان کرکٹ بورڈ کے ساتھ رجسٹرڈ ہيں ليکن ان ميں‬ registered with the Pakistan Cricket Board but they do not have
‫کوچنگ ميسر نہيں ہے۔ پاکستان کے زير انتظام کشمير کے وزير اعظم‬ coaching opportunities. Raja Farooq Haider Khan, Prime
‫راجہ فاروق حيدر خان نے کشمير سپر ليگ کے انعقاد کو خوش آئند قرار‬ Minister of Pakistan-administered Kashmir, has declared the
‫ديا ہے۔ فاروق حيدر نے کہا 'يہ ٹيلنٹ کو آگے النے ميں بنيادی کردار ادا‬ holding of the Kashmir Super League. Farooq Haider said, "It
‫کرے گا اور ہماری حکومت آزاد کشمير ميں کھيلوں کے فروغ کے ليے‬ will play a key role in bringing talent forward and our
‫مکمل تعاون کرے گی۔ پاکستان کے باقی حصوں کی طرح کشمير کے اس‬ government will fully cooperate with the promotion of sports in
‫خطے ميں بھی نوجوانوں ميں کرکٹ مقبول ترين کھيل ہے اور زياده تر‬ Azad Kashmir." Like in the rest of Pakistan, in this region of
Kashmir, cricket in the youth is the most popular game and most
‫لوگ کرکٹ ہی ديکھتے اور کھيلتے ہيں ليکن اس خطے کا کوئی بھی‬
people watch and play cricket, but none of this region has been
‫شخص اب تک پاکستان کی قومی کرکٹ ٹيم ميں شامل نہيں ہوا ہے۔ کشمير‬ included in Pakistan's national cricket team. In addition to the
‫سپر ليگ کے انعقاد کے ليے حکومت کے عالوه کئی غير سرکاری‬ government, many non-government organizations and
‫تنظيموں اور کمپنيوں نے بھی مدد کی يقين دہانی کرائی ہے۔ پاکستان کی‬ companies have also been given help to hold the Kashmir Super
‫قومی کرکٹ ٹيم کے سابق ٹيسٹ کرکٹر عاقب جاويد کا کہنا ہے کہ کشمير‬ League. Former Test cricketer of Pakistan's cricket team, Aqib
‫سپر ليگ ايک مفيد ايونٹ ثابت ہو گا۔ عاقب جاويد نے کہا کہ'کشميری عوام‬ Javaid says that Kashmir Super League will prove to be a useful
‫ جب تک آپ گراونڈز ميں نہيں آئيں گے اس‬،‫اس ايونٹ کو سپورٹ کريں‬ event. Aqib Javed said, "The people of Kashmir should support
‫کی خوبصورتی نہيں بنے گی اور بين اال قوامی معيار کے کھالڑی نہيں‬ this event, unless you come to the grounds, it will not be beauty
‫پيدا ہوں گے۔‬ and will not create international players."

Figure 2. Urdu and its translated text. Different colors are representing “Express” using link https://www.express.pk/. Corpus 4
different topics.
contains economic text article from all above sources. All
Table 1: Topics from Urdu and English text in figure 1.
Topics from English section in Topics from Urdu section in above corpora are newly created and have not been
Figure 1 Figure 1 published or used in any research study. We evaluated
Kashmir Cricket ‫کرکٹ‬ ‫کشمير‬ above corpora’s performance in our proposed technique
Pakistan Grounds ‫گراؤنڈز‬ ‫پاکستان‬ after the completion of few steps that are discussed in
International Coaching ‫کوچنگ‬ ‫بين االقوامی‬
section 3.2. Table 2. is briefly describing the above four
Prime Minister Super League ‫سپر ليگ‬ ‫وزير اعظم‬
Region Cricketer ‫کرکٹر‬ ‫خطے‬ corpora.
National Cricket team ‫کرکٹ ٹيم‬ ‫قومی‬ Table 2: Details of four corpora.
Azad Kashmir Cricket Board ‫کرکٹ بورڈ‬ ‫کشميری‬ Class No of Total Unique
Beauty Players ‫کھالڑی‬ ‫خوبصورتی‬ Documents words words
Government Cricket clubs ‫کرکٹ کلب‬ ‫حکومت‬ Sports 1600 81653 61757
Pakistan- Sports ‫کھيلوں‬ ‫آزاد کشمير‬ Politics 1250 61547 29123
administered
Entertainment 1450 76333 48949
Game ‫ميدان‬
Economy 600 32739 18919

ULDA on three corpora and compared the results with 3.2 Text Pre-Processing
LDA and ALDA. An experimental study showed that Text Pre-processing helps enhance the accuracy of a
ULDA performed very well with the accuracy of 75% as topic detection technique efficiently and smoothly
compared to LDA and ALDA. manage the structural representation of input text data. In
this step, diacritics removal, tokenization, stop words
III. METHODOLOGY removal and stemming will be done for input text source.
TM is an efficient technique in the domain of text 3.2.1 Removal of Diacritics
mining for IR. It helps extract abstract or theme from a Removal of Diacritics: Diacritics are such sings
document that has different themes. Resources less that change the pronunciation when written on or below
language Urdu needs an accurate and effective tool for the alphabets of a language. In Urdu, diacritics are call
text mining especially to generates topics from a Aerab which are Zer, Zabar, and pesh [1]. The use of
document. Variational Bayes LDA for Urdu (VB-ULDA) diacritics is optional in Urdu and its usage in writing
TM approach is proposed for the Urdu language to depends on the writer’s preference. However, it creates
overcome the issues in existing TM to extract topics from different uncertainties. Removal of diacritics is optional
Urdu text. Fig. 3 is illustrating the methodology. in Urdu pre-processing. To make the corpus standardize,
Here are some important steps that are involved in we remove diacritics. Few Diacritics examples are given
the proposed technique. in Table 3.
Table 3. Few Urdu diacritics words.
3.1 Dataset Without Meaning With Meaning
For the experiment, we build our own corpus that diacritics diacritics
contains Urdu text articles of different Urdu famous ‫بکری‬ Bakree (Goat) ‫بکری‬ Bekree
forums and news websites. We create four corpora for (Sale)
‫عالم‬ Aaalem ‫عالم‬ Aaalam
our proposed technique. Corpus 1 contain BBC Urdu (Educated) (World)
sports articles that have been taken from ‫جلدی‬ Jaldee ‫جلدی‬ Jeldee (Of
https://www.bbc.com/urdu/sport, corpus 2 consists of (Quickly) skin)
Urdupoint politics news articles which are collected from 3.2.2 Tokenization
the link https://www.urdupoint.com/. Corpus 3 consist of The initial step for text analysis in any language
entertainment articles from the famous newspaper task is tokenization of a given text into words. Urdu is
morphologically very rich language as it has different
variations and nature of its words and characters. For
poor resource languages like Urdu, tokenization is a
difficult task because there is the random use of spaces
between the words. In English, spaces are mostly used to
describe the boundary of a sentence. Tokenization and
sentence boundary detection of Urdu text is a difficult
task [20]. We convert the corpus into tokens in the
process of tokenization to use in the model for TM.
Table 4. Few Urdu space exclusion example.
non-join/separate Joined/combined Meanings
‫کےليے‬ ‫کيليے‬ For
‫کی طرف‬ ‫کيطرف‬ Towards
‫آپ کے‬ ‫آپکے‬ Yours
During the process of tokenization, we focus on space
exclusion problem as spaces play a vital role in
tokenization [20]. Few Space exclusion examples are
shown in Table 4.
In Urdu some alphabets are joiner when written
at the end of the word but some of the alphabets are non-
joiner. In Table 4, same words are written joined (without
space) and non-joined (with space). Joined ending words
gives a single token in tokenization however when the
same word written in non-join form gives two different
tokens.
3.2.3 Removal of Stop Words
All natural languages are composed of two types
of words: functional words and content words. Functional
words are the words with no meanings and content words
are the words with useful meanings. Stop words are
meaningless words and also considered as functional
words, In Urdu stop words are called ‫( حرف جار‬Haroof-e-
Jar). Stop words do not give any meaningful information
when written without any words, however, provide useful
information when written with a word. We excluded stop
words from our corpus to get only meaningful words.
Removal of stop words helps reduce the size of the
corpus. We created our own stop words list. Few mostly
used stopwords examples of Urdu are in Table 5.
Table 5. Few Urdu Stop words.
Urdu transliteration
‫کا‬ Ka
‫کی‬ Kee
‫کے‬ Kay
‫يہ‬ Yeh (This)
‫اور‬ Aur (And)
‫وه‬ Who (That)
‫ہے‬ Hay
‫ہيں‬ Hain
3.2.4 Stemming
Another important data pre-processing step is
stemming. The main focus of the stemming is to reduce
the word into its stem or roots. Stemming is mostly used
to deal with the text data for the sack of IR, Data Mining
(DM) and NLP. Jiaul et al. in [21] proposed a rule-based
stemmer for Urdu Language processing that is based on
affix stripping to get root or stem of the word. We have
performed a rule-based stemming on our corpus for the
efficient results. Few examples of stemming are in Table
6.
Table 6. Urdu stemming examples.
Urdu word Stem
‫( بکرياں‬Bakriyan, Goats) ‫( بکری‬Bakri, Goat)
‫( کتابيں‬Kitabain ,Books) ‫( کتاب‬Kitab, Book)
‫( لﮍکياں‬Larkian ,Girls) ‫( لﮍکی‬Larki ,Girl)
‫( مردوں‬Madon ,Men) ‫( مرد‬Mard ,Man)
3.3 Variational Bayes
In machine learning, Variational Bayes (VB) is a
technique to approximate intractable integrals that are
arising in Bayesian Inference (BI). VB methods are
mostly used in complex models that have statistical data,
latent variables, and unknown parameters. For the
statistical inference of unobserved variables in a data, VB
method approximates the posterior probability of those
unobserved variables.
3.3.1 Variational Inference
Variational Inference (VI) is a method that
makes the processing of a specific distribution tractable.
VI is an alternative to MCMC and Gibbs sampling and it
also considers an extension of EM algorithm. For the
variational inference, we used following equations.
Assume that c=c1:n observation and d=d1:m are latent
variable and additional fixed parameter α. Equation (1) is
posterior distribution as posterior links the data in the
model.
( , | )
( | , )= (1)
( , | )
To compute the posterior is very complex in many
interesting models. The main purpose of the variational
method is to choose a variational distribution for latent
variable.
=( : | ) (2)
Equation 2 is used to find the setting of parameter v to
make q close to posterior distribution.
3.3.2 Kullback-Leibler (KL) Divergence
KL divergence measures the divergence of distribution
between two probabilities. KL is a part of information
theory, it is a way to keep the deep link between statistics
and machine learning. KL divergence is used to measure
the closeness between distribution.
( )
( || ) ≡ [ ] (3)
( | )
To minimize the KL divergence, we minimized an
equivalent function to it up to constant. That is called
evidence lower bund (ELBO). We maximize the ELBO
to get the tight bound on a log probability of data by
applying Jansen’s inequality equation (4).
[log ( , )] − [log ( )] (4)
Minimization of KL divergence is same as the
maximization of ELBO. We used mean field variational
inference to factorize the variational family in equation
(5). In variational inference, we make a group of latent
variables together and factorize the distribution of each
group. The variational family has no true posterior
because latent variables are dependent.
( ,…, ) = ∏ ( ) (5)
 4.1 VB-ULDA Evaluation
We evaluated VB-ULDA with stemmers. Thus, we
described two version: VB-ULDA with stemmer VB-
ULDA(WS) and VB-ULDA without stemmer VB-
ULDA(WiS). To study the effect of stemmer on VB-
ULDA results. We conducted experiments on each
corpus separately with and without stemmer using VB-
ULDA. Experimental results show that VB-ULDA(WS)
outperforms as compared to VB-ULDA (WiS) in terms of
performance and accuracy and there is a little difference
between them in accuracy. To evaluate the performance
of VB-ULDA, we chose existing Gibbs

VB-ULDA accuracy on four

copora
85
84.5

Percentage
84
83.5
83
82.5
82

WS: with stemmer

Corpus names
WiS: without stemmer

VB-ULDA(WS) VB-ULDA(WiS)

Figure 4. Accuracy of VB-ULDA on four corpora.

Figure 3. VB-ULDA methodology.

IV. EXPERIMENT AND DISCUSSION Accuracy comparison of VB-

In this section, we present and discuss experimental ULDA
results of VB-ULDA for Urdu text. In the experiments,
we used four different corpora which consist of the 100
massive amount of sport, politics, entertainment and 80
Percentage

economic news text documents. We randomly chose

60
lengthy text document sets for experiments. Details
description of corpora is in section 3.1. 40
We ran multiple times experiments to extract topics 20
from the documents’ words, words association with
0
topics and topics association among the documents to
Accuracy
evaluate the performance of VB-ULDA. To change the GS: Gibbs Sampler
number of topics K in an experiment is considered the VB: Variation
LDA GS-ULDA VB-ULDA
granularity or more details of the model. Increase the
granularity shows deep details of the analysis. For the Figure 5. Accuracy comparison of VB-ULDA with other models.
good topic convergence, we iterated multiple time for the
best topic distribution. Before implementing VB-ULDA Sampling (GS) ULDA and standard LDA model and
on four corpora, we performed pre-processing techniques passed four corpora on above said models to check their
which are described in section 3.2. In a pre-processing performance. However, existing models failed to provide
step, we removed meaningless words or stop words, good results in terms of accuracy as compare to VB-
punctuations, converts the corpora into tokens handling ULDA. GS with Markov chain Monte Carlo (MCMC) is
spaces exclusion problem and implements rule-based exact and computationally expensive while on the other
stemming to convert all possible tokens into their parent hand VI is without warranty and very fast for very large
or root word. Remaining stemmed tokens are included in datasets [22]. So, we preferred VI over GS to explore the
the corpora for experiments.
different models and scenarios for the better performance “Quantitative analysis of large amounts of journalistic
using large Urdu dataset. texts using topic modelling,” Digit. Journal., vol. 4, no.
1, pp. 89–106, Jan. 2016.
Fig. 4 is representing VB-ULDA accuracy on four [12] A. Asuncion, M. Welling, P. Smyth, Y. T.-P. of the
Twenty, and undefined 2009, “On smoothing and
corpora and Fig. 5 is illustrating the performance of VB- inference for topic models,” dl.acm.org.
ULDA with other existing TM. [13] K. Zhai, J. Boyd-Graber, N. Asadi, and M. L.
Alkhouja, “Mr. LDA,” in Proceedings of the 21st
V. CONCLUSION
international conference on World Wide Web - WWW
NLP research in Urdu language is relatively complex ’12, 2012, p. 879.
as compared to other famous languages like English. All [14] A. Brahmi, A. Ech-Cherif, and A. Benyettou, “Arabic
the freely NLP tools and resources are available for texts analysis for topic modeling evaluation,” Inf. Retr.
English as well. Main motivation and inspiration behind Boston., vol. 15, no. 1, pp. 33–53, Feb. 2012.
[15] T. Kanan, S. Ayoub, E. Saif, and G. Kanaan,
this research is the lack of resources and absence of NLP
“Extracting Named Entities Using Named Entity
tools. There is no significant and compelling research Recognizer and Generating Topics Using Latent
available to extract topic from Urdu text in the literature. Dirichlet Allocation Algorithm for Arabic News
To overcome the challenges of text mining in Urdu text Articles,” 2015.
processing, we introduced a model for Urdu named [16] M. Naili, A. Chaibi, and H. Ghézala, “Arabic topic
Variational Bayes Urdu Latent Dirichlet Allocation (VB- identification based on empirical studies of topic
ULDA). In this research, we deeply study LDA to models,” 2017.
generate topics from Urdu text. In fact, we analyzed the [17] Q. L.-C. S. and N. T. (ICCSNT) and undefined 2015,
consequence of stemming algorithm for topics “A novel Chinese text topic extraction method based
on LDA,” ieeexplore.ieee.org.
identification. We concluded that, the proposed VB-
[18] X. Wu, L. Fang, P. Wang, and N. Yu, “Performance of
ULDA approach successfully identify and generates using LDA for Chinese news text classification,” Can.
topics as compared to other existing TM techniques. In Conf. Electr. Comput. Eng., vol. 2015–June, no. June,
future, we have plan to generate topics using supervise pp. 1260–1264, 2015.
model. We will also apply name entity tagger in the pre- [19] K. Shakeel, G. R. Tahir, I. Tehseen, and M. Ali, “A
processing step for the better results. Furthermore, it will framework of Urdu topic modeling using latent
be motivating to conduct a comprehensive topic dirichlet allocation (LDA),” 2018 IEEE 8th Annu.
identification analysis using LDA, LSA and other Comput. Commun. Work. Conf., pp. 117–123, 2018.
variants of LDA to tackle the challenges of Urdu in text [20] Z. Rehman, W. Anwar, U. B.-P. of the 2nd W. on, and
undefined 2011, “Challenges in Urdu text tokenization
mining field.
and sentence boundary disambiguation,” aclweb.org.
VI. REFERENCES [21] J. Paik, D. Pal, S. P.-P. of the 34th international ACM,
and undefined 2011, “A novel corpus-based stemming
[1] A. Daud, W. Khan, and D. Che, “Urdu language algorithm using co-occurrence statistics,” dl.acm.org.
processing: a survey,” Artif. Intell. Rev., vol. 47, no. 3, [22] Blei, D. M., Kucukelbir, A., & McAuliffe, J. D. (2017).
pp. 279–311, Mar. 2017. Variational inference: A review for
[2] H. W.-P. of the 23rd international conference on and statisticians. Journal of the American Statistical
undefined 2006, “Topic modeling: beyond bag-of- Association, 112(518), 859-877.
words,” dl.acm.org.
[3] C. Papadimitriou, P. Raghavan, … H. T.-J. of C. and,
and undefined 2000, “Latent semantic indexing: A
probabilistic analysis,” Elsevier.
[4] T. H.-A. S. Forum and undefined 2017, “Probabilistic
latent semantic indexing,” dl.acm.org.
[5] D. M. Blei, B. B. Edu, A. Y. Ng, A. S. Edu, M. I.
Jordan, and J. B. Edu, Latent Dirichlet Allocation, vol.
3. 2003.
[6] T. Griffiths, M. Jordan, … J. T.-A. in neural, and
undefined 2004, “Hierarchical topic models and the
nested chinese restaurant process,” papers.nips.cc.
[7] D. Blei, … J. L. the 18th I. C. on N., and undefined
2005, “Correlated topic models,” papers.nips.cc.
[8] C. Wang, J. Paisley, … D. B. the F. I. C. on, and
undefined 2011, “Online variational inference for the
hierarchical Dirichlet process,” jmlr.org.
[9] H. Jelodar, Y. Wang, C. Yuan, and X. Feng, “Latent
Dirichlet Allocation (LDA) and Topic modeling:
models, applications, a survey,” Nov. 2017.
[10] B. Bigi, R. De Mori, M. El-Bèze, and T. Spriet, “Fuzzy
decision strategy for topic identification and dynamic
selection of language models,” Signal Processing, vol.
80, no. 6, pp. 1085–1097, 2000.
[11] C. Jacobi, W. van Atteveldt, and K. Welbers,
 2019 International Conference on Computing, Mathematics and Engineering Technologies – iCoMET 2019

Efficient Energy Utilization in Fog

Computing based Wireless Sensor Networks
Arslan Rafi Adeel-ur-Rehman Gulsayyar Ali Junaid Akram
RCMS, NUST National Centre for Physics RCMS, NUST RCMS, NUST
Islamabad, Pakistan Islamabad, Pakistan Islamabad, Pakistan Islamabad, Pakistan
arslanrafi@ymail.com adeel.rehman@ncp.edu.pk sayyar_khan55@yahoo.com jonu608@gmail.com

Abstract Wireless Sensor Networks (WSNs) consist
of thousands of sensing nodes that are deployed at
remote locations for continuous probing of the
surrounding environment in order to collect useful data.
In general, each node is equipped with a fixed battery
and limited working duration. The fixed battery
condition is dominating these days and therefore energy
efficiency is an important factor to be considered when
the protocols are being designed. In this paper, we
implement an enhanced version of Low-Energy Adaptive
Clustering Hierarchy (LEACH) protocol named as
LEACH with Dijkstra’s Algorithm (LEACH-DA) under
a cloud environment, which optimizes the power
consumption or energy utilization based on shortest path
selection. Also, the proposed framework incorporates
load balancing by picking an appropriate cluster head
(CH) node among its alternates by calculating their
traffic situation with the sink/base station or cloud. In
addition, we employ a fog computing model for our
scenario (i.e. LEACH-DA-Fog) in order to increase
lifespan of network as compared to the original
implementation of the underlying protocol. Some test
cases are presented to show that the proposed updates on
the classical LEACH protocol improve the network
efficiency as well as the durability of the whole network.
Keywords Wireless sensor networks, LEACH protocol,
Dijkstra’s algorithm, Fog computing
In case of large scale sensor networks configured
in a cloud like environment, the nodes have to deal
with massive volumes of data persistently. Processing
of such data obviously requires more time and effort,
which consumes more energy. To cope with this
situation, certain new trends have emerged, like Fog
architectures that provide services closer to the
network [4].
The goals of the Fog archetype is to facilitate the
interconnection of the sensor nodes with the back-end
cloud via a gateway, so that they are able to make self-
decision for reducing computational time [5][6] or
energy consumption requirements. Fog architecture
includes numerous fog nodes (FNs) placed nearest to
an edge network and gain data from Internet-of-Things
(IoTs) or simply sensor nodes. Employment of FNs
help in minimizing latency and avoiding duplicate
information between base station and the end-users.
Thus, by having such a setup in place, we can save
backbone bandwidth and reduce energy consumption
of the underlying core network [7]. Fog computing
architecture with respect to sensor nodes is shown in
Figure 1.

I. INTRODUCTION

Wireless sensor network is a network of small and

low powered nodes. These nodes have very limited life
and are usually deployed to monitor fluctuations under
physical quantities like light, temperature and pressure
of a system or a component of an automation [1]. The
basic framework is to collect data at regular intervals,
convert it into an electronic signal then transmit it
towards a sink node through reliable wireless
communications [2]. The sink works as an
intermediate layer between senor nodes and their
users. Each user can get necessary data from the whole
Fig 1: Fog computing architecture in wireless sensor networks
communication setup by providing requests to the sink
[3].

978-1-5386-9509-8/19/$31.00 ©2019 IEEE

 2019 International Conference on Computing, Mathematics and Engineering Technologies – iCoMET 2019
The foremost challenge in WSNs is to sustain
efficient energy utilization of the underlying nodes
despite their limited lives. To address this issue, a
hierarchical routing protocol i.e. LEACH is
introduced. The fundamental idea of the LEACH
protocol is the creation of clusters in the wireless
sensor networks [8]. Each cluster has a head node
called Cluster Head (CH). Respectively, every node in
each cluster has an equal possibility to become a CH.
Therefore, power consumption of the whole network
is averaged. In this way, LEACH protocol can prolong
lifespan of a network by optimizing the energy
consumption.
We, now describe the LEACH protocol briefly
with respect to its two phases
• Setup phase (election of cluster heads takes
place)
• Steady phase (cluster formation takes place)
A. Setup Phase
In this phase, a randomly distributed value
between 0 and 1 is generated against each node in the
whole network. On the other hand, a corresponding
threshold value is calculated separately making use of
equation A below. If this randomly generated value of
the node is lesser than the threshold value, then the
respective node is able to act like CH.
Equation A. Cluster head selection threshold criteria
Where
p = desired percentage of CHs
r = current round number for calculating threshold
G = is group of nodes not became CHs in last round
B. Steady Phase
Sensor nodes are grouped with its nearby
associated Head Node (CH) to form clusters. A CH
accumulates data from its nodes, aggregates and then
sends to the relevant sink (base station). Direct
communication is not allowed between sink and
member nodes in terms of by-passing the CH.
The proposed research emphasizes on extending
the lifespan of the network by making the involved
sensors more energy proficient. LEACH protocol is
already renowned for that. This research study
implements the LEACH protocol in terms of slightly
978-1-5386-9509-8/19/$31.00 ©2019 IEEE
modifying its steady phase by manipulating Dijkstra’s
algorithm on top of that.
II. LITERATURE REVIEW
The issue of energy consumption in WSNs had
been explored in [8]. In [9], a study regarding task
scheduling and distribution energy management
mechanism if roles dormant cell was presented. They
developed a scheduling process to send information
from sensors to the respected manipulators; though,
distribution of an optimal cluster head is the major
factor for communication. The authors in [10]
proposed a multi-level clustering technique by
decreasing the communication distance (distance
between nodes) for prolonging lifespan of the
communication system. In [11], a supportive approach
of CH selection was proposed for communication in
which a master CH is responsible for information
transfer between sensor nodes to base station. Also, a
vice-CH will become a CH when the master CH dies.
K-medoids clustering algorithm, Euclidean distance
and maximum residual energy of the node were
considered in [12]. K-medoids algorithm is used for
partitioning of nodes in the whole network as CH,
Euclidean distance is applied to make clusters by
considering minimum distance between nodes and its
CH which is selected based upon the maximum
residual energy. This approach is useful for prolonging
network lifetime of wireless sensor networks. The
researchers in [13] considered routing and data
aggregation as two separate tasks in which assisted
nodes is responsible for performing routing task for
the whole network. Therefore, this reduces the
workload on CH, resulting in an increased network
lifetime.
These studies are considered with an intent to
reveal the insights associated to the basic mechanism
of efficient energy consumption in WSNs for
prolonging their lifespan.
III. PROPOSED METHODOLOGY
A. Dijkstra’s Algorithm:
Fig. 2. Simple network of sensor nodes
 2019 International Conference on Computing, Mathematics and Engineering Technologies – iCoMET 2019

Let’s consider a simple network of sensor nodes

having multiple paths with different weights from
source node to destination node 𝒂𝒛 ⃗⃗⃗⃗ as shown in Figure
2. Starting from point “a” we have two different paths
with different weights i-e, 4 and 2 respectively. By
applying Dijkstra’s algorithm, we select the path with
least weight that is 𝒂𝒄⃗⃗⃗⃗ in the present scenario. In the
meanwhile, we consider the second shortest path as
well, it means the path ⃗⃗⃗⃗⃗𝒂𝒃 with weight 4. When we
reached at the node “c”, we have three paths directed
towards the destination “z” i-e,𝒄𝒃 ⃗⃗⃗⃗ ,𝒄𝒅
⃗⃗⃗⃗ and 𝒄𝒆⃗⃗⃗⃗
respectively. We observed that the path 𝒄𝒃 ⃗⃗⃗⃗ have least
weight with respect to the other two paths, ⃗⃗⃗⃗ 𝒄𝒅 and 𝒄𝒆
⃗⃗⃗⃗
⃗⃗⃗⃗
respectively. So we consider 𝒄𝒃 that is shorter than
other two paths. Therefore, in the figure above path
⃗⃗⃗⃗⃗⃗⃗⃗⃗⃗⃗⃗⃗
𝒂𝒄𝒃𝒅𝒛 is the shortest path with the weight of 14
respectively. Moreover, if two paths from source to
destination have same weights, select that path which
have the least number of nodes.

The crux of this research work is to enhance the

energy efficiency of WSNs with the help of Dijkstra’s
algorithm and fog computing architecture. Dijkstra’s
algorithm is implemented internally in the original
LEACH protocol in order to identify optimal path for
the flow of data within each cluster. Moreover,
selection of CH takes place by calculating the load on
each CH. This new version of LEACH protocol is
named as LEACH-DA. This model is also
implemented in the fog-computing environment and
named as LEACH-DA-Fog.

Fog computing is an intermediary layer between Fig 3: Flowchart of proposed protocols

sensor nodes and base station. In this study, we
introduced fog nodes that are almost similar in
functionality to the base station or we can say that fog
nodes acts as sub-base stations. Fog nodes serve as
bridging points to cover all the targeted areas, acting
as local data processing centers.
Flowchart of clustering hierarchical concept
shown in Figure 3.
IV. RESULTS AND DISCUSSION
MATLAB tool is used for estimating LEACH,
LEACH-DA and LEACH-DA-Fog protocol
performance under Microsoft Windows 7 x64 on Intel
Core i5 by considering variant number of sensor nodes
including the fog nodes that are distributed in a
300*500 meter square area. The blue dot represents
the base station which is located at coordinates (150,
495) and the red dot represents the fog node which is
located at coordinates (150, 250) of the network. We
have set 0.5 Joules as the initial energy of the node
while minimum probability for becoming a CH is 0.1.
Some other simulated parameters have been taken into
account with certain associated values. The desired
values of the simulated parameters are shown below in
Table 1.

978-1-5386-9509-8/19/$31.00 ©2019 IEEE

 2019 International Conference on Computing, Mathematics and Engineering Technologies – iCoMET 2019

TABLE 1: Simulated Parameters.

Parameters Values
Base Station At(150,495)
Fog Node At(150,250)
Electric Energy(Elect) 70nJoul
Sensor Nodes Distribution Uniform
Data Aggregation Energy 5nJoul
,EDA
Transmit Amplifier 120pJoul
Energy(Eamp)
Initial Energy,E0 0.5J
No. of rounds, r 2500

Fig. 5: Structure of network (N=200)

Fig. 4. Structure of network (N=100)

Fig. 5.1. Energy levels of nodes Vs No. of rounds

Fig. 4.1. Energy levels of nodes Vs No. of rounds

We first consider a simple network of 100 sensor Fig. 6. Structure of Network (N=500)
nodes that are randomly distributed in an area of
300×500 m2 as shown in figure 4. In figure 4.1, the
graph is plotted by considering energy levels of nodes
after 2500 rounds by considering different variants of
LEACH. We can observe that, residual energy of each
node is reduced as number of rounds increased. As a
result, we estimated that LEACH-DA-Fog consumed
less energy during transmission as compared to
LEACH-DA and LEACH protocol respectively.

When we increased the size of the network by

considering above scenario, we can observe from the
plots below it also made a prominent difference by
Fig. 6.1: Energy levels of nodes Vs No. of rounds
having an increasing in the lifetime of wireless sensor
network as shown below. V. CONCLUSION

978-1-5386-9509-8/19/$31.00 ©2019 IEEE

 2019 International Conference on Computing, Mathematics and Engineering Technologies – iCoMET 2019

Cybernetics (SMC), 2016 IEEE International Conference on,

pp. 002413-002418. IEEE, 2016.

V. CONCLUSION [8] Heinzelman, Wendi B., Anantha P. Chandrakasan, and Hari

This paper evaluates the energy performance
among the classic LEACH, proposed algorithms i.e.
LEACH-DA and LEACH-DA-Fog. Power
consumption or energy utilization is one of the
foremost challenges in developing an efficient
protocol in wireless sensor networks. LEACH
protocol is prominent for providing better clustering
solution under wireless sensor networks among its
predecessors. We proposed a new algorithm named
LEACH-DA (LEACH making use of Dijkstra’s
algorithm) and observed that it also works well in the
fog computing environment. Our test results claim that
the proposed algorithms are more viable in terms of
energy efficiency of the nodes as compared to the
classic LEACH protocol. Moreover, we can observe
from the results that deployment of the fog node and
base station made a prominent difference in enhancing
the lifecycle of WSNs.
REFERENCES
[1] Chauhan, Sneha, and Nishi Yadav. "LEACH-I Algorithm for
WSN." International Journal of Innovative Research in
Computer and Communication Engineering 4, no. 3 (2016):
3459-3466.
Balakrishnan. "An application-specific protocol architecture
for wireless microsensor networks." IEEE Transactions on
wireless communications 1, no. 4 (2002): 660-670
[9] Abdullah, Maan Younis, Gui WeiHua, and Naif Alsharabi.
"Energy scheduling with roles dormant cells in wireless
sensor network." In Mechatronics and Automation, 2009.
ICMA 2009. International Conference on, pp. 541-545.
IEEE, 2009.
[10] Sharma, Meenakshi, and Anil Kumar Shaw. "Transmission
time and throughput analysis of EEE LEACH, LEACH and
direct transmission protocol: a simulation based
approach." Advanced Computing 3, no. 6 (2012): 75.
[11] Sindhwani, Nutan, and Rohit Vaid. "V LEACH: an energy
efficient communication protocol for WSN." Mechanica
Confab2, no. 2 (2013): 79-84.
[12] Bakaraniya, Parul, and Sheetal Mehta. "K-LEACH: An
improved LEACH protocol for lifetime improvement in
WSN." International Journal of Engineering Trends and
Technology 4, no. 5 (2013): 1521-1526.
[13] Kumar, Sunkara Vinodh, and Ajit Pal. "Assisted-leach (a-
leach) energy efficient routing protocol for wireless sensor
networks." International Journal of Computer and
Communication Engineering 2, no. 4 (2013): 420-424.

[2] A.A., Kazerooni, H. Jelodar and J. Aramideh, LEACH and

HEED clustering algorithms in wireless sensornetworks: a
qualitative study. Advances in Science and Technology
Research Journal, 2015. 9(25).
.
[3] Barai, Leena Y., and Mahendra A. Gaikwad. "Performance
Evaluation of LEACH Protocol for Wireless Sensor
Network." Performance Evaluation 1, no. 6 (2014).

[4] Bonomi, Flavio, Rodolfo Milito, Jiang Zhu, and Sateesh

Addepalli. "Fog computing and its role in the internet of
things." In Proceedings of the first edition of the MCC
workshop on Mobile cloud computing, pp. 13-16. ACM,
2012.

[5] Cordeschi, Nicola, Tatiana Patriarca, and Enzo Baccarelli.

"Stochastic traffic engineering for real-time applications
over wireless networks." Journal of Network and Computer
Applications 35, no. 2 (2012): 681-694.

[6] Shojafar, Mohammad, Nicola Cordeschi, and Enzo

Baccarelli. "Energy-efficient adaptive resource management
for real-time vehicular cloud services." IEEE Transactions
on Cloud computing (2016).

[7] Naranjo, Paola G. Vinueza, Mohammad Shojafar, Ajith

Abraham, and Enzo Baccarelli. "A new stable election-based
routing algorithm to preserve aliveness and energy in fog-
supported wireless sensor networks." In Systems, Man, and

978-1-5386-9509-8/19/$31.00 ©2019 IEEE