Low-energy adaptive clustering hierarchy: Difference between revisions

Revision as of 15:30, 14 September 2015

Revision as of 15:23, 13 October 2015

Line 5:

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.

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 inat the beginning of each new round. 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.

All nodes that are not cluster heads only communicate with the cluster head in a [[Time Division Multiple Access|TDMA]] fashion, according to the schedule created by the cluster head. They do so using the minimum energy needed to reach the cluster head, and only need to keep their radios on during their time slot.