Content deleted Content added
m Format. |
|||
Line 2:
==Protocol ==
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a [[stochastic]] algorithm at each round to determine whether it will become a cluster head in this round. LEACH assumes that each node has a radio powerful enough to directly reach the base station or the nearest cluster head, but that using this radio at full power all the time would waste energy. what
Nodes that have been cluster heads cannot become cluster heads again for ''P'' rounds, where ''P'' is the desired percentage of cluster heads. Thereafter, each node has a 1/''P'' probability of becoming a cluster head again. At the end of each round, each node that is not a cluster head selects the closest cluster head and joins that cluster. The cluster head then creates a schedule for each node in its cluster to transmit its data.
| |||