This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2017 conference.
A Hybrid Energy Efficient FF Algorithm for
Wireless Sensor Network
Raghu Kalyana1 and Setti Naga Aruna2
Department of E.C.E., Kakinada Institute of Technology and Science, Divili, India
Email: 1 k.raaghu7@gmail.com 2 aruna430kits@gmail.com
Abstract—Wireless Detector Network may be a major and
extremely attention-grabbing technology utilized in numerous
applications like monitoring the inaccessible conditions in a
very specific space. Every detector node consists of A battery,
transmitter, receiver and a processor. Exchange or recharging
the battery isn’t potential. So increasing the network lifetime by
reducing the consumption of energy levels of all the detectors
and leveling consumption of energy level at each detector are the
most challenges within the analysis of the routing protocols in
Wireless Sensor Networks. During this paper, associate Energy
consumption clump for wireless detector networks victimization
Hybrid Firefly algorithm (HFA) is enforced at the base station
(BS). A cost value operate has been outlined to reduce the space
between the clusters to optimize the consumption of energy level
of the network. The performance is compared with the protocols
like LEACH and PSOC.
Index Terms—Wireless Sensor Network, Clustering methods,
Fire Fly (FF) algorithm, Energy efficient clustering, Hybrid FF
algorithm.
I. I NTRODUCTION
Wireless detector Network (wsn) is created by network
where each sensor node detects and communication among
built the mistreatment information signals and easier to de-
ployed indiscriminately or manually to sense, monitor and
perceive the desired space. Wireless detectors have several
limitations that build the plan to follow the network protocol
troublesome. One of them is restricted energy offer. It required
more power to communicate each detector to others detectors,
here power consumption most critical to managing the detector
network.
A. Wireless Sensor Network Clustering Formation
Here, the sensing element nodes area unit separated into
little teams, that area unit known as clusters. All the clusters
form as a single cluster head (CH), it can monitor the
remaining other detectors. Detectors in a very cluster don’t
share the information with the sink detectors straightly. They
are going to gathering the info and send to the CH. The Cluster
head can combine this information and sends it to the BS. That
the consumption of energy and variety of collecting message
to the base station (BS) and the variety of active detectors in
communication is additionally decreased. During this order,
the network period is multiplied.
Main approaches projected to this point area unit centered
on creating the changes at waterproof and network layer. To
a lot of major challenges in cluster head area unit to mend
the grid and variety of cluster nodes in a very WSN. For a
978-1-5090-4442-9/17/$31.00 2017
c IEEE 1635
previous couple of years, a range of upgrades is printed to
lower the energy demand in Wireless Detector Network, as
chiefly energy dissipation is a lot of for wireless transmission
and reception. To tackle with of these challenges cluster has
been found to be the economical technique.
Basically cluster may be classified into 3 methodologies.
initial methodology is centralized cluster wherever the base
station can tack the network into clusters, second methodology
is distributed cluster wherever nodes tack themselves into
clusters and third methodology is Hybrid cluster shaped be-
cause the ensuing configuration of the higher than 2 strategies.
many protocols are projected in earlier to increase the sensing
element network life time. The already existed technique
known as LEACH [1]. LEACH could be a distributed cluster
the algorithmic rule, wherever nodes build choices with none
centralized management. At the start, it detects Cluster Head
with a likelihood, p and call are board cast. Where cluster head
selection, a billboard message is transmitted by each CH to the
opposite sensor detector and each one amongst the opposite
CH detector find out a cluster to belongs to, by choosing
the cluster detector may be mistreatment smallest amount of
communication energy reached (depend on the signal strength
of every CH info). All detectors have an opportunity to become
Cluster Head detector to equal to maintain the energy power
spent per circular by every sensing detector.
The projected centralized, cluster based energy efficient
method to increase the detector network lifespan by victim-
ization Hybrid FF algorithmic [2] rule has been formed. The
important plan is to implement planned protocol there is a
choice of intra cluster space b/w itself and the one of the
cluster and energy improve management of the WSN. A high
energy efficient detector node make as a cluster head to use
and to produces cluster member of unit area equally positioned
throughout the total detector field.
The Proposed paper is organized as follows: Section II pro-
vides a short description of the necessary related to papers that
unit area. The system model for the group detector network
presented in Section III. The implementation of the system
with proper coverage is discussed in Section III. Section IV
organized with the simulation results. Conclusion presented in
Section V.
II. R ELATED W ORK
Heinzelman et al look at the protocols for communica-
tion [1] which can be cut back the energy dissipation of the
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2017 conference.
WSN and that they planned a replacement protocol referred to
as LEACH. It is a clump based mostly protocol that uses the
randomized rotation of cluster heads to equally contribute the
energy load related the detector within the network. A detector
becomes a Cluster Head for this circularly if the haphazardly
chosen variety is a smaller amount than the subsequent thresh-
old. Those compared the outputs with previous algorithms like
LEACH & PSOC. The rotation is simulated by obtaining every
detector to settle on a random variety T b/w zero and one:
 p
1 ,
1−p(rmod p )
if n ∈ G
T (n) = (1)
0, otherwise
where the p is cluster head, r is that the circular variety current
and G is represented the cluster of detectors that haven’t been
cluster heads (CH) with in the last 1/p rounds. Once the CH
choice, every cluster head (CH) prepares a Time Division
Multiple Access (TDMA) schedule and sends to any or all
the cluster detectors there in the individual cluster. With this
the created part of Low Energy Efficient Clustering Hierarchy
(LEACH) can get completed.
N. A. Latif, et al proposed Particle Swarm optimization
(PSOC) algorithmic program [3] the cluster energy level
for wireless detector networks (WSN) victimization, that is
enforced at the base station. The main theme of an algorithm
is to seek out place related with a position that ends down the
simplest analysis of a fitness in detector operate. Throughout
every generation, every particle knowledge of information re-
garding its best earliest group position and single best position
of detectors to updates its own resolution by utilization of
equations shown below.
vid (t) = w × vid (t − 1) + c1 ϕ1 (pid − xid (t − 1))
+ c2 ϕ2 (pgd − xid (t − 1)) (2)
xid (t) = xid (t − 1) + vid (t). (3)
Here v represents the velocity of particles, x is the position
of detecting particles, pid is the best position of the particle,
pgd is the position at globally, w is denoted an inertia weight
of particles.
V. Kumar et al proposed [4] A rule to increase network
period of time in Wireless sensing detector Network. The ways
for knowledge transfer square measure hand-picked in such
some way that the entire energy consumption on the trail is
decreased. So as to support the more measurable and fine
knowledge aggregation, often times sensing element nodes
square measure sorted into non-overlapping, disjoint teams
or subsets, that square measure known as clusters. Clusters
can produce hierarchic Wireless sensing element Networks,
that develop economically utilize of the restricted resources
(power) of sensing element nodes, so they extend the period of
time of the sensing network. A lot of work towards clustering
is done, but most of the proposed algorithm implemented and
studied of Hybrid Fire Fly (HFF) method for formation of
clusters.
1636
Fig. 1. The radio model for first order based.
III. S YSTEM M ODEL
A. Network Methodology
This is mainly dealing with the network methodology is
mentioned. Assume the consisted network have N completely
multiple sensor detectors it can be monitor and detects and
collect require data and area unit indiscriminately deployed
uniformly inside a M × M sq. region. The subsequent as-
sumptions area unit created for the network model.
1. Every detector in WSN is individual and stand alone and
maintained efficient energy.
2. Every detector can monitor the tasks periodically and
always collects the acquire data to transmitted to the Base
Station.
3. In sensor Network a base station presented in outside or
inside of the field.
4. Every node have it’s own capability of transmitting power
it is also variable
5. Every detector is eligible to perform either cluster or
cluster head.
6. To avoid information diffusion the redundant gathered
information so the all the data sent can be reduced.
7. Every single hop the information communication can be
done.
B. Radio Energy Model
The implementation of radio energy model is based the
energy level of first order is used in [5]. Here a power
transmitter dissipates the radio energy level and running its
own power and power receiver electronic device dissipates
energy at the receiver the resultant model as shown in Fig. 1.
The power dissipation of energy is directly proportional to the
sq. of the area. For extended power consumption at distance is
proportional to d, Here d is represented as the distance between
T x and Rx detectors. To realize a suitable S/N magnitude
relation for transmission associated with l a message of 1 bit
over a distance d, the radio energy model given by:
ET X (l, d) = ET X−elec (l, d) + ET X−amp (l, d)

l.Eelec + l.εf s .d2 , if d < d0
= (4)
l.Eelec + l.εmp .d4 , if d ≥ d0
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2017 conference.

bit messege received, the radio energy model:
ERX = l.Eelec . (5)
Here E is denoted by the energy power dissipation at trans-
mits, E is the radio energy power dissipation at receives, ε and
ε depends on the electronic equipment transmitter used and d
is the distance of threshold transmission, E is the energy power
consumption per one bit at transmitter and receiver working
given by

εf s
d0 = . (6)
εmp
C. Protocol Description
1) Fire Fly (FF) Algorithm: The Firefly recently algorithm
developed it is one of the meta-heuristic method [6] Dr. Xin
She yang was introduced in the year 2007, this model dis-
cussed that the behavior of fireflies. This algorithmic provide
protocols to search out the positions among particles that end
with operating fitness level at effective analysis. This algorithm
followed three regulations:
1. All fireflies are unisex i.e an attraction will be other
fireflies regardless of their sex.
2. The main objective of fireflies depends on brightness.
3. Fireflies attractiveness that the brightness is directly pro-
portional to it reduces the distance increased.
These three rules prepared by random code of Fire Fly
algorithm.
2) Brightness and Attractiveness of Fireflies: The inverse
square law represents the brightness and attractiveness i.e.:
I0
I(r) = . (7)
r2
Here I(r) is the brightness at a distance r and I0 is the
source of light intensity. The light intensity determined by
the medium.
I(r) = I0 exp(−γr). (8)
Here γ is the absorption coefficient of the medium. In order to
avoid the singularity at r = 0 in Eq. 7, the following Gaussian
form of the approximation is considered.
I(r) = I0 exp(−γr2 ). (9)
The firefly attractiveness is proportional to the brightness seen
by the adjacent fireflies. So that the attractiveness β of a firefly
is given by the equation below.
β = β0 exp(−γrm ). (10)
Here β0 is the attractiveness at r = 0.
3) Distance: ri,j is any two fireflies b/w distance i and
j which are located at xi and xj respectively, the Cartesian
distance is given by the equation below
 solution, V i is generated based on the following equation:
 d

r =  (x − x )2 .
ij i,k j,k (11)
k=1
Here xi,k is the kth component of the spatial coordinate xi of
the ith firefly and d is the number of dimensions.
4) Movement: The firefly’s movement i towards high
brighter firefly j is given by
2
xi = xi + β0 e−γri,j (xj − xi ) + α (12)
where the 2nd term is due to the attraction while the 3rd term
is randomization via α being the randomization parameter.
D. Hybrid FF Algorithm Cluster Formation
A centralized algorithm combines of the Firefly (FF) method
and Differential Evolution [2] to determine the fitness level
of the 1 st ranked in sorted population is again divided into
two sub-populations. The solution in a population represents
with in a specified searching space a solution which is located
randomly. The ith the solution, Xi is represented as
Xi (t) = xi (1), xi (2), . . . , xi d(t). (13)
The 1st subpopulation subjected to undergo neighborhood
under optimization is contained the solutions with potential
fitness values is, whereas a sub-population is subjected to
operate the evolutionary function where xi(k) is the vector
with k = 1, 2, 3, . . . , d, and t is the time step. Initially, the
evaluated fitness value of given solution. The best fitness
value produced is chosen by current best solution in the
population [7]. The ranked newly evaluated solutions are
based on the fitness values and two sub-populations. The 1st
subpopulation that produced potential fitness values contained
solutions where the fitness value ith is each solution in this
sub-population is then compared with its fitness value jth
neighboring solutions. If the fitness value of the neighboring
solution jth is better, the distances b/w each result would then
be calculated exploitation the distance and quality euclidean
live. β is attractiveness employed to work out the distances, it
represents following the following equation:
β = β0 exp(−γr2 i, j) (14)
where the predetermined attractiveness beta0 , light absorption
coefficients rij and the ith solution and its jth neighboring
solution distances respectively. After, this new attractiveness
value was used to the position of the solution updated as given
below:
xid = xid + β(xjd −xid ) + α(δ − 1/2) (15)
where β is uniformly distributed random values its value, lies
b/w 0 to 1 and δ is uniformly distributed random values its
value lies b/w 0 to 1. Thus, the updated attractiveness values
assisted the population to move towards the solution that
produced the significant fitness values. The population in this
solutions are subjected to under the evolutionary operations.
The solutions are produced by the mutation operation is that
performed on the original counterparts. The ith is trivial
Vi (t) = vi (1), vi (2), . . . , vi d(t)
(16)
Vi (t) = xi(best) F.(xr1t − xr2t ) (17)
where xb est(t) is the best solution of vector current, F is
the mutation factor, xr1 and xr2 are chosen vectors randomly

1637
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2017 conference.
from the other solutions. Next, the crossover operation that
involved the parent and the trivial produced by the offspring
solution. The vectors offspring solution is ith, Y i, are repre-
sented as follows:
Yi (t) = yi (1), yi (2), . . . , yi d(t) (18)

vi (t), ifR < CR
yi (t) = (19)
xi (t), otherwise.
A uniformly distributed random variables is R its lies b/w
0 to 1 and the predefined cross-over CR is constant. A
selection operation is required to keep the population size
constant population is produced by the offspring solution. The
performance as follows:

Yi (t), if f (Yi (t) < f (Xi (t)))
Xi (t + 1) = (20)
xi (t), if f (Yi (t) > f (Xi (t))).
The offspring solution is produced by exact equation would
be replaced by the if the fitness value is better than the
exact solution. Otherwise, the population for the next iteration
remains constant.
1. Initialize K randomly selected cluster heads (CH) and
particles of S among in the eligible cluster heads.
2. Calculate the each particle cost function:
i. For each detector ni , i = 1, 2, . . . , N .
a. Calculate distance d(ni , CHp,k ) b/w the node ni
and all cluster heads CHp,k .
b. Assign detector ni to cluster head CHp,k where:
d(ni , CHp,k ) = min{d(ni , CHp,k )} (21)
for k = 1, 2, . . . , K.
ii. Using equation calculate cost function.
3. Find the present fireflies and given to Rank.
4. Particle position are Update.
5. The particle’s position value change in the limit.
6. Updated the closest (x, y) coordinates position with the
new Map.
7. The max no. of iterations is reached until Repeat the steps
two to six.
The optimal group of cluster heads and their associated
clusters [8] recognized by BS. The transmitted message that
consists the cluster head Identification for each detector return
to all detectors in the WSN.
IV. S IMULATION R ESULTS
The simulation results of Wireless Sensor network have
300 detectors in a network area is 200 m × 200 m. The
proposed algorithm is evaluated in MATLAB and middle
area of Network consisted a Base Station. A uniformly dis-
tributed detecting elements in a network snap shot shown in
Fig. 2. In total no of sensor detectors 5% of a set to be
clustered. The projected protocol performance is compared
with the antecedently projected algorithms Particle Swarm
1638
Fig. 2. A uniformly distributed sensor network snape shot.
Data:
• S is particles position is generated to selects the K randomly chosen CH.
• The closest (x, y) coordinates generated position with randomly
Result: To determined the Cluster Head Posiotions
while t < Max Generation of CHs do
To map the particles positions with the closest (x, y) coordinates
The cost function Evaluated
Based on the fitness level sorted Population;
X_Best-first half f (x);
X_worst-second half f (x);
for i = 1 to n0 /2 (all n fireflies) do
for j = 1 to n0 /2 (all n fireflies) do
if Ij > Ii then
Update the Position of Particles;
end
The position of Particles changes are;
end
end
for i = (n0 /2) + 1 to n do Generate trivial solution, Vi (t);
Perform crossover, Yi (t);
Perform selection, Xi (t);
X-combine (Xbest:Xworst);
Find the present best fire flies and given to Rank ;
end
Post process the results;
End procedure;
Algorithm 1: Hybrid Firefly algorithm is formed clustering
Optimization-Centralized (PSOC) and LEACH. The perfor-
mance of simulation is going on until consumed energy of
all the detectors.
The life span of network represents in Fig. 3, the proposed
method briefly explained the network life time that was
compared with protocols of LEACH and PSOC. The HFFA
provides less intra-cluster distance and network partition is
very High. The optimally distributed cluster heads measure
across in the total network. So the consumption of energy by
all the detectors for communication can be reduced because
the distance between cluster heads and their clusters are very
less.
Fig. 4 gives the network lifetime of detectors having homo-
geneous power. From the results it can be clearly understood
that Hybrid Firefly (HFF) algorithm gives better network life
span when compared to other two protocols.
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2017 conference.
Fig. 3. Network lifetime for the nodes with heterogeneous energy.
Fig. 4. Network lifetime for the nodes with homogeneous energy.
V. C ONCLUSION
This paper mainly discussed with the clustering formed
with aware of energy. A Hybrid Firefly algorithm protocol for
wireless detecting element networks mistreatment of cluster
heads enforced for the primary time. A price performance is
determined, that may take the most distance b/w the member
of cluster and cluster heads and therefore the energy of the
cluster head remain candidates are in an account. Results
1639
from the simulations indicate that clump mistreatment Hybrid
Firefly algorithmic rule offers a higher network period of time
compared to LEACH, FFA, and PSOC. The implementation of
hybrid is a technique it improves clusters in wireless sensing
element networks (WSN).
R EFERENCES
[1] W. R. Heinzelman, A. Chandrakasan, and B. Hari, “Energy-efficient
communication protocol for wireless microsensor networks,” in IEEE
Transactions on Wireless Communications, vol. 1. IEEE, 2002,
pp. 660–670.
[2] T. Hassanzadeh and M. R. Meybodi, “A new hybrid approach for data
clustering using firefly algorithm and k-means,” in Artificial Intelligence
and Signal Processing (AISP), 2012 16th CSI International Symposium
on, IEEE, 2012, pp. 007–011.
[3] N. A. Latiff, C. Tsimenidis, and B. Sharif, “Energy-aware clustering for
wireless sensor networks using particle swarm optimization,” in Personal,
Indoor and Mobile Radio Communications. PIMRC 2007. IEEE 18th
International Symposium on, IEEE, 2007, pp. 1–5.
[4] V. Kumar, S. Jain, and S. Tiwari et al., “Energy efficient clustering
algorithms in wireless sensor networks: A survey,” IJCSI International
Journal of Computer Science Issues, vol. 8, no. 5, pp. 1694–0814, 2011.
[5] W. Cheng and H. Shi, “Aeec: An adaptive energy efficient clustering
algorithm in sensor networks,” in Industrial Electronics and Applications.
ICIEA. 4th IEEE Conference on, IEEE, 2009, pp. 3950–3954.
[6] A. Hashmi, N. Goel, S. Goel, and D. Gupta, “Firefly algorithm for
unconstrained optimization,” IOSR Journal of Computer Engineering
(IOSR-JCE), vol. 11, pp. 75–78, May–June 2013.
[7] U. Sur and G. Sarkar, “Hybrid firefly algorithm based distribu-
tion state estimation with regard to renewable energy sources,” in
Microelectronics, Computing and Communications (MicroCom), 2016
International Conference on, IEEE, 2016, pp. 1–6.
[8] A. Rajan and T. Malakar, “Optimal active power dispatch using hybrid
firefly algorithm,” in India Conference (INDICON), 2014 Annual IEEE,
IEEE, 2014, pp. 1–7.