Optimizing Energy Consumption in Sensor Networks Using Ant Colony Algorithm and Fuzzy System

International Journal of Computer Application
Available online on http://www.rspublication.com/ijca/ijca_index.htm
Issue 4, Volume 1 (February 2014)

ISSN: 2250-1797
Optimizing Energy consumption in sensor networks using

ant colony algorithm and fuzzy system
Zahra Malekan
Seyed Javad Mirabedini
Hassan Zarei
Mehraneh Abdini Aboksar
Islamic Azad University, Research and Science Branch, Amol, Iran
Islamic Azad University, Centeral Tehran Branch, Tehran, Iran
Institution Shams University, Gonbad branch, Gonbad,Iran
Islamic Azad University, Research and Science Branch, Amol, Iran
__________________________________________________
ABSTRACT
One of the important tasks in sensor networks is broadcasting, when a sensor node sends
its data to other sensor nodes we are encounter with a lack of energy. With due to attention to
limited source of each sensor nodes, we must use a suitable algorithm for saving energy and this
algorithm MBE. In this work we propose an algorithm that we can find the minimum of energy.
The purpose of Fuzzy-ACO algorithm is solving the problem on the MBE. The test results show
(or according to the test results) ACO algorithm is much better and more efficient than other
algorithms. Depending on the type of antennas that is using in the sensor network, the results of
the ACO Concentrated algorithm and ACO Fuzzy algorithm are very close together.
Key words: Minimum energy broadcast, centralized computing, Ant colony optimization &
system fuzzy.
Corresponding Author: Zahra Malakan
R S. Publication (rspublication.com), rspublicationhouse@gmail.com
Page 115


ISSN: 2250-1797
INTRODUCTION
Since 1980 computers were easily found in any home and they used a wire to connect to
each other and after several years generated advanced technologies for communication between
computers.
Today communications between systems are doing with small machine and in insecure places; in
fact this progressive technology is an advantage of sensor networks that introduced in article [1].
Sensor nodes are transferring their data's to other sensor nodes with radio frequencies. As you
know these nodes have a high speed to transfer their information on the other hand they are
about7 inches. And there is limited memory inside them and they are using in places such as
hospitals (to health) and agriculture and economic.
The sensor nodes are useful in distributed environments too. A good (unique) featured of sensor
nodes in collaboration between them and the result of this collaboration is doing complex tasks.
When there is no energy source, you can use sensor nodes too. So in this process we must control
the energy consumption of each node because we are encounter sensor nodes with different
levels of energy transferring, from different companies that we are studying their energy
consumption at the moment of data transferring.
MATERIALS AND METHODS (Times New Roman, Font size:12 ,Bold ,left aligned)
1.1-Related Works
In this part we want to show you completed works about minimum energy broad casting in
wireless sensor networks, so you can find them in these articles: the summary of sensor
networks, introduced in article [3], ACO concentrated algorithm in articles [4,5] that it search's
with r-shrink, introduced in article [6] and you can know about the type of real antenna in ACO
algorithm in article [1], [MEM] means transfer information, introduced in part [2] and article [6],
MEM with of antennas introduced in part [3], article [6]. There are some complex ways about
energy broadcasting introduced in article [9-2] according to Centralized heuristic ways or ACO
MEB problem with real of antennas is about BIP algorithm, introduced in article [13-14]. We
have some different algorithms that introduced in article [15] (MPR) algorithm and DP algorithm
in traduced in article [16].
Page 116


ISSN: 2250-1797
1-2 The Original

In this work (Process) we are studying use Fuzzy -ACO algorithm for saving energy in MEBRA.
This algorithm is according to the BIP heuristic algorithm. Development structure of the solution
is according to the local search and the results show that the function of Centralized Fuzzy-ACO
algorithm is much better than Centralized ACO algorithm and BIP algorithm.
1.3-Organization of the paper
Paper is organized as follows: minimum energy Broad Casting in sensor networks with the real
antenna introduced in part [2] ACO-Fuzzy algorithm Centralized in Minimum energy
broadcasting Show the results of reiteration different algorithm in part [4], And results and
works for the future are distinct become determined.
2 - Minimum Energy Broad casting in sensor networks with the real antenna:
Consider that a set of nodes V, i member of the set V is set of nodes V have is a finite
energy As energy in the battery is defined as pi p={tp1, tp2,,tpm} and as one of Energy tp1=0
Is defined to be graduallyincreases energy. For a nodes can perform data transfer they require
more energy to their distance from the sensor node is Namely pi> = d ( i , j ), is a parameter
that depends on the environment. k is the energy of sensor nodes and d(i, j) the distance between
twonodes the valueof theconstant, we assumethat 2or4hereweconsider MEB problem in paper
[21] is presented A set of nodes, It is a question of hard or NP we consider the fixed points A
link is defined between the points where d(i , j) Euclidean distance is between the nodes i , j
Graph G(V,E) Define and If the source node S and node transmission power for sensor nodes
and a set of Formula 1.
The value of the constant , we assume that = 2 or 4 Here we consider 2. MEB problem is in
paper [21]. This is a difficult problem or NP nodes with a set of fixed points, and we define a
link between points is so. Euclidean distance between the nodes i and j. You can define the
network node and a source node S to transfer power to all sensor nodes can define the formula 1.
F (T )
max(i, j ) ET p(i, j )
iv
(1)
p(i, j ) min{tpl p | tpl d (i, j ) tpl 1 d (i, j )
(2)
Page 117


ISSN: 2250-1797
Note that the transmission power level (see [4]) setting which corresponds to a solution T is
obtained by setting pi: = 0 for all leaf nodes of T, and otherwise.
pi : max(i, j) ET pij (3)

3. BIP for the MEBRA problem
The BIP algorithm [5] starts from a partial solution T = (VT , ET ), where VT := {s} and ET := ,
which is iteratively increased until all nodes in the network are included in the solution. In other
words, T initially includes only the source node s.
At each construction step, one edge is added to the current partial solution. The set NT of
potential links that can be added to T is defined as follows:
NT : {(i, j) VT , j VT }
where E is the edge set of the directed network G as defined in Section 2. More specifically, NT
consists of those links whose source node is in T, whereas the goal node is not in T . The choice
of a link from NT is done by means of a greedy function () that assigns a value to each e NT .
The BIP algorithm uses the following greedy function:
(e) : f (T*) f (T ),e NT

Hereby, T is defined as follows:
T * : T {e} {(u, v) | u VT V VT f (T e {u, v})

f (T e)}
The operation adds an edge e to a tree T. In addition it adds to T the end node of e which is not
yet part of T Concerning Eq. (5), T is obtained by extending T with edge e = (i, j) and
additionally with all the other edges from NT (if any) that can be added to T without any further
increase of the global transmission power. This concerns all links e = (i, k) NT with d(i, k)
pij.[2]
3 Introduction centralized Fuzzy- ACO algorithm:
Here, we introduce concentrated fuzzy-ACO algorithm. ACO algorithm is presented in
paper [2], and known as the MAX-MIN. At first in fuzzy system the effective parameters in the
solving problem process, real numbers convert into fuzzy values And then with using fuzzy
Page 118


ISSN: 2250-1797
process and use Membership functions of input and output variables Using a fuzzy rule base we
obtain the required output Which is includes 3 parts.
Section1: The input membership functions,
Section2: the output Membership functions,
Section 3: base fuzzy rules and Non-fuzzy operation mechanism. to find the fuzzy value to a real
number with non fuzzy mechanism.
At the beginning of the algorithm for each of the input variables and distance between nodes and
values pheromone nodes we defined an Equivalent membership function, distance=
[near,mideum ,far]and pheromone = [Low, mid, high], The input values are normal pheromone
and distance
0 dis tan s
real (dis tan s)

1
max(dis tan s)
0 phermone
(6)
real ( phermon)
1
max(phermon)
Distance =[near, medium, far] ,

distance
near
far
medium
Fig2. Input membership functions Distance
Pheromone = [low, medium, high]

pheromone
low
medium
0.5
high
Fig3. Input membership functions distance.
Page 119


ISSN: 2250-1797
In the next step obtain optimal path. The optimal path is a path with high pheromone and low
distance.
we define optimize the output variable as a fifth-grade quality with quantity worst = 0.01, bad =
0.25, medium = 0.5, good = 0.75 , Best=1.
Fig4 .Optimal node Output membership functions
Design of fuzzy rule base:
At this stage we design a table with number of rows and columns that the columns indicate the
distance and the rows indicate the pheromone. With output functions we complete the fuzzy rulebase table.
Table1: Design of fuzzy rule base
Distans| phermon
Near
medium
Far
Near
Medium
Good
Best
Medium
Bad
Medium
Good
Far
Worst
Bad
Medium
In the next step by attention to the optimality output we write numeric values of each cell. and
With use non-construction fuzzy we find Optimality node.
y l
l
l 1
k
goodness
ij
(3)
l
l 1
How with use, the optimality node, compute would Probability Selection nodes.
Page 120

b k
pi. j k i, j
b k i, j

ISSN: 2250-1797
(4)
After calculating the probability of selecting nodes optimality is obtained from the formula
4.You must fill out the fuzzy rule base Different values for each row and column of the table.
Algorithm1:
Fomally The ACO_fazzalgoritm is:
1. Initialize:
Set n=node
{n is number node }
Set m=node
{m is number
Set
{mn is the cycle counter}
mn=0
ant }
1. For every edge(i,j)

Set an initial value pheromone ij=c
2. For every edge (i,j)&pheromone (i,j)
Amount fuzzy creating. Formula (6)
End.
3. Design fuzzy rule base
Set worst:=%1 ,set bad:= 0.25 , set medium:= 0.5
Set good:= 0.75 , set best :=1
4. For f=1: node
Finding(goodnessijk ) an optimal node
5. For h =1:node
Probabilitypijkgiven by equation (7)
6. For x=1 : node
Construction tree
7. For t=1:n
update pheromone with ij
End.
When (nm <mnmax)
repeat step 3:6
Print shortest tour
End Algoritm.
Page 121


ISSN: 2250-1797
This algorithm is controlling by the master node (S), and the master nodes task is triggering other
network nodes. Triggering means make fuzzy input, distance and pheromone Parameters. And
construction the solutions based on the nodes optimality and probability of the selection and
update the pheromone trails selection. The fuzzy-ACO algorithm keeps one part of the solution
inside, And it continues Construction of the tree Solution components include links and the
amount of pheromone paths If the node use in the next iteration And the previous amount of e
from that node will participate in the algorithm.
3.1 - build tree
At this point, we present a method to build the tree. It is performed by each node
Algorithm2.
Initially, the solution at each node in the array with a key principal id-node state [id-node] is
stored, the state array sensor nodes is a place to store the values in the array is null.
Each node of the tree with a message to the other nodes requesting that the other neighboring
nodes. The key to making the application available to all nodes in the tree Shows. The nodes can
be requested by sending a message to the node ID of accepting. Location of the next node
obtains with pijk. Select the most probable position of the index and the taboo list until the list is
going to be a taboo.
The most important issues in the fuzzy algorithm ACO pheromone update pheromone values
node algorithm keeps himself updated in and the next iteration of the ant pheromone path to
select the previous value in the new update will affect .Each node in the task of choosing a
transport solution, ie, no des do not have any knowledge about the construction of spanning tree.
Algoritm 2:
Input: the number of to constructed each iteration (mn)
Mn=0
While (mn< max(mn)) do
For j =1 :mn
j
Fa = trigger solution construction fuzzy ()

End
For h=1:mn
h
= trigger soluation construction goodness node ()
Page 122


ISSN: 2250-1797
End
For update pheromone
Mn=mn+1 end
b
While output:
3.2- Update pheromone

After each iteration we must update pheromone table by using this formula:
Our fuzz-ACO algorithm may three different solution for updating the pheromone values (i) the
minimum iteration Tib, (ii) the restart best solution and Trb (iii) the best so far solution Tbs.
Their influence depends on the convergence factor cf, which provides an estimate about the state
of convergence of the system.
(7) kib. (Tib, e) krb. (Trb, e) kbs. (Tbs , e)
wherekib is the weight of Tib , krb the weight of Trb , and kbs such that kib + krb + kbs = 1.0 the function
Local search: r-shrink

The Local search procedure r-shrink was originally developed by Das et al. (2003) for the MEB
problem in case of Omni-directional antennas. a given solution Tj (tree). Given a broadcast tree
T=(VT,ET) with source node s and a parameter r, r <= |VT|-2 as input the original r-shrink works
as follows. Each node i VT with k > = r children is considered. K is number children nodes.
First, the children of i are ordered in decreasing distance from i say { j1. Jk } where j1 is the
child with the greatest distance from i. Then the first r children (that is, the r most distance
children) are disconnected from i, and the algorithm tries to reconnect then to any of their nondescendants in the best way possible, that is, in a way that is least energy consuming.
Fig. 3 before the 1-shrink operation[]
Page 123


ISSN: 2250-1797
Fig .4 after the 1-shrink operation[]
5Results
Table 2 is the results if the algorithm is the amounts of from one in each link and is the
distance between two links and after select a link the tree will grow (develop) until the nodes
completed.
And after we obtain the tree, this process is end, its mean expense of the first reputations and in
the next reputations we have a tree that the expense of these reputations will study with previous
reputations.
If the amount of their reputations is much better than others or (other reputations), the amounts
of will be true, but on the contrary will be false and step by step are the changeable amount of
better solution, best reputations and better new solution, then we` can update amounts of the
paths Pheromone and we obtain that from this formula.
Kib is the best repetition weight Krb is the best new solution Kbs is the best solution weight .
P is the coefficient of evaporation that we consider it as p=0/15. We obtain the agent of
convergence from this formula. Table2: Results from 30 experiments
Table 2: Result for 30 example test minimum energy broadcast in sensor networks with BIP,ACO, Fuzz-ACO
Node
P1
P2
P3
P4
P5
P6
P7
P8
P9
10
Results for the 10 instances with algorithm ACO

Minimum ACO
Minimum Fuzzy-ACO
Minimum BIP
582.194
6.7025
480.2374
591.1046
6.3231
458.9901
588.988
7.6854
429.112
581.1314
5.6022
433.515
586.169
5.9388
432.8655
557.4988
5.1716
450.3971
379.6728
6.3702
342.1886
354.8532
6.8323
331.767
348.6197
5.815
325.3778
582.194
6.7025
480.2374
Page 124


ISSN: 2250-1797
700
600
500
400
BIP
300
fuzz
200
ACO
100
0
0p
1p
2p
3p
4p
5p
6p
7p
8p
Fig 7.fazz-ACO
CONCLUSION
In this paper (part) we deal with the minimum power broadcasting with realistic antenna
(MEBRA) that this problem has been studied by two participants in the past. 1. Greedy
function BIP, BIP+ 2.Centralized ACO algorithm 3. Centralized ant colony Fuzzy- ACO
algorithm use greedy information to construct solution, more ever (in addition) the source of
the node is inside itself. Information about constructed solutions and update of the pheromone
on the source node, in turn, leads to measures (actions) such as construction of the solutions
and update the pheromones value.
According to our results the Fuzzy ACO algorithm is generally much better than the classic
centralized algorithm and classical heuristic (BIP) algorithm. This is makeable achievement
because the distributed version of BIP is significantly worse than concentrated version of BIP.
When sensor node's with multiple level of power transmission is considered, the results of the
fuzzy ACO algorithm that this charge able process is growing with increase the power level.
REFERENCE
[1] Hernndez H., Blum C., Distributed ant colony optimization for minimum energy
broadcasting in sensor networks with realistic antennas, Swarm Intelligence, 2012
Page 125


ISSN: 2250-1797
[2] Akyildiz I.F., Sankarasubramaniam, Cayirci W. Su, Y., E., A survey on sensor networks,
IEEE Communications Magazine 40 (8) (2002) 102114.
[3] Hernndez H., Blum C., Minimum energy broadcasting in wireless sensor networks: an ant
colony optimization approach for a realistic antenna model, Applied Soft Computing 11 (8)
(2011) 56845694.
[4] Guo S., Yang O., Energy-aware multicasting in wireless ad hoc networks: a survey and
discussion, Computer Communications 30 (2007) 21292148.
[5] Hernndez H., Blum C., Francs G., Ant colony optimization for energy-efficient
broadcasting in ad-hoc network, in: Proceedings of ANTS 2008SixthInternational Conference
on Ant Colony Optimization and Swarm Intelligence, in: Lecture Notes in Computer Science,
vol. 5217, Springer Verlag,Berlin, Germany, 2008, pp. 2536.
[6] Hernndez H., Blum C., Ant colony optimization for multicasting in static wireless ad-hoc
networks, Swarm Intelligence 3 (2) (2009) 125148.
[7] Das A.K., Marks R.J., El-Sharkawi M., Arabshahi P., Gray A., r-shrink: a heuristic for
improving minimum power broadcast trees in wireless networks, in: IEEE GLOBECOM 2003
Proceedings of the Global Communications Conference, IEEE Press, 2003, pp. 523527.
[8] Nikolaidis F. Li I., On minimum-energy broadcasting in all-wireless networks, in:
Proceedings of the IEEE Conference on Local Computer Networks, IEEE Press, Piscataway, NJ,
2001, pp. 1416.
[9] Guo S., Yang O., A dynamic multicast tree reconstruction algorithm for minimum-energy
multicasting in wireless ad hoc networks, in: Proceedingsof IPCCC 2004IEEE International
Conference on Performance, Computing, and Communications, IEEE Press, Piscataway, NJ,
2004, pp. 637642.
[10] Das A.K., Marks R.J., El-Sharkawi M., Arabshahi P., Gray A., The minimum power
broadcast problem in wireless networks: an ant colony systemapproach, in: Proceedings of the
IEEE CAS Workshop on Wireless Communications and Networking, IEEE Press, Piscataway,
NJ, 2002.
Page 126


ISSN: 2250-1797
[11] Kang I., Poovendran R., Iterated local optimization for minimum energy broadcast, in:
Proceedings of WiOpt 2005Third International Symposiumon Modeling and Optimization in
Mobile, Ad Hoc, and Wireless Networks, IEEE Press, Piscataway, NJ, 2005, pp. 332341.
[12] Al-Shihabi S., Merz P., Wolf S., Nested partitioning for the minimum energy broadcast, in:
V. Maniezzo, R. Battiti, J. Watson (Eds.), LION 2007Proceedings of the Workshop on
Learning and Intelligent Optimization, in: Lecture Notes in Computer Science, vol. 5313,
Springer Verlag, Berlin,Germany, 2007, pp. 111.
[13] Wolf S., Merz P., Evolutionary local search for the minimum energy broadcast problem, in:
C. Cotta, J. van Hemert (Eds.), VOCOP 2008 Proceedings ofthe 8th European Conference on
Evolutionary Computation in Combinatorial Optimization, in: Lecture Notes in Computer
Science, vol. 4972, SpringerVerlag, Berlin, 2008, pp. 6172.
[14] Wieselthier J.E., G.D. Nguyen, A. Ephremides, On the construction of energy-efficient
broadcast and multicast trees in wireless networks, in:Proceedings of INFOCOM 200019th
Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, 2000, pp.
585594.
[15] Wieselthier J.E., Nguyen G.D., Ephremides A., Energy-efficient broadcast and multicast
trees in wireless networks, Mobile Networks and Applications7 (6) (2002) 481492.
[16] Qayyum A., Viennot L., Laouiti A., Multipoint relaying for flooding broadcast message in
mobile wireless networks, in: HICSS 2002Proceedings of the 35th Annual Hawaii
International Conference on System Sciences, IEEE Press, 2002, pp. 38663875.
[17] Lim H., Kim C., Multicast tree construction and flooding in wireless ad hoc networks, in:
MSWIM 2000Proceedings of the 3rd ACM International Workshop on Modeling, Analysis
and Simulation of Wireless and Mobile Systems, ACM Press, 2000, pp. 6168.
[18] Wieselthier J.E., Nguyen G.D., Ephremides A., Energy-aware wireless networking with
directional antennas: the case of session-based broadcasting
[19] Wieselthier J.E., Nguyen G.D., Ephremides A., The energy efficiency of distributed
algorithms for broadcasting in ad hoc networks, in: G.L. Stber, et al.(Eds.), WPMC 2002Proceedings of the 5th International Symposium on Wireless Personal Multimedia
communications, vol. 2, IEEE Press, 2002,pp. 499503.
Page 127


ISSN: 2250-1797
[20] Vellambi B.N., Rahnavard N., F. Fekri, FTS: a distributed energy-efficient broadcasting
scheme using foutain codes for multihop wireless networks,IEEE Transactions on
Communications 58 (12) (2010) 35613572.
[21] Chen L.-S., Chen J.-H., Wang H.-C., An optimum branching-based efficient distributed
broadcast scheme for wireless ad hoc networks, in: AH-ICI2009Proceedings of First Asian
Himalayas International Conference on Internet, IEEE Press, 2009, pp. 16.
[22] Cagalj M., Hubaux J.P., Enz C., Minimum-energy broadcast in all-wireless networks: NPcompleteness and distribution issues, in: ACM MobiCom 2002Proccedings of The Annual
International Conference on Mobile Computing and Networking, ACM Press, 2002, pp. 172
182.
[23] Hernndez H., Blum C., Ant colony optimization for broadcasting in sensor networks under
a realistic antenna model, in: B. Filipic, J. Silc (Eds.), BIOMA2010Proceedings of the 4th
International Conference on Bio-Inspired Optimization Methods and their Applications, Jozef
Stefan Institute, Ljubljana,Slovenia, 2010, pp. 153162.
[24] Blum C., Dorigo M., The hyper-cube framework for ant colony optimization, IEEE
Transactions on Systems, Man, and Cybernetics, Part B 34 (2) (2004)11611172.
[25] Deneubourget. Ant al 1990; Grass 1959
[26] Motamednejad k, Tehran, 1385, Available from media: http://sajadahoosh.blogfa.com/Post/3, pp: 277 278
Page 128

Optimizing Energy Consumption in Sensor Networks Using Ant Colony Algorithm and Fuzzy System

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Optimizing Energy Consumption in Sensor Networks Using Ant Colony Algorithm and Fuzzy System

Uploaded by

Copyright:

Available Formats

International Journal of Computer Application

Available online on http://www.rspublication.com/ijca/ijca_index.htm

Issue 4, Volume 1 (February 2014)