This document summarizes a wireless sensor network system implemented by the authors. The system uses 4 sensor nodes to sense temperature and a control node interfaced with a base station PC. It implements a modified version of the TOPDISC topology discovery algorithm using DHCP for dynamic addressing. The routing algorithm uses a mixture of spanning tree and N-link state protocols. Future enhancements include implementing fail safes and fully configuring the wireless sensor network system.

1. Wireless Sensor Network (WSN) By Nishant H. Shah Siddheshwar B. Sharma Bonee Soibam

2. Introduction of WSN Research and Systems Implemented till date System Implementation & future Developments Conclusion

3. Introduction Difference between WSN & other wireless Networks Key Application of WSNs What is a Sensor Node ?

5. Sensor Node

7. Research done till Date Habitat Monitoring System Topology Discovery algorithms Data Routing Algorithms

8. Problems with WSN Energy Efficient and robust No fixed topology Algorithm for routing the data

9. Topology Discovery Algorithm Ad hoc networking the main principle The conditions are dynamic and adaptive Nodes should self organize themselves in particular topology

10. Several Topology Discovery Algorithms Ad Hoc Network Management Protocol (ANMP) A Distributed Mechanism for Topology Discovery in Ad hoc Wireless Networks “ TopDisc” Algorithm.

11. TOPDISC Algorithm Approximate topology is constructed using information of Neighborhood nodes Only distinguished nodes which have Neighborhood information communicate with the main node

12. TOPDISC Algorithm These Clusters are arranged in Tree Structure called “TREC” Theswe Clusters Give the Reachabilty Map

13. Localization Technique Need for Localization As the network is adaptive it would be fair enough for us to address the nodes dynamically It can done Using DHCP protocol for addressing

14. DHCP Addressing Each node would get its own IP.V4 address The Dynamic Host Configuration Protocol (DHCP) automates the assignment of IP addresses, subnet masks, default gateway, and other IP parameters.

15. DHCP Addressing Three Modes of DHCP Addressing Manual Allocation Auto Allocation Dynamic Allocation

16. Routing protocols for WSN Depends on the Applications Existing Protocols Shortest path Tree Spanning Tree Algorithm N-Safe link Algorithm

17. Our System Implementation

18. 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 . Handles two types of Monitoring Query Handling by user Updating the database on the base station after a given time interval. Our System Implementation

19. Topology Discovery & Localization In our system We have Modified Topdisc Algorithm to meet our requirements Using DHCP Dynamic Mode of Addressing

20. Our Modification in DHCP Addressing 8 bit IP Addresses Finite lease period of 5 mins

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

22. Modified Version of Topdisc as required for the System The main node i.e. our control node would be in sub-network 0 ( according to IP .V4 addressing techniques ). 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

23. Modified Version of Topdisc as required for the System 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. Subsequently Nodes in Subnetwork 1 would address the nodes in subnetwork 2 and assign Host IDs

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 …..

25. Localization Technique Adopted Each Node has its Corresponding Parent Child Friend

26. Routing Algorithm For WSN Mixture Of Spanning Tree And N - Link state protocol For query purpose Spanning Tree Algorithm For Updating Database N- link State Algorithm (here we would Take N = 2)

27. Routing Tables Routing Tables would be based on the Localization Table It would be like a family Tree chart

28. Sensor Node

29. Future Enhancements Implementaion of Fail Safe Method Completion of fully configurable Wireless Sensor Network And If time permits Softwrae simulation of the routing Algorithm to analyze the Systems Success Rate

30. Thanking You