Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Protocol  





2 Properties  





3 Shortcomings of LEACH[2]  





4 References  














Low-energy adaptive clustering hierarchy






Italiano
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Low-energy adaptive clustering hierarchy ("LEACH")[1] is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (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

[edit]

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 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.

All nodes that are not cluster heads only communicate with the cluster head in a 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.

LEACH also uses CDMA so that each cluster uses a different set of CDMA codes, to minimize interference between clusters.

Properties

[edit]

Properties of this algorithm include:

Shortcomings of LEACH[2]

[edit]

Shortcomings of LEACH include:

References

[edit]
  1. ^ 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. Paper
  • ^ Varshney, Shweta; Kuma, Rakesh (2018). "Variants of LEACH Routing Protocol in WSN: A Comparative Analysis". 2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence). IEEE. pp. 199–204. doi:10.1109/confluence.2018.8442643. ISBN 9781538617199. S2CID 52125657.
  • ^ Roy, Nihar Ranjan; Chandra, Pravin (2018). "A Note on Optimum Cluster Estimation in LEACH Protocol". IEEE Access. 6: 65690–65696. doi:10.1109/ACCESS.2018.2877704. ISSN 2169-3536. S2CID 53779139.

  • Retrieved from "https://en.wikipedia.org/w/index.php?title=Low-energy_adaptive_clustering_hierarchy&oldid=1166881828"

    Categories: 
    Wireless sensor network
    Cluster analysis algorithms
     



    This page was last edited on 24 July 2023, at 09:54 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki