Wireless Sensor Wireless Sensor Network (WSN)Network (WSN)

ByByNishant H. ShahNishant H. Shah

Siddheshwar B. SharmaSiddheshwar B. SharmaBonee SoibamBonee Soibam

Introduction of WSNIntroduction of WSN

Research and Systems Research and Systems Implemented till dateImplemented till date

System Implementation & System Implementation & future Developmentsfuture Developments

ConclusionConclusion

IntroductionIntroduction

Difference between WSN & other Difference between WSN & other wireless Networkswireless Networks

Key Application of WSNsKey Application of WSNs

What is a Sensor Node ?What is a Sensor Node ?

Sensor NodeSensor Node

Research done till DateResearch done till Date

Habitat Monitoring SystemHabitat Monitoring System

Topology Discovery algorithms Topology Discovery algorithms

Data Routing Algorithms Data Routing Algorithms

Problems with WSNProblems with WSN

Energy Efficient and robust Energy Efficient and robust

No fixed topology No fixed topology

Algorithm for routing the data Algorithm for routing the data

TopologyTopology Discovery Algorithm Discovery Algorithm

Ad hoc networking the main Ad hoc networking the main principleprinciple

The conditions are dynamic and The conditions are dynamic and adaptiveadaptive

Nodes should self organize Nodes should self organize themselves in particular topologythemselves in particular topology

Several Topology Discovery Several Topology Discovery AlgorithmsAlgorithms

Ad Hoc Network Management Ad Hoc Network Management Protocol (ANMP) Protocol (ANMP)

A Distributed Mechanism for A Distributed Mechanism for Topology Discovery in Ad hoc Topology Discovery in Ad hoc Wireless Networks Wireless Networks

““TopDisc” Algorithm.TopDisc” Algorithm.

TOPDISC AlgorithmTOPDISC Algorithm

Approximate topology is Approximate topology is constructed using information of constructed using information of Neighborhood nodesNeighborhood nodes

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

TOPDISC AlgorithmTOPDISC Algorithm

These Clusters are These Clusters are arranged in Tree arranged in Tree Structure called Structure called “TREC”“TREC”

Theswe Clusters Theswe Clusters Give the Give the Reachabilty MapReachabilty Map

Localization TechniqueLocalization Technique

Need for LocalizationNeed for Localization

As the network is adaptive it would As the network is adaptive it would be fair enough for us to address the be fair enough for us to address the nodes dynamicallynodes dynamically

It can done Using DHCP protocol for It can done Using DHCP protocol for addressingaddressing

DHCP AddressingDHCP Addressing

Each node would get its own IP.V4 Each node would get its own IP.V4 addressaddress

The Dynamic Host Configuration The Dynamic Host Configuration Protocol (DHCP) automates the Protocol (DHCP) automates the assignment of IP addresses, subnet assignment of IP addresses, subnet masks, default gateway, and other masks, default gateway, and other IP parameters. IP parameters.

DHCP AddressingDHCP Addressing

Three Modes of DHCP AddressingThree Modes of DHCP Addressing

1.1. Manual AllocationManual Allocation

2.2. Auto AllocationAuto Allocation

3.3. Dynamic AllocationDynamic Allocation

Routing protocols for WSNRouting protocols for WSN

Depends on the ApplicationsDepends on the Applications

Existing ProtocolsExisting Protocols

1.1. Shortest path Tree Shortest path Tree

2.2. Spanning Tree AlgorithmSpanning Tree Algorithm

3.3. N-Safe link Algorithm N-Safe link Algorithm

Our System ImplementationOur System Implementation

We have used four sensor nodes for We have used four sensor nodes for sensing temperature of the given sensing temperature of the given habitat and one control node habitat and one control node interfaced with the base station i.e. interfaced with the base station i.e. PC in our case . PC in our case .

Handles two types of MonitoringHandles two types of Monitoring

1.1.Query Handling by userQuery Handling by user

2.2.Updating the database on the base Updating the database on the base station after a given time interval.station after a given time interval.

Our System ImplementationOur System Implementation

Topology Discovery & Topology Discovery & Localization In our systemLocalization In our system

We have Modified Topdisc We have Modified Topdisc Algorithm to meet our Algorithm to meet our requirementsrequirements

Using DHCP Dynamic Mode of Using DHCP Dynamic Mode of AddressingAddressing

Our Modification in DHCP Our Modification in DHCP AddressingAddressing

8 bit IP Addresses8 bit IP Addresses

Finite lease period of 5 minsFinite lease period of 5 mins

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

The next node which is in the range of The next node which is in the range of sub-network 0 would be named as sub-sub-network 0 would be named as sub-network 1, subsequently this process network 1, subsequently this process gets on and on till all nodes in the gets on and on till all nodes in the network get its assigned sub-networknetwork get its assigned sub-network

Modified Version of Topdisc Modified Version of Topdisc as required for the Systemas required for the SystemThe next part of the individual host The next part of the individual host addressing is based on the shortest addressing is based on the shortest distance algorithm. The node nearest to distance algorithm. The node nearest to the control node gets its host id as 0, 1, 2, the control node gets its host id as 0, 1, 2, 3, ….And this comes under sub-network 1.3, ….And this comes under sub-network 1.

Subsequently Nodes in Subnetwork 1 Subsequently Nodes in Subnetwork 1 would address the nodes in subnetwork 2 would address the nodes in subnetwork 2 and assign Host IDs 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 Localization Technique AdoptedAdopted

Each Node has its CorrespondingEach Node has its Corresponding

1.1.Parent Parent

2.2.Child Child

3.3.FriendFriend

Routing Algorithm For WSNRouting Algorithm For WSN

Mixture Of Spanning Tree And N - Link Mixture Of Spanning Tree And N - Link state protocolstate protocol

For query purpose Spanning Tree For query purpose Spanning Tree AlgorithmAlgorithm

For Updating Database N- link State For Updating Database N- link State Algorithm (here we would Take N = 2)Algorithm (here we would Take N = 2)

Routing TablesRouting Tables

Routing Tables would be based on Routing Tables would be based on the Localization Tablethe Localization Table

It would be like a family Tree chartIt would be like a family Tree chart

Sensor Node Sensor Node

Future EnhancementsFuture Enhancements

Implementaion of Fail Safe MethodImplementaion of Fail Safe Method

Completion of fully configurable Wireless Completion of fully configurable Wireless Sensor NetworkSensor Network

And If time permits Softwrae simulation of And If time permits Softwrae simulation of the routing Algorithm to analyze the the routing Algorithm to analyze the Systems Success RateSystems Success Rate

Thanking YouThanking You