Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 77 views

    LEACH Protocol: For Wireless Sensor Networks

    Uploaded by

    Akshay Shinde
    The LEACH protocol is a dynamic clustering algorithm for wireless sensor networks that aims to lower energy consumption by randomly selecting cluster heads to receive and aggregate data from nodes in the network. It operates in two phases - a set-up phase where clusters are formed and a steady-state phase where data is sent to the base station. Nodes have a threshold-based probability of becoming a cluster head to evenly distribute this energy-heavy role over time. Variations like LEACH-C use a deterministic threshold to improve network lifetime.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    LEACH Protocol: For Wireless Sensor Networks

    Uploaded by

    Akshay Shinde
    77 views13 pages
    The LEACH protocol is a dynamic clustering algorithm for wireless sensor networks that aims to lower energy consumption by randomly selecting cluster heads to receive and aggregate data from nodes in the network. It operates in two phases - a set-up phase where clusters are formed and a steady-state phase where data is sent to the base station. Nodes have a threshold-based probability of becoming a cluster head to evenly distribute this energy-heavy role over time. Variations like LEACH-C use a deterministic threshold to improve network lifetime.

    Original Description:

    Information of LEACH Protocol

    Original Title

    L26 LEACH

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The LEACH protocol is a dynamic clustering algorithm for wireless sensor networks that aims to lower energy consumption by randomly selecting cluster heads to receive and aggregate data from nodes in the network. It operates in two phases - a set-up phase where clusters are formed and a steady-state phase where data is sent to the base station. Nodes have a threshold-based probability of becoming a cluster head to evenly distribute this energy-heavy role over time. Variations like LEACH-C use a deterministic threshold to improve network lifetime.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    77 views13 pages

    LEACH Protocol: For Wireless Sensor Networks

    Uploaded by

    Akshay Shinde
    The LEACH protocol is a dynamic clustering algorithm for wireless sensor networks that aims to lower energy consumption by randomly selecting cluster heads to receive and aggregate data from nodes in the network. It operates in two phases - a set-up phase where clusters are formed and a steady-state phase where data is sent to the base station. Nodes have a threshold-based probability of becoming a cluster head to evenly distribute this energy-heavy role over time. Variations like LEACH-C use a deterministic threshold to improve network lifetime.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 13

    LEACH Protocol

    for Wireless Sensor Networks


    An Introduction…
    • LEACH stands for Low-Energy Adaptive
    Clustering Hierarchy
    • This WSN is considered to be a dynamic
    clustering method
    • LEACH has two phases
    The Problem
    • The reason we need network protocol such as
    LEACH is due to the fact that a node in the
    network is no longer useful when its battery
    dies
    • This protocol allows us to space out the
    lifespan of the nodes, allowing it to do only
    the minimum work it needs to transmit data
    The Cluster-Head
    • The LEACH Network is made up of nodes,
    some of which are called cluster-heads
    – The job of the cluster-head is to collect data from
    their surrounding nodes and pass it on to the base
    station
    – LEACH is dynamic because the job of cluster-head
    rotates
    Direct v. Minimum Transmission
    • The amount of energy
    used in figure (a) can be
    modeled by this
    formula:
    – ampk(3d1 + d2)2

    • Whereas the amount of


    energy used in figure (b)
    uses this formula:
    – ampk(3d12 + d22)
    The Amount of Energy Depletion
    • This is the formula for the amount of energy
    depletion by data transfer:
    LEACH’s Two Phases
    • The LEACH network has two phases: the set-
    up phase and the steady-state

    – The Set-Up Phase


    • Where cluster-heads are chosen
    – The Steady-State
    • The cluster-head is maintained
    • When data is transmitted between nodes
    Stochastic Threshold Algorithm
     Cluster-heads can be chosen stochastically
    (randomly based) on this algorithm:

     If n < T(n), then that node becomes a cluster-


    head
     The algorithm is designed so that each node
    becomes a cluster-head at least once
    Deterministic Threshold Algorithm
    • A modified version of this protocol is known
    as LEACH-C (or LEACH Centralized)
    • This version has a deterministic threshold
    algorithm, which takes into account the
    amount of energy in the node…
    Deterministic Threshold Algorithm
    • …and/or whether or not the node was
    recently a cluster-head
    What’s the Difference?
    • REMEMBER: The goal of these protocol is to
    increase the life of the network

    • The changes between the LEACH stochastic


    algorithm and the LEACH-C deterministic
    algorithm alone is proven to increase the FND
    (First Node Dies) lifetime by 30% and the HND
    (Half Node Dies) lifetime by 20%
    An Example of a LEACH Network
    • While neither of these
    diagrams is the
    optimum scenario, the
    second is better
    because the cluster-
    heads are spaced out
    and the network is
    more properly
    sectioned
    Bibliography
     “Low Energy Adaptive Clustering Hierarchy with
    Deterministic Cluster-Head Selection”; M.J.
    Handy, M. Haas, D. Timmermann; 2002;
    http://www.vs.inf.ethz.ch/publ/se/IEEE_MWCN
    2002.pdf
     “Probabilistic Modeling of Leach Protocol and
    Computing Sensor Energy Consumption Rate in
    Sensor Networks”; Song, Dezhen; February 22,
    2005;
    http://www.cs.tamu.edu/academics/tr/tamu-cs-
    tr-2005-2-2

    You might also like