AN ENHANCED BIO

INSPIRED TRUST
MODEL FOR WSNS
Under the guidance of

Mr. Md. Asrar Ahmed

Asst.Professor
IT Department
LUBNA NISHATH PATEL (160412737-062)
SHAHTAJ BANO (160412737-064)
TAMJID AFSHAN BANU (160412737-073)

Overview
Problem

Statement (What is the problem?)

Domain

(Where is the problem?)

Existing

System(What has been done?)

Proposed

System(What can be done?)

PROBLEM STATEMENT
Shortest

path is chosen more frequently

Congestion
Packets

occurs

are dropped

Ultimately,Path

Failure

Wireless Sensor Networks

Heterogeneous
Wireless

sensor nodes spread over large field

sensing + data networking

Information

processing

Components
Assembly

of sensors
Interconnecting network
Central point of gathering
Set of computing resources

WSN Architecture

Applications
Surveillance
Health

Monitoring

Tracking

Applications

Environment
Disaster

Monitoring

Relief

Precision

Farming

Security Issues
Selective

Forwarding (drops packets selectively)

Wormholes
Flood

(tunnel)

Attack (DoS to bring down the network)

Sinkhole

Attack (attracts packets to itself)

EXISTING SYSTEM
TRUST & REPUTATION
SYSTEM
Trust

is probability with which an agent performs a

particular action

Reputation-

When agents believe a particular agent

depending upon past

Trust

is based on reputation

ANTHOCNET
Energy

efficient routing algorithm

Maximizes

the networks life time

Finds

the shortest path between source and

destination

Chooses

the path with less communication hops.

All ants in the nest, no pheromone

Ants on short path have

arrived earlier

50% take short path,50% take

long path

Pheromone trail on short path is

higher than the longer path,
hence probability of short path
being chosen, increases

(a) Exploring (b) Pheromone

trail

(c) Additional
node

(d) Shortest
path

AntHocNet in Short
First

sensor is the client, transition rule decides the

next sensor

Path

quality is determined

Comparison
Trust

of the paths to find best path

value is updated for the best route.

Flow of Algorithm

Working of Algorithm
Updates

pheromone levels b/w neighbours

Increases
A

pheromone value of most travelled

pheromone value is set

Less

value link is removed

More value update link in pheromone table
The

link where ant doesnt visit, pheromone

evaporation levels are calculated

The

Path with more value of updated pheromone is

chosen

Data Structures
Each

node maintains two tables

Pheromone
Helps

in making routing decisions

Neighbour
Helps

Table

Table

in identifying neighbours of a node

Pheromone Table
Helps

in making Routing Decisions

Regular
Virtual

Pheromone

Pheromone

Average

Hop Count

Neighbour Table

Helps in identifying neighbours of a node

Iterate neighbour table till all are visited

To modify entries in neighbour table

Add if it doesnt exists
Remove neighbour
Add regular path if pheromone updating is regularly done.

AntHocNet Functionality

Functionality
Source

node checks its pheromone table for available path

Generates

a forward ant packet (FA)

Intermediate
Checks

node receives the FA packet

the path in table

If

path exists,it kills FA & generates BA otherwise it sends

FA to its neighbour

BA

is send back to sender in the same path

Routing

table is updated at every intermediate node and

source node

The

first FA to reach the destination is considered to have

the best optimal path

Types of Incoming Packets

Hello

Packet

Discovers

immediate neighbours by transmitting hello

messages
Repair

Packet

If

a link is broken and was the only link to destination then

it should be repaired

Reactive
It

Packet

employs the concept of flooding

Pro-active
Search

paths

Packet

for new paths is concentrated around the current

Link Failures
Hello
The

Messages are broadcasted to detect link failures

link failure is notified to all nodes by floodig

Repair

ants try to find alternate path to destination if

failure is in the midst of transmission

Protocol with TCL

Topology

of 34 nodes

Configured
Static

with AntHocNet

source and destination(2 and 32)

Energies

are calculated about the nodes on path

between source and destination

Throughput,energy

consumption,delay rates are

plotted using xgraphs

Simulation Tool

NS2
UNIX

Based
Network Simulator version 2
Package of tools to simulate behavior of networks
Supports TCP,UDP,FTP,HTTP,DSR and many more protocols.

System Specifications
SOFTWARE:
Fedora

14 (Operating System)
NS2 (Network Simulator)
HARDWARE:
32bit

Processor
500GB Hard Drive
4GB RAM

Conclusion
The

attempt to find the shortest path with energy

efficiency has been successful.However,source and
destination were set.

THANK YOU