| |



  

  
 
 
 

 





 
 

! 
"##
 þ


Ä Introduction & Background

Ä Proposed Genetic Algorithm (GA)
Solution
Ä Experiment Setup and Results
Ä Demonstration of Application
Ä Conclusion & Future Work
 0



  
Ä Sensor Networks
 Popular, wide range of applications
Ä Military, environment, health

 Small, lightweight, battery powered wireless

nodes distributed over large area
 large communication distance from nodes to base
station drain energy & reduce network life
Ä Our goal
 Use GA to cluster sensor network to minimize the
total communication distance and prolong the
network life.
| 

 





 

Y



 
  






Ä Partitioning nodes into independent

clusters
Ä Various methods for clustering
 Ex. K±means, Fuzzy c-means clustering
Ä Drawback
 Assume the number of clusters beforehand
Ä Our contribution
 Dynamic Sensor Network
 ^
 

  

* One of the major areas in Evolutionary Computation
(EC)

* EC consists of machine learning optimization and

classification paradigms based on genetics and
natural selection

* GA mimics survival of the fittest strategy in nature by

preferentially selecting a fitter genetic pool so that
future generation will have fitter population members

  
* Population: set of points in problem domain, each
member being a potential solution.
o Generated randomly
* Fitness: A value proportional to the function we
want to optimize
o Fitness value and fitness function
* Selection: selecting a pool of high fitness
population members
* GA Operators: mimic reproduction
o Crossover: pass information from one generation to next
to guide population to acceptable solution
o Mutation: introduce diversity to tunnel through local
optima

  
* Ahe series of operations carried out when
implementing a canonical GA paradigm are:
1. Initialize the population (randomly),
2. Calculate fitness for each individual in the
population,
3. Reproduce selected individuals to form a new
population,
4. Perform crossover and mutation on the
population and
5. Loop to step 2 until some condition is met.
 „
  
„   

  # $ " % &   ' ( 

) $ # $ # # # # # # $

 
*    *    * 

* Represent the population member in a binary format

* Each bit represents a node
* A normal node is represented by a 0 at the specific bit
location
* If the node is a cluster head then we have a 1 at the
corresponding bit position
* Nodes N0, N2 and N9 are the cluster heads
* Nodes N1, N3 ± N8 are the normal nodes.
 è  è
   
 
* Ao transmit a k-bit message across a distance of
d, the energy consumed can be represented
E(k,d)=Eelec* k + Eamp * k * d2
Where:
* Eelec is the radio energy dissipation
* Eamp is a transmit amplifier energy dissipation
* Ao receive a k-bit message, the energy consumed
is as follows:
* ERx(k) = Eelec * k
 þ è  è
 
F=w*(D-distancei)+(1-w)*(N-Hi)+Į*Battery_State

Where:
o w is the biasing factor;
o D is the total distance of all nodes to the sink;
o Distancei is the sum of the distance from regular
nodes to cluster heads plus the sum of the
distances fro all cluster heads to the sink;
o Hi is the number of cluster heads;
o N is the total number of nodes;
o Į is weighting factor for Battery_State;
o Battery_State is a measure of current battery life;

   

 
Roulette Wheel Selection

†










 þ  
o One-Point Crossover

) +
 ,
- $, $ $ $ # # $ # $
- ", $ # $ $ $ $ $ #

 
 
+ 
 ,
$, $ $ $ # $ $ $ #
", $ # $ $ # $ # $

 þ   

) +
. ,
- , $ $ $ $ $ $ # $

+ 
. ,
- , $ $ $ # $ $ $ $
|     


  


  ! è 
|     
* Simulation Aest Bed
o C# and .Net 1.0 Framework
 |     
* Description of Experiment
o 5 random deployment scenarios using the
simulation test bed
o 100 sensor nodes and data collector
o performed clustering using GA and analyzed the
results against the criteria listed below
* Performance of GA to maximize distance savings
* Performance of GA to minimize number of cluster heads
* Performance of GA to minimize energy dissipation in
overall network

* Performance of GA to maximize distance savings
º
 
  

†

†

†



º


†

  

†

†

†

††


†  †    
  †    
 

""
* Performance of GA to minimize number of cluster heads

i



  

 
 

ð

i



  

ð

ð
 



ð

ð


    ð   
   
 
 
 ""
* Performance of GA to minimize energy dissipation in overall network
First Random Walk
|

 






|

ð 

 

ð 

 

ð 

ð

ð
        





|  
""
Second Random Walk
i


 
 

 



i





 
ð  

 
ð 
 
!"#"

ð 

ð

ð
   ð   



    ð 

 
""
Ahird Random Walk
i
 

 
 




i


ð 

 

ð 

 

ð 

ð

ð
   ð   



 

 
#
* Summary

 

R
 
 

 



     
  

     
  

     
  


  

  ! è 
* Our application provides a GA based
method to reduce the communication
distance in sensor networks via clustering.

* We have shown successfully that our

algorithm performs better to the order of
2 in almost 99% of the cases.

  ! è 
* Extending the simulation test bed to use other mobility
models.
* Evaluation of clustering algorithm using Linear Vector
Quantization (LVQ) and Particle Swarm Optimization (PSO)
and comparison with GA
* Ahe fitness function can be based on a lot of other
optimization parameters namely battery charge and
discharge of the nodes.
* routing protocol for the setup, steady state and tear down
phase for the sensor networks with cluster head authorization
from data collector, cluster head advertisement and fault
tolerance techniques.
| |
||
* 1] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-Efficient Communication Protocol for Wireless
Micro-sensor Networks. In Proceedings of the Hawaii International Conference on System Science, Maui, Hawaii, 2000.
* 2] Selim, S. Z. and Ismail, M. A. K-means type algorithms: A generalized convergence theorem and characterization
of local optimality. IEEE Arans. Pattern Anal. Mach. Intell. 6, 81±87, 1984.
* 3] Russell C. Eberhart and Yuhui Shi ³Computational Intelligence: Concepts to Implementations´. Indiana
* 4] J. C. Bezdek (1981): "Pattern Recognition with Fuzzy Objective Function Algoritms", Plenum Press, New York,
http://www.elet.polimi.it/upload/matteucc/Clustering/tutorial_html/cmeans.html
* 5] Aracy Camp, Jeff Boleng and Vanessa Davies: ³A Survey of Mobility Models for Ad Hoc Network Research´, Golden,
CO, 2002
* 6] Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak and Mani B. Srivastava: ³Coverage Problems in
Wireless Ad-hoc Sensor Networks´, Los Angeles, CA, 2001
* 7] F. L. LEWIS: ³Wireless Sensor Networks´, Ft. Worth, Aexas, 2004
* 8] Jason Lester Hill: ³System Architecture for Wireless Sensor Networks´, University of California, Berkeley, 2000
* 9] Silvia Nittel, Kelvin A. Leung, Amy Braverman: ³Scaling Clustering Algorithms for Massive Data Sets using Data
Streams´, Los Angeles, CA, March 2004
* 10] Xiaohui Cui, Ahomas E. Potok and Paul Palathingal: ³Document Clustering using Particle Swarm Optimization´,
Oak Ridge, AN, 2005
* 11] Wendi Heinzelman, Anantha Chandrakasan and Hari Balakrishnan: ³Energy-efficient Communication Protocols for
Wireless Microsensor Networks´, Maui, HI, January 2000
* 12] A. Bruce McDonald and Aaieb F. Znati: ³A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc
Networks´, 1999
* 13] Guolong Lin, Guevara Noubir and Rajmohan Rajaraman: ³Mobility Models for Ad Hoc Network Simulation´, Boston,
MA, 2004
* 14] Greg Badros: ³Evolving Solutions: An Introduction to Genetic Algorithms´,
http://www.duke.edu/vertices/update/win95/genalg.html, 1995