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

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

Introduction of WSN

Research and Systems Implemented till date

System Implementation & future Developments

Conclusion

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

Difference between WSN & other wireless Networks

Key Application of WSNs

What is a Sensor Node ?

Sensor Node

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

Habitat Monitoring System

Topology Discovery algorithms

Data Routing Algorithms

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

Energy Efficient and robust

No fixed topology

Algorithm for routing the data

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

Ad hoc networking the main principle

The conditions are dynamic and adaptive

Nodes should self organize themselves in particular topology

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

Ad Hoc Network Management Protocol (ANMP)

A Distributed Mechanism for Topology Discovery in Ad hoc Wireless Networks

“ TopDisc” Algorithm.

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

Approximate topology is constructed using information of Neighborhood nodes

Only distinguished nodes which have Neighborhood information communicate with the main node

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

These Clusters are arranged in Tree Structure called “TREC”

Theswe Clusters Give the Reachabilty Map

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

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

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.

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.

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

Three Modes of DHCP Addressing

Manual Allocation

Auto Allocation

Dynamic Allocation

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

Depends on the Applications

Existing Protocols

Shortest path Tree

Spanning Tree Algorithm

N-Safe link Algorithm

Our System Implementation

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

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.

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

We have Modified Topdisc Algorithm to meet our requirements

Using DHCP Dynamic Mode of Addressing

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

8 bit IP Addresses

Finite lease period of 5 mins

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

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

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

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

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

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

Localization Technique Adopted Each Node has its Corresponding Parent Child Friend

Each Node has its Corresponding

Parent

Child

Friend

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)

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)

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

Routing Tables would be based on the Localization Table

It would be like a family Tree chart

Sensor Node

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

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

Thanking You

Thanking You