1 / 19

Adaptive Energy-Efficient Clustering in Sensor Networks: LEACH Algorithm

LEACH algorithm provides low-energy, adaptive clustering in sensor networks. It features self-configuring clusters and localized data control, reducing energy consumption and improving data transfer efficiency. This dynamic cluster formation algorithm ensures a steady state, mitigating inter-cluster interference and drawbacks of deterministic cluster-head selection. The algorithm's decision formula optimizes energy usage while facilitating distributed clustering in ad-hoc sensor networks.

susiem
Download Presentation

Adaptive Energy-Efficient Clustering in Sensor Networks: LEACH Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Low Energy Adaptive Clustering Hierarchy (LEACH) Taekyoung kwon

  2. LEACH • Adaptive, self-configuring • Localized control of data transfer • Low-energy medium access • Application-specific data access

  3. Dynamic clusters

  4. Distributed cluster formation algorithm

  5. Distributed cluster formation

  6. N: number of total nodes • k: number of clusters • r: current round • P = k/N

  7. On each round, we want N*P cluster heads N N P

  8. LEACH: steady state

  9. Inter-cluster interference

  10. LEACH media access

  11. LEACH with deterministic cluster-head selection

  12. LEACH drawbacks

  13. LEACH drawbacks

  14. decision formula with energy

  15. Final decision formula • rs: # of consecutive rounds in which a node is not cluster-head

  16. Distributed Clustering in Ad-hoc Sensor Networks-A Hybrid, Energy-Efficient Approach

  17. Ideally • N_iter : every step takes t_c time • C_prob : # of cluster heads / # of total nodes

  18. realistically • Initialize step • P_min is inversely proportional to N_iter • Repetition step • Announce cluster_head msg with cost

More Related