International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT) - 2016
A Fuzzy-ACO Algorithm to enhance Reliability
Optimization through Energy Harvesting in WSN
Avishek Banerjee1,Samiran Chattopadhyay2
1, 2, 3
Department of Information Technology
1,3
Asansol Engineering College, 2Jadavpur University
1, 3
Asansol-713305, 2Kolkata-700098, 1, 2,3India
1
avishekbanerjee@gmail.com, 2samirancju@gmail.com
Abstract— Reliability optimization in Wireless Sensor
Network (WSN) is obviously an important problem. The basic
function of a WSN is to provide an adequate and quality data
transmission as economically as possible with a reasonable level
of reliability with minimum power consumption. To make the
system more reliable, solar energy has been considered as energy
harvesting strategy. In this paper, an algorithm aiming for
reliability optimization in WSN systems is discussed. This
algorithm is based on a modified Ant Colony Optimization
(ACO) algorithm. The throughput obtained from Sensor
Medium Access Control (SMAC) protocol considered as
objective function with respect to different environmental
constraints. For the input variables, fuzzy models with
trapezoidal membership functions are used. The results obtained
are compared with other approaches from literature and found
satisfactory.
Keywords— reliability optimization; Fuzzy model; wireless
sensor network; solar energy harvesting; SMAC protocol; ant
colony optimization;
I. INTRODUCTION
This Reliability study of a WSN system would include an
important field of energy saving phenomena called Energy
Harvesting [1]. It is necessary to ensure a reasonable balance
in the reliability of these various components/parameters,
because the WSN is active until a tolerate range of parameter
is permitted; otherwise it will not be able to active. In this
paper power efficiency has been chosen as reliability factor.
More power efficient WSN system ensures more reliable
network because due to power consumption of WSN electro-
mechanical components its’ reliability or probability of
sustainability with respect to a particular environment is
affected. The power consumption mainly depends upon the
choice of MAC protocol and among all WSN protocol SMAC
having a good impact to enhance reliability of network [2].
Therefore if we can minimize the power consumption or
maximize throughput of SMAC protocol using some
optimization tool it will be considered as new approach in this
arena.WSN consist of several nodes and a supervisory node
(gateway) which maintains the communications with
subordinate nodes and the remote control station. The nodes
contain tiny processor, tiny transmission system, sensors and
tiny battery as energy source. As the battery source is limited
there should be some system to recharge the battery when is
978-1-4673-9939-5/16/$31.00 ©2016 IEEE
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.
Anup Kumar Mukhopadhyay3,Grigoras Gheorghe4
4
Electrical Engineering Faculty
4
"Gheorghe Asachi" Technical University of Iasi
4
Iasi, 4Romania
3
anup.mukhopadhyay@gmail.com,4ghgrigoras@yahoo.com
gets discharge and make a reliable system. There are many
energy harvesting strategies present in recent era, solar energy
harvesting system is one of the important energy harvesting
strategy. Photovoltaic cell of Solar cells absorbs the solar
energy and solar cell exhibits electrical energy and thus energy
can be extracted from nonconventional renewable
environments. Charging battery by solar energy can be
affected with weather conditions (e.g., cloudy environments)
[2] and many more constraints which affect the light intensity
of sun. As the intensity is directly proportional to the power
generation therefore there should be a constrained nonlinear
minimization problem to consider the mathematical model of
a reliable WSN system. Reliability can be defined as the
sustainability or guaranty of performance over long run with
subject to resource constraints. In this paper the main goal is
to optimize the reliability of WSN in respect to minimization
of power consumption though the presence of constraints is
dependent on the environmental dependency of the studied
problem. Here reliability optimization problem is basically a
minimization problem. In this paper, the study example has
been solved in a nonlinear mixed integer environment [3] with
fuzzy quantities.In the present era of information technology,
we can access much more information, than a few years ago.
To consider the problem as real life problem uncertainty can
be introduced into the problem. The uncertain reliability
indices, the value of throughput, value of Request To Send
(RTS) , Clear To Send (CTS) , Acknowledgement (ACK) etc.
will be represented as fuzzy numbers, with membership
functions over the real domain Ã. A fuzzy number can have
different shapes, but generally it is represented as a triangular
(1) or trapezoidal (2) fuzzy membership function, Fig. 1. In
the both cases, these representations can be expressed through
breaking points [4]:
~
A ⇔ ( x1 , x 2 , x3 ) = [ m , a , b ]. (1)
(2)
A ⇔ ( x , x , x , x ) = [ m , n , a , b ].
1 2 3 4
1
a b
0 m n X
Fig.1 A trapezoidal fuzzy number
584
 II. THE PROPOSED METHODOLOGY
Power source to WSN by battery is a finite resource that
cannot guaranty a longer operational life therefore solar
system can be considered as energy harvesting model due to
its high power density as well as outside deployment facilities.
The power density directly proportional to the intensity of
solar radiation absorbed at photovoltaic cell. There are so
many environmental dependent limitations/constraints which
affect the energy harvesting like intensity of solar flux, type of
clouds, day hour, season etc. One of the most widely equation
is:
0.678
G ( ζ ) = G 0 e − 0.357 (sec( ζ )) , (3)
where
sec( ζ ) = 1 / (sin( λ ) sin( η ) + cos( λ ) cos( η ) cos( t )),
where t = (360/24)T (T indicates the number of hours in a
solar noon). G0 indicates the solar flux intensity of sun ray and
its value is 1.35 KW/m2 [5].this equation expresses intensity
of solar emission in day hour (t), latitude of collector site (Ȝ)
and solar declination (Ș).
In this analysis cloud lengthiness and thickness is treated as
constraint in minimization problem and it is expressed through
exponential distribution fci (xi). Probability Pi represents block
the direct sunlight radiation depending upon cloud type/state.
k PANT(t) = {xi(t); i=1,…,NP} .
fX ( x ) = ¦ Pi f c ( x ),
i (4)
i =1
where
xi
1 −
f ci ( xi ) = e ci ( xi > 1),
And n ci
¦ Pi = 1
i =1
In (5), xi and ci represent length of cloud type/state and mean
cloud’s length in state i (in km), respectively.
At first, different input parameters are modeled as fuzzy
numbers using trapezoidal membership functions and fed in
the modified ACO algorithm. To maximize the system
reliability; a new fuzzy single objective optimization model is
proposed and solved with a new ACO algorithm.
Crisp Input Crisp Output
Fuzzification Optimization
using using ACO
Defuzzification
Trapezoidal Algorithm
Fuzzy Number
Fig.2 The block diagram of the proposed solution methodology
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.
In ant colony optimization, a number of artificial ants build
solutions to the considered optimization problem at hand and
exchange information on the quality of these solutions via a
communication media, pheromone trail, which is reminiscent
of the one adopted by real ants. The original ACO algorithm is
known as Ant System proposed in the early nineties [6].
Each ant constructs a solution by repeatedly applying a state
transition rule and the solution is improved by a local search
algorithm. Then the ant modifies the amount of pheromone on
the visited edges by applying a local pheromone updating rule.
Once all ants have done their operations, the amount of
pheromone is modified by applying a global updating rule.
°­(1 − ρ).τij + ρ.Δτij ,if(i,j) ∈ best solution
τij = ® (7)
°̄ τij otherwise
The local pheromone updating rule is shown below
{
τij = τij .(1 − ϕ) + ϕ.τ0 (8)
The steps of the proposed meta-heuristic ACO algorithm [7]
are given below (See also Fig. 3).
Step 1: Initialize ANT (generally tallied with population)
solution and generate ANT/Population size Ps. Define
Attractiveness (IJ) and Visibility Function (Ș). Set the bounds
of decision variables.
Step 2: Set the generation/iteration number t = 0.
Step 3: Initialize randomly the ANT solution of the population
Step 4: Compute the next ANT solution according to the
Attractiveness (IJ) and Visibility Function (Ș) here Visibility
function is tallied with fitness function [f(xi)] for each variable
(5) xi of PANT(t) and attractiveness is based upon local Pheromone
updating rule [see equation 8] .
(6)
Step 5: Find the global best ANT solution (PgANT) having the
best fitness/Visibility value depending upon global Pheromone
updating rule [see Equation 7] and local updating rule [see
Equation 8] and choose best one.
Step 6: Repeat the following until termination criterion is met
6.1: Increment generation by: t= t+1.
Step 7: Verify termination criterion. If termination conditions
are not met, go back to Step 6, elsewhere go to Step 8.
Step 8: Print the value of fitness/Attractiveness value of
global best ANT solution.
Step 9: End.
III. PROBLEM FORMULATION AND NUMERICAL SOLUTIONS
SMAC protocol has chosen as energy efficient protocol for its
special characteristic called Duty Cycle, where nodes
alternatively changes its active and sleeping states [8]. Active
period has two phases. In Synchronization phase: Neighboring
sensors synchronize their transmissions by ex-changing their
sleep-active schedules [9].
585
 RTS/CTS handshake phase is coordination between RTS to sleeping state. On the other hand, successful data burst
and CTS [10].From Fig. 4 one can easily notify, fulfilling the conditions will not flips to sleeping state until it
RTS/CTS/DATA/ACK packet architecture to ensure gets acknowledgement signal. Long messages are spited into
successful transmissions. After the active period transmission small fragments and these fragments are transmitted in Data
takes place. In case of failure or RTS collision the nodes flips bursts [8].
Update Phase
Initialization Phase
Update ANT by global pheromone
Update ANT by local Update rule and compare with local
pheromone Update rule update rule
Initial Population/ANTs

Find
PgANT

PANT(t) No
Termination
condition?

Yes
Fig. 3. The block diagram of the modified ACO algorithm
Print Result

End

Fig. 4. Data Frame of SMAC protocol

M The ratio of RTS/CTS period to the total active period Pb Channel busyness probability of the system

l The number of data packets in each burst Ts Successful transmission length

Tp MAC layer information length in each data packet Ta Active transmission length

Ps Successful Transmission Probability of the system Tc Collision length

n No of contending stations DIFS DCF(Distributed coordination function) Inter-Frame Space

τ Transmission Probability Theader Length of MAC header

ACK Acknowledgement CTS Clear To Send

RTS Request To Send SIFS Short Inter-Frame Space

586
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.
 Dcycle Duty Cycle Maximize Throughput with respect to variable l, M and Dcycle
Throughput Ratio between fraction of a data transmission cycle and total
i.e., Maximize f (l , M , Dcycle )
cycle time.

Now our aim is to maximize the throughput. Where

¦ (P D s
i
cycle l.TP M )
f (l , M , Dcycle ) = i =1
n
(Ta (1 − Di cycle ) + Ts ( Ps − Di cycle ))
¦D
i =1
i
cycle .( M ((1 − Pb )δ + ( Pb − Ps )Tc + PT i 2 i
s s )) + D cycle .((1 − M ) Ta ) + (1 − D cycle )
Di cycle

and Dcycle = Ta (1 − Ps ) + (Ta + Ts ) Ps

n
Subject to, Ps = ¦ iτ(1 − τ)i−1
i =1 T T
n Where l ∈ Z + and 0 < M < 1
Pb = ¦1 − (1 − τ)n
i =1

Ts = RTS + CTS + l (Tp + THeader + ACK ) + DIFS + (2l + 1)SIFS Tc=RTC+CTS+ACK+DIFS

TABLE I. SMAC PARAMETERS OF NUMERICAL SOLUTION TAKEN FROM [2]

Parameter Value Parameter Value Parameter Value
Data Rate (bits) 19200 THeader (Byte) 8 DIFS (ms) 50
Tp (Byte) 100 CTS (bit) 304 Ta (ms) 300
RTS (bit) 352 SIFS (ms) 10 n 20
N.B – assuming all saturated condition(s) of
ACK (bit) 304 į (ms) 20 permissible data transfer criteria.

TABLE II. SMAC INPUT PARAMETERS AFTER FUZZYFICATION [CONVERSION OF INTEGER PROGRAM TO MIXED INTEGER PROGRAM]
Value with Interval Value Value with Interval Value
Parameter tolerance Parameter tolerance
Data Rate (bits) 19200 ± 0.25% [19152, 19248] SIFS (ms) 10± 0.25% [9.975,10.025]
Tp (Byte) 100 ± 0.25% [99.75,100.25] į(ms) 20± 0.25% [19.95,20.05]
THeader (Byte) 8± 0.25% [7.98,8.25] DIFS (ms) 50± 0.25% [49.875,50.125]
[303.24§303 [299.25,300.75]
CTS (bit) 304± 0.25% ,304.76§305] Ta (ms) 300± 0.25%
[351.12§351, [19.95§20,
RTS (bit) 352± 0.25% 352.88§353] n 20± 0.25% 20.05§20]
[303.24§303, N.B – assuming all saturated condition(s) of
ACK (bit) 304± 0.25% 304.76§305] permissible data transfer criteria.
N.B – As bit cannot be in fraction therefore the bold fields are rounded off.

TABLE III.a RESULTS FOR FUZZY MODELS OVER 50 RUNS USING FUZZY-ACO ALGORITHM.(FOR FIXED VALUE OF l = 4)

Fuzzy Value using Fuzzy Value using Fuzzy Value using Fuzzy Value using
Objective
Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO
Function /
algorithm algorithm algorithm algorithm
Parameters
(for M=0.2) (for M=0.4) (for M=0.6) (for M=0.8)
F(l,M,D)i.e.
value of [0.072,0.083,0.104,0.115] [0.241,0.252,0.274,0.286] [0.453,0.461,0.485,0.497] [0.423,0.514,0.776,0.867]
Throughput
Data Rate [19152,19184,19216, [19152,19192,19208, [19152,19194,19206, [19152,19193,19207,
(bits) 19248] 19248] 19248] 19248]
Tp (Byte) [99.75,99.92,100.09,100.25] [99.75,99.93,100.08,100.25] [99.75,99.95,100.06,100.25] [99.75,99.94,100.07,100.25]
THeader (Byte) [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02]
[303.24, 303.75, [303.24, 303.76, [303.24, 303.78, [303.24, 303.77,
CTS (bit) 304.26,304.76] 304.25,304.76] 304.23,304.76] 304.24,304.76]
[351.12, 351.69, [351.12, 351.70, [351.12, 351.72, [351.12, 351.71,
RTS (bit) 352.26,352.88] 352.25,352.88] 352.23,352.88] 352.24,352.88]

587
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.
 [303.24, 303.76, [303.24, 303.77, [303.24, 303.79, [303.24, 303.78,
ACK (bit) 304.25,304.76] 304.24,304.76] 304.22,304.76] 304.23,304.76]
[9.975, 9.992, [9.975, 9.994, [9.975, 9.996, [9.975, 9.995,
SIFS (ms) 10.009,10.025] 9.998,10.025] 9.996,10.025] 9.997,10.025]
[19.95, 19.983, [19.95, 19.994, [19.95, 19.996, [19.95, 19.995,
į(ms) 20.016,20.05] 20.005,20.05] 20.003,20.05] 20.004,20.05]
[49.875, 49.958, [49.875, 49.969, [49.875, 49.971, [49.875, 49.97,
DIFS (ms) 50.041,50.125] 50.03,50.125] 50.03,50.125] 50.04,50.125]
[299.25, 299.75, [299.25, 299.76, [299.25, 299.78, [299.25, 299.77,
Ta (ms) 300.25,300.75] 300.24,300.75] 300.22,300.75] 300.23,300.75]
[19.95, 19.983, [19.95, 19.994, [19.95, 19.996, [19.95, 19.995,
n 20.016,20.05] 20.005,20.05] 20.003,20.05] 20.004,20.05]

TABLE III.b RESULTS FOR PROPOSED MODEL OVER 50 RUNS USING FUZZY-ACO ALGORITHM. .(FOR FIXED VALUE OF M = 0.8)
Fuzzy Value using Fuzzy Value using Fuzzy Value using Fuzzy Value using
Objective
Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO Trapezoidal-fuzzy-ACO N
Function /
algorithm algorithm algorithm algorithm
Parameters
(for l=1) (for l=4) (for l=7) (for l=10)
F(l,M,D)i.e.
value of [0.075,0.084,0.103,0.115] [0.245,0.253,0.274,0.285] [0.455,0.462,0.483,0.495] [0.905,0.915,0.935,0.945]
Throughput
Data Rate [19152,19193, [19152,19194, [19152,19192, [19152,19184,
(bits) 19207, 19248] 19206, 19248] 19208, 19248] 19216, 19248]
Tp (Byte) [99.75,99.94,100.07,100.25] [99.75,99.95,100.06,100.25] [99.75,99.93,100.08,100.25] [99.75,99.92,100.09,100.25]
THeader (Byte) [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02] [7.98, 7.993, 8.0063,8.02]
[303.24,303.77, [303.24, 303.78, [303.24, 303.76, [303.24, 303.75,
CTS (bit) 304.24,304.76] 304.23,304.76] 304.25,304.76] 304.26,304.76]
[351.12, 351.71, [351.12, 351.72, [351.12, 351.70, [351.12, 351.69,
RTS (bit) 352.24,352.88] 352.23,352.88] 352.25,352.88] 352.26,352.88]
[303.24, 303.78, [303.24, 303.79, [303.24, 303.77, [303.24, 303.76,
ACK (bit) 304.23,304.76] 304.22,304.76] 304.24,304.76] 304.25,304.76]
[9.975, 9.995, [9.975, 9.996, [9.975, 9.994, [9.975, 9.992,
SIFS (ms) 9.997,10.025] 9.996,10.025] 9.998,10.025] 10.009,10.025]
[19.95, 19.995, [19.95, 19.996, [19.95, 19.994, [19.95, 19.983,
į(ms) 20.004,20.05] 20.003,20.05] 20.005,20.05] 20.016,20.05]
[49.875, 49.97, [49.875, 49.971, [49.875, 49.969, [49.875, 49.958,
DIFS (ms) 50.04,50.125] 50.03,50.125] 50.03,50.125] 50.041,50.125]
[299.25, 299.77, [299.25, 299.78, [299.25, 299.76, [299.25, 299.75,
Ta (ms) 300.23,300.75] 300.22,300.75] 300.24,300.75] 300.25,300.75]
[19.95, 19.995, [19.95, 19.996, [19.95, 19.994, [19.95, 19.983,
n 20.004,20.05] 20.003,20.05] 20.005,20.05] 20.016,20.05]
TABLE IV.a THE BEST RESULT FOR PROPOSED SYSTEM OVER 50 RUNS USING FUZZY-ACO ALGORITHMS AFTER DIFUZZIFICATION
Crisp Value after Crisp Value after Crisp Value after Crisp Value after
Objective Function Value /
difuzzification difuzzification difuzzification difuzzification Method
Parameters
(for M = 0.2) (for M =0.4) (for M = 0.6) (for M = 0.8)
F(x)i.e. value of
0.0935 0.26325 0.474 0.645
Throughput
Data Rate (bits) 19200 19200 19200 19200
Tp (Byte) 100.0025 100.0025 100.0025 100.0025
THeader (Byte) 7.999825 7.999825 7.999825 7.999825
CTS (bit) 304.0025 304.0025 304.0025 304.0025
RTS (bit) 351.9875 351.9875 351.9875 351.9875
ACK (bit) 304.0025 304.0025 304.0025 304.0025
SIFS (ms) 9.998 9.998 9.998 9.998
į(ms) 19.99975 19.99975 19.99975 19.99975
DIFS (ms) 50.0025 50.0025 50.0025 50.0025
Ta (ms) 300 300 300 300
n 19.99975 19.99975 19.99975 19.99975
TABLE IV.b THE BEST RESULT FOR PROPOSED SYSTEM OVER 50 RUNS USING FUZZY-ACO ALGORITHMS AFTER DIFUZZIFICATION

588
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.
 F(x)i.e. value of
0.09425 0.26425 0.47375 0.925
Throughput
Data Rate (bits) 19200 19200 19200 19200
Tp (Byte) 100.0025 100.0025 100.0025 100.0025
THeader (Byte) 7.999825 7.999825 7.999825 7.999825
CTS (bit) 304.0025 304.0025 304.0025 304.0025
RTS (bit) 351.9875 351.9875 351.9875 351.9875
ACK (bit) 304.0025 304.0025 304.0025 304.0025
SIFS (ms) 9.998 9.998 9.998 9.998
į(ms) 19.99975 19.99975 19.99975 19.99975
DIFS (ms) 50.0025 50.0025 50.0025 50.0025
Ta (ms) 300 300 300 300
n 19.99975 19.99975 19.99975 19.99975

TABLE V. COMPARISON OF THE BEST FUZZY-ACO RESULTS WITH EXISTING APPROACH FOR FIXED VALUE OF l=4 AND M=0.8
Our Approach EXISTING Our Approach
APPROACH [3]
Value of
Value of objective EXISTING APPROACH Proposed Proposed
objective
function [3] Trapezoidal- Trapezoidal-
function
fuzzy-ACO fuzzy-ACO
algorithm algorithm
For M = 0.2 0.09 0.0935 For l= 1 0.08 0.09425
For M = 0.2 0.26 0.26325 For l = 4 0.255 0.26425
For M = 0.6 0.47 0.474 For l = 7 0.465 0.47375
For M = 0.8 0.6 0.645 For l = 10 0.92 0.925

university is TUIASI, Romania, and the research work was

Due to the fuzzy-stochastic nature of the proposed
algorithm, 50 independent runs have been made for the
problem considering different sets of random fuzzy
numbers. The proposed algorithm has been coded in the
C++ / Matlab environment and the simulation has been
performed using a Linux platform. In this simulation, a run
is considered to be successful if the solution obtained is
either the same or better than the known best found solution.
IV. CONCLUSIONS
In this paper, we have proposed an efficient fuzzy-ACO
algorithm for solving the constrained optimization problem
of maximizing the reliability of WSN and, as computation
results show, the solutions obtained with our fuzzy-ACO
approach are better than the same found by an alternative
deterministic approach. The novelty of this approach is that
here we have introduced to the hybrid modeled as
trapezoidal fuzzy numbers, and after optimization with the
help of a defuzzification method, ultimately we got our
desired crisp output, which is more close to the optimum
value with respect to existing approaches.
ACKNOWLEDGMENT
Author A. Banerjee is in Ph.D. mobility at the
“Gheorghe Asachi” Technical University of Iasi, Iasi-
700506, Romania. He gratefully acknowledges the support
by EU Erasmus Mundus Project – cLINK(Center of
Excellence for Learning, Innovation, Networking and
Knowledge),Grant Agreement No: 212-2645/001-001-EM,
Action-2 Partnerships. The project is developed under
“Erasmus Mundus External Corporation: Asia Region, Lot 9
(Ref. EACEA/42/11)” and it is coordinated by the
university of Northumbria from Newcastle, UK. The partner
performed in its Power Engineering department of the
Electrical Engineering Faculty.
REFERENCES
[1] Raghunathan, Vijay, et al. "Design considerations for solar energy
harvesting wireless embedded systems." Proceedings of the 4th
international symposium on Information processing in sensor
networks. IEEE Press, 2005.
[2] Tadayon, N., Khoshroo, S., Askari, E., Wang, H., & Michel, H.
(2013).Power management in SMAC-based energy-harvesting
wireless sensor networks using queuing analysis. Journal of Network
and Computer Applications, 36(3), 1008-1017.
[3] L. Sahoo, A.Banerjee, A.K. Bhunia, & S. Chattopadhyay, "An
efficient GA-PSO approach for solving mixed integer nonlinear
programming problem in reliability optimization", Int. J. Swarm and
Evolutionary Computation, Elsevier.(2014).Vol. 19, December 2014,
pp. 43–51.
[4] B.P. Lang, A. Pahwa, Power Distribution System Reliability Planning
Using a Fuzzy Knowledge-Based Approach, IEEE Trans. on Power
Delivery, 2000, Vol. 15, No. 1, pp. 279 – 284.
[5] J. Kim, J. P. M. Torregoza, I. Kong, and W. J. Hwang, “Photovoltaic
cell battery model for wireless sensor networks,” IJCSNS
International Journal of Computer Science and Network Security, vol.
6, no. 9B, pp. 90–97, Sep. 2006.
[6] Dorigo, Marco, and Christian Blum. "Ant colony optimization theory:
A survey." Theoretical computer science 344.2 (2005): 243-278
[7] Dai, Qiguo, Junzhong Ji, and Chunnian Liu. "An effective
initialization strategy of pheromone for ant colony optimization."
Bio-Inspired Computing, 2009. BIC-TA'09. Fourth International
Conference on. IEEE, 2009.
[8] J. H. W. Ye and D. Estrin, “An energy-efficient MAC protocol for
wireless sensor networks,” in Proceeding INFOCOM’02, California,
November 2002, pp. 1567–1576.
[9] O. Yang and W. Heinzelman, “Modeling and throughput analysis for
SMAC with a finite queue capacity,” in 5th International Conference
on Intelligent Sensors, Sensor Networks and Information Processing
ISSNIP, Dec 2009, pp. 409–414.
[10] Part 11: Wireless LAN Medium Access Control (MAC) and Physical
Layer (PHY) Specification. IEEE, 1999.

589
Authorized licensed use limited to: Jaypee Insituite of Information Technology-Noida Sec 128 (L3). Downloaded on May 12,2020 at 16:31:13 UTC from IEEE Xplore. Restrictions apply.