Content deleted Content added
Amending reference |
Added correct paper citation and removed two references to another (different) protocol |
||
Line 1:
'''Low Energy Adaptive Clustering Hierarchy ("LEACH")'''<ref>Heinzelman, W., Chandrakasan, A., and Balakrishnan, H., "Energy-Efficient Communication Protocols for Wireless Microsensor Networks", Proceedings of the 33rd Hawaaian International Conference on Systems Science (HICSS), January 2000. [http://pdos.csail.mit.edu/decouto/papers/heinzelman00.pdf Paper]</ref> is a [[Time division multiple access|TDMA]]-based [[Media access control|MAC]] protocol which is integrated with clustering and a simple routing protocol in [[wireless sensor network]]s (WSNs). The goal of LEACH is to lower the energy consumption required to create and maintain clusters in order to improve the life time of a wireless sensor network
==Protocol explanation==
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 in each 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.
Line 26:
# [[NetSim]] (proprietary software)
# [[OMNeT++]] (IDE)
== References ==
{{reflist}}
[[Category:Wireless sensor network]]
[[Category:Stochastic algorithms]]
| |||