Study On Energy Efficient Centralized Routing Protocol For Wireless Sensor Networks Based On Leach C

1,787 views
1,680 views

Published on

Proposing the best cluster head selection technique so that life of each node may increase.

Published in: Technology, Business
0 Comments
5 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
1,787
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
0
Comments
0
Likes
5
Embeds 0
No embeds

No notes for slide

Study On Energy Efficient Centralized Routing Protocol For Wireless Sensor Networks Based On Leach C

  1. 1. Study OnEnergy Efficient Centralized Routing Protocol For Wireless Sensor Networks Based on LEACH-C<br />Supervised By<br />TanayDey, <br />Lecturer, Dept. of CSE,<br />KUET,<br />Bangladesh.<br />Presented By<br />Bijan Kumar Debroy(0507008)<br />Md. Al-Imran(0507011)<br />Dept. of CSE,<br />KUET, Bangladesh.<br />
  2. 2. Introduction<br />Consists of hundreds or thousands of nodes<br />Sense data, gather data and send to base station(BS)<br />Various protocols are used. Such as-<br />Direct Communication<br />MTE<br />LEACH: self elected cluster head<br />LEACH-C: base station choose the cluster head<br />BCDCP<br />
  3. 3. Application<br />3<br />
  4. 4. Routing Protocols <br />Clustering protocols include-<br />LEACH, LEACH-C etc.<br />4<br />WSNs Protocols based on<br />
  5. 5. Motive of Clustering<br />5<br />Figure: Clustered Network<br />
  6. 6. Problem Statement<br />It consumes more energy<br />MTE considers only energy of transmitter, neglects receiver<br />In LEACH, energy consumption increases due to not equally divided<br />In LEACH-C, extra GPS system is needed<br />
  7. 7. Dynamic Clustering<br />7<br />(b)Clusters at time t + d<br />(a)Clusters at time t<br />Figure: Dynamic Clustering Schema<br />
  8. 8. Proposed Protocol Overview<br />8<br />Setup Phase<br />
  9. 9. Solution<br />Our approach<br />Use modified parallel simulated annealing algorithm<br />Make best solution from initial random solutions<br />Distribute best solution<br />For each solution make best solution using SA<br />Exchange parameter<br />store best solution<br />Detect convergence<br />
  10. 10. Primary Simulation<br />Package required for simulation<br />cygwin or redhat-Linux<br />ns-allinone-2.27.tar.gz or ns-allinone-2.32.tar.gz<br />mit.tar.gz<br />10<br />
  11. 11. Simulation Result<br />Figure : Time vs Node Alive<br />
  12. 12. Future work based on<br />12<br />
  13. 13. Conclusion<br />Maximizing lifetime<br />Minimizing energy dissipation<br />Further try to get better performance<br />13<br />

×