Upload
swadhin-goswami
View
225
Download
0
Embed Size (px)
Citation preview
7/31/2019 2nd Phase Ppt
1/19
Sharath Bhat .A.S[1SG08CS068]
Spurthi.V [1SG08CS077]
Sneha.V.Rao [1SG08CS075]
Sowmya.H.N [1SG08CS076]
Under the guidance of
Mrs.Sangeetha.V.
Sr.Lecturer
Dept of CSE
7/31/2019 2nd Phase Ppt
2/19
Problem Statement
System Architecture
Methodology
Implementation
Plan Of Execution
Results
Conclusion
7/31/2019 2nd Phase Ppt
3/19
As wireless sensor networks are evolving toapplications where high load demands dominate
and performance becomes a crucial factor,congestion remains a serious problem that has to be
effectively and efficiently tackled.
7/31/2019 2nd Phase Ppt
4/19
SOURCE
DSR
SOFT
DECISION
HARD
DECISION
TIME
DELAY
BUFFER
OCCUPANCY
POWER
AVAILABLE
COMBINATION
OF ALL
PARAMETERS
DESTINATION
7/31/2019 2nd Phase Ppt
5/19
The packets are sent from source to destination either
by Soft decision phase
Hard decision phase
It does so by considering various parameters like
time delay
buffer occupancy
power availableCombination of all the above parameters
7/31/2019 2nd Phase Ppt
6/19
i)Data Fragmentation
The large data payload is divided into smaller
fragments.
Data payload of length L
DF1 DF2 DF3 DF4
L
7/31/2019 2nd Phase Ppt
7/19
ii)Triple Des Encryption
Data fragment is converted into bytes.
The data is encrypted based on key andcipher.
Data bytes are XORed thrice with key and
cipher.
7/31/2019 2nd Phase Ppt
8/19
Triple DES diagram
DES
DES
DES
DF1
KEY
KEY
KEY
CIPHER
CIPHER
CIPHER
DF1`
DF2`
DF3`=E1
7/31/2019 2nd Phase Ppt
9/19
Encrypted data enveloped into packet
Format for each data packet is as follows
SOURCE ID
ENCRYPTED
DATA
DESTINATION
ID
SEQUENCE
NO
7/31/2019 2nd Phase Ppt
10/19
In DSR , information are propagated based on one-hop
neighbourhood information.
Specifically, a sensor node maintains a neighbour list,which contains the ids of all nodes within its transmission
range.
It is used to find multiple routings.
7/31/2019 2nd Phase Ppt
11/19
Sourcenode
Fetch
node inroutingtable
Fetch
node incoverage
area
Check whether
the nodescontain
destination
Cache the
routeObtain nodes in
the fwd dirn
Pick the node
according to the rule
7/31/2019 2nd Phase Ppt
12/19
Data Division
Encryption
Dynamic Source Routing
7/31/2019 2nd Phase Ppt
13/19
DATA DIVISION
getDataFragments()
getAllPackets()
getPacketData()
7/31/2019 2nd Phase Ppt
14/19
ENCRYPTION
getEncryptedDatapayload()
encripthdata( )
setKey()
setUpcipher()
encrypt()
getDecriptedDatapayload()decrypt()
7/31/2019 2nd Phase Ppt
15/19
DYNAMIC SOURCE
ROUTING
getNodes()
fetchCoverageNodes()
packetBroadcastNode()
checkDestinationCoverageNodes()
getCoverageAreaForwardNodes()
7/31/2019 2nd Phase Ppt
16/19
1 Design 21-Feb-2012 Completed2 Analysis 1-March-2012 Completed3 Implementation of Module 1 8-March-2012 Completed4 Implementation of Module 2 14-March-2012 Completed5 Implementation of Module 3 20-March-2012 Completed4 Implementation of Module 4 28-March-2012 Completed7 Implementation of Module 5 1-April-2012 Pending8 Implementation of Module 6 13-April-2012 Pending9 Testing 24-April-2012 Pending10 Preparation of Final Report 10-May-2012 Pending11 Submission of Report 15-May-2012 Pending12 Final Demo 15-May-2012 Pending
7/31/2019 2nd Phase Ppt
17/19
Data payload is divided into fragments, that are further
encrypted and formed as packets. Finally, it provides multiple
paths by using DSR.
7/31/2019 2nd Phase Ppt
18/19
Congestion is efficiently controlled since it
provides multiple paths using DSR. It provides
more security.
Further, the best path can be obtained considering
the various parameters.
7/31/2019 2nd Phase Ppt
19/19