Initialization
{
Find average energy of n nodes
Find the distance of each node
Calculate whether node is eligible as Cluster Head (ch node)
Select x nodes where x < n as the candidate of Cluster Head
43
}
Find m as total chromosome, where m=x nodes/desired p cluster
Populate m Chromosome
For i=0, i<m, i++
{
Randomly choose nodes from x nodes
If y < p
Add nodes to chromosome C at y
else
y=0
}
For each p chromsome
{
Do
{
For each Chromosome k where k<=p
{
Find the Chromosome Fitness
Find the Chromosome probability
}
Find average probability
Find best Chromosome as Parent 1
Do Roulette
{
Determine r where 0 < r < 1
If probability Chromosome i > r
Select Chromosome ith as second parent
Break roulette
Else
Continue Roulette
}
44
Do Crossover parent 1 and parent 2
Crossover result as Children 1 and Children 2
Mutation between least Probability Chromosome with Children
} Until iteration=k
Select the best chromosome as a group of Cluster Head (CH0,CH1,CH3,…,CHn)
Determine Cluster Head for each nodes, where d(CHi)<< from each nodes
Inform to all nodes about their Cluster head

        void    format_imep(Packet *p, int offset);
        void    format_aodv(Packet *p, int offset);
	void    format_aomdv(Packet *p, int offset);
#ifdef MIT_uAMPS
	void    format_rca(Packet *p, int offset);
#endif

	// This holds all the tracers added at run-time
	static PacketTracer *pktTrc_;

};