The Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is a hierarchical protocol in which most simple nodes transmit to special cluster-head CH nodes. CH nodes compress data from nodes in their own cluster (neighbors) and send an aggregate packet that will be received and printed by a base station (sink). One or more peripheral base stations can be included. Compression/aggregation of messages can be simulated by collecting received messages and sending an aggregate data for every 3 received messages. The CH role should be "rotated" in turn among the nodes for the purpose of distributing the energy load among the sensors. The criterion by which a simple node becomes a CH can be based on randomness. The nodes with CH role should turn on (mark) to distinguish itself from simple nodes
Added by F-Tima M.
Step 1
Each node should have a unique identifier. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 55 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Discuss the cluster head election policy in the LEACH protocol and explain how LEACH can consider the available energy on each node in this election process. What is the problem with this energy-aware election policy? Furthermore, LEACH uses TDMA within a cluster; explain the advantages and disadvantages of this approach.
Sri K.
'It is best to use channel allocation algorithms when channel traffic is continuous and the number of stations is small and fixed. Multiple Static Collision Dynamic'
Chandra J.
Question 3 Answer the following questions in the context of shown figure of 8-point two-dimensional dataset (A to H): a) BIRCH method is run on the given dataset. Assume that at some point of time the points {A, B, C, D} are placed in one cluster. What will be the Clustering Feature and Radius of this cluster? b) DBSCAN method is run on the given dataset. Given that MinPts = 3 and ε = 2 units. Find out the Core, Border and Noise points. Manhattan distance needs to be taken as the distance measure and while counting the MinPts for a point, the point itself need to be included in the counting.
Adi S.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
100,000+
Students learning Computer Science with Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
