Leach algorithm

The algorithm for the Low Energy Adaptive Clustering Hierarchy (LEACH) implemented is:

Setup phase :

1. CN=> r

2. If r > T(n) then, CH = CN else, goto step1

3. CH => G : id(CH) , join adv

4. A(i) -> CH(j) : id(A(i)) , id(CH(j)) , join req

5. CH(j)-> A(i) : id(CH(j)) , < t(i) , id(A(i)) >

Steady phase :

1. A(i) -> CH(j) : id(A(i)) , id(CH(j)) , info

2. CH -> BS : id(CH) , id(BS) , aggr info

The various symbols used here are :

CN : candidate node to become the cluster head.

r : randomvariable(0 > r > 1)

T(n) : threshold value

CH : cluster head

G : all nodes in the network

id : identi_cation number

join adv : advertisement to join the cluster

A : normal node

Join adv : request to join the cluster

t : time-slot to send the sensed data

=> : broadcast

->: unicast