Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173 Title Analysis of Energy Efficient Hierarchical Routing Protocols in Wireless Sensor Network Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173 Supervisor: Dr. Nadeem Javaid
Motivation Evolving technology Wide range of application Environmental monitoring Battlefield awareness Temperature sensing Need of Increasing network lifetime Need of Improvement of routing protocol
Objective Analyse and compares hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH) Centralized LEACH (LEACH-C) Solar-aware LEACH (sLEACH) Multi-hop LEACH (Multi-hopLEACH) Mobile LEACH (M-LEACH) Selective Clustering LEACH (LEACH-SC)
Wireless Sensor Network We are taking forest as a sensor field (objective area) Sensor nodes are deployed for fire detection
Sensor Node Small battery powered, wireless devices Sensing capabilities (Sensor) On-board processing (Micro-controller) Communication (Transceiver)
Design Principle of WSN Homogeneous Environment Heterogeneous Environment Hybrid Environment
Hierarchical Routing Whole network has multiple clusters Each Cluster has CH CH communicate to BS
Single Hop Routing
Multi Hop Routing
Setup Phase of Routing Nodes participate in CH (Cluster Head) election Elected CH Receive CH advertisement Broadcast CH advertisement No Yes Send Association Request to selected CH Wait and listen medium till its selection Selected CH Receive Association Request from nodes Yes No By Comparing RSSI and Link Quality Assign TDMA slots to member nodes for communication Receive TDMA slots for communication
Steady State Phase of Routing Cluster Heads Normal Nodes Receive data from member nodes Send data to CH at allocated time slot CH aggregate data received from nodes Send aggregated data to BS Base Station (BS)
Example of Hierarchical Routing Network size is 200m * 200m in Co-Ordinate plane Nodes are randomly deployed BS is located at point (100,250) Distance (meter) Distance (meter)
Example of Hierarchical Routing Nodes are self organizing Clusters and CHs are formed Member nodes send data to CHs CH aggregate data and send to BS 1st Round
Example of Hierarchical Routing 2nd Round
Example of Hierarchical Routing 3rd Round
Example of Hierarchical Routing 4th Round
Example of Hierarchical Routing 5th Round
Example of Hierarchical Routing 6th Round
Example of Hierarchical Routing 7th Round
Example of Hierarchical Routing 8th Round
Example of Hierarchical Routing 9th Round
Example of Hierarchical Routing 10th Round
Hierarchical Routing Protocols LEACH LEACH-Centralized sLEACH-Centralized sLEACH-Distributed M-LEACH Multi-hopLEACH LEACH-SC Classification Hierarchical Self Organization yes Scalability Limited Good Very Good Distributed yes no
Hierarchical Routing Protocols LEACH LEACH-Centralized sLEACH-Centralized sLEACH-Distributed M-LEACH Multi-hopLEACH LEACH-SC Centralized no yes Hop count Single Multi Energy Efficiency High Very High Resources Awareness Good Very Good
Hierarchical Routing Protocols LEACH LEACH-Centralized sLEACH-Centralized sLEACH-Distributed M-LEACH Multi-hopLEACH LEACH-SC Data Aggregation Yes Homogeneous Yes Randomized rotation Yes Mobility Fixed BS Mobile nodes and BS
Simulation Parameters Value Network Size 200m * 200m Initial Energy 0.5 J Probability of becoming CH 0.1 Data Aggregation Energy cost 50 pJ/bit Number of nodes 100 Packet Size 200 bit EelectTx 50 nJ/bit EelecRx
Simulation(1)
Simulation(2)
Simulation(3)
Simulation(4)
Simulation(5)
Conclusion sLEACH is providing maximum energy and quality efficiency
Thanks
Applications of WSNs Home Applications Military Applications To open the door To switch on the light or TV To avoid theft cases Military Applications Battle Field Surveillance Monitoring friendly forces
Applications of WSNs Environmental Applications Health Applications To check air pollution Fire detection Health Applications Monitor Patient Psychological data Monitor doctors and patients inside hospital
LEACH
LEACH-C
Sleach Centralized
Sleach-distributed
Multihop LEACH
M-LEACH
LEACH-SC