Wsn

4,341 views
4,194 views

Published on

Wireless Sensor Network

Published in: Technology
1 Comment
2 Likes
Statistics
Notes
  • Wireless Sensor Network
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total views
4,341
On SlideShare
0
From Embeds
0
Number of Embeds
32
Actions
Shares
0
Downloads
445
Comments
1
Likes
2
Embeds 0
No embeds

No notes for slide

Wsn

  1. 1. Wireless Sensor Network (WSN) By Nishant H. Shah Siddheshwar B. Sharma Bonee Soibam
  2. 2. <ul><li>Introduction of WSN </li></ul><ul><li>Research and Systems Implemented till date </li></ul><ul><li>System Implementation & future Developments </li></ul><ul><li>Conclusion </li></ul>
  3. 3. Introduction <ul><li>Difference between WSN & other wireless Networks </li></ul><ul><li>Key Application of WSNs </li></ul><ul><li>What is a Sensor Node ? </li></ul>
  4. 5. Sensor Node
  5. 7. Research done till Date <ul><li>Habitat Monitoring System </li></ul><ul><li>Topology Discovery algorithms </li></ul><ul><li>Data Routing Algorithms </li></ul>
  6. 8. Problems with WSN <ul><li>Energy Efficient and robust </li></ul><ul><li>No fixed topology </li></ul><ul><li>Algorithm for routing the data </li></ul>
  7. 9. Topology Discovery Algorithm <ul><li>Ad hoc networking the main principle </li></ul><ul><li>The conditions are dynamic and adaptive </li></ul><ul><li>Nodes should self organize themselves in particular topology </li></ul>
  8. 10. Several Topology Discovery Algorithms <ul><li>Ad Hoc Network Management Protocol (ANMP) </li></ul><ul><li>A Distributed Mechanism for Topology Discovery in Ad hoc Wireless Networks </li></ul><ul><li>“ TopDisc” Algorithm. </li></ul>
  9. 11. TOPDISC Algorithm <ul><li>Approximate topology is constructed using information of Neighborhood nodes </li></ul><ul><li>Only distinguished nodes which have Neighborhood information communicate with the main node </li></ul>
  10. 12. TOPDISC Algorithm <ul><li>These Clusters are arranged in Tree Structure called “TREC” </li></ul><ul><li>Theswe Clusters Give the Reachabilty Map </li></ul>
  11. 13. Localization Technique <ul><li>Need for Localization </li></ul><ul><li>As the network is adaptive it would be fair enough for us to address the nodes dynamically </li></ul><ul><li>It can done Using DHCP protocol for addressing </li></ul>
  12. 14. DHCP Addressing <ul><li>Each node would get its own IP.V4 address </li></ul><ul><li>The Dynamic Host Configuration Protocol (DHCP) automates the assignment of IP addresses, subnet masks, default gateway, and other IP parameters. </li></ul>
  13. 15. DHCP Addressing <ul><li>Three Modes of DHCP Addressing </li></ul><ul><li>Manual Allocation </li></ul><ul><li>Auto Allocation </li></ul><ul><li>Dynamic Allocation </li></ul>
  14. 16. Routing protocols for WSN <ul><li>Depends on the Applications </li></ul><ul><li>Existing Protocols </li></ul><ul><li>Shortest path Tree </li></ul><ul><li>Spanning Tree Algorithm </li></ul><ul><li>N-Safe link Algorithm </li></ul>
  15. 17. Our System Implementation
  16. 18. <ul><li>We have used four sensor nodes for sensing temperature of the given habitat and one control node interfaced with the base station i.e. PC in our case . </li></ul><ul><li>Handles two types of Monitoring </li></ul><ul><li>Query Handling by user </li></ul><ul><li>Updating the database on the base station after a given time interval. </li></ul>Our System Implementation
  17. 19. Topology Discovery & Localization In our system <ul><li>We have Modified Topdisc Algorithm to meet our requirements </li></ul><ul><li>Using DHCP Dynamic Mode of Addressing </li></ul>
  18. 20. Our Modification in DHCP Addressing <ul><li>8 bit IP Addresses </li></ul><ul><li>Finite lease period of 5 mins </li></ul>
  19. 21. Our DHCP Addressing Bit 7 Bit 6 Bit 5 Bit 4 Bit 3 Bit 2 Bit 1 Bit 0 Network Id Sub Network Id Host ID
  20. 22. Modified Version of Topdisc as required for the System <ul><li>The main node i.e. our control node would be in sub-network 0 ( according to IP .V4 addressing techniques ). </li></ul><ul><li>The next node which is in the range of sub-network 0 would be named as sub-network 1, subsequently this process gets on and on till all nodes in the network get its assigned sub-network </li></ul>
  21. 23. Modified Version of Topdisc as required for the System <ul><li>The next part of the individual host addressing is based on the shortest distance algorithm. The node nearest to the control node gets its host id as 0, 1, 2, 3, ….And this comes under sub-network 1. </li></ul><ul><li>Subsequently Nodes in Subnetwork 1 would address the nodes in subnetwork 2 and assign Host IDs </li></ul>
  22. 24. X represents control node. X represents odd numbered sub-networks. i.e.1, 3, 5…… X represents even numbered sub-networks. i.e. 2, 4, 6 …..
  23. 25. Localization Technique Adopted <ul><li>Each Node has its Corresponding </li></ul><ul><li>Parent </li></ul><ul><li>Child </li></ul><ul><li>Friend </li></ul>
  24. 26. Routing Algorithm For WSN <ul><li>Mixture Of Spanning Tree And N - Link state protocol </li></ul><ul><li>For query purpose Spanning Tree Algorithm </li></ul><ul><li>For Updating Database N- link State Algorithm (here we would Take N = 2) </li></ul>
  25. 27. Routing Tables <ul><li>Routing Tables would be based on the Localization Table </li></ul><ul><li>It would be like a family Tree chart </li></ul>
  26. 28. Sensor Node
  27. 29. Future Enhancements <ul><li>Implementaion of Fail Safe Method </li></ul><ul><li>Completion of fully configurable Wireless Sensor Network </li></ul><ul><li>And If time permits Softwrae simulation of the routing Algorithm to analyze the Systems Success Rate </li></ul>
  28. 30. <ul><li>Thanking You </li></ul>

×