Fast and Secure Convergecast in Tree

Cluster Based Wireless Sensor Network

Guided by
Ms.K.Pradeepa
Presented by
S.Kathirvel (9912104009)
Introduction
 Objective

• To collect the data from tree based wireless sensor network is

an faster and secure manner by single source shortest path
algorithm and cryptographic algorithm with multi channel
scheduling scheme .
 Literature Review
S.No Title of the Authors , Theme of the Their Proposed Issues
paper year paper algorithm Addressed

1 Distributed Ying Zhang , Fast and reliable They have Data loss will be
Minimal Time Shashidhar converge cast on the proposed converge occur by the
Convergecast Gandham , MAC layer cast of the data interferences
Scheduling Qingfeng Huang where packets can
for Small or (2009) be aggregated
Sparse Data on their way to the
Sources sink method .

2 Spanning tree S. Upadhyayula, Low latency and They have Schedule length is
based S.K.S. Gupta energy efficient data proposed higher than degree
algorithms for (2010) aggregation Minimum constrained
low latency and enhanced Spanning Tree minimum
energy efficient convergecast in wsn (MST) spanning tree .
data Algorithm .
aggregation
enhanced
convergecast
(DAC) in
wireless sensor
networks
 Cont..
S.No Title of the Authors , year Theme of the Their used Issues
paper paper algorithm Addressed
3 Enhancing the Ozlem Durmaz What is the TDMA Half duplex
Data Collection Incel , fastest rate at scheduling on a transceivers is
Rate of Bhaskar which we can single channel used .
Tree-Based Krishnamachari collect
Aggregation in (2010) a stream of
Wireless Sensor aggregated data
Networks from a set of
wireless sensors
organized as a
tree
4 On Tree-Based V. Annamalai, wireless Converge Single channel
Convergecasting S. K. S. Gupta communication casting Tree scheduling
in Wireless L. Schwiebert, channels to Construction algorithm is
Sensor (2011) ensure and used .
Networks collision-free Channel
communication Allocation
Algorithm
(CTCCAA)

5 A Tiered Mohamed Data Private key Public key will

Authentication Younis , Osama transmission is distribution be known by
of Multicast Farrag , Bryan an secured algorithm other nodes
Protocol for Althouse manner over the
Adhoc networks adhoc network
 Existing System
• There are lot of approaches to collect the data from wsn.
– Tree based data collection .
– Field node to Sink node data collection.

• But most of the approaches are considering field node to sink node based
wsn and using single frequency channels for the data collection and data
transmission .

• None of the previous approaches discussed the effect of multi channel

scheduling with different channel assignment techniques .
 Issues

Limitations of Existing system :

• Fundamental limitations due to interference
• Half-duplex transceivers on the nodes.
➢ Half –duplex transceivers make the traffic over the network
• By using the single channel schedule thus causing some performance
degradation
• The schedule generated may not always eliminate inferences thus causing
packet losses
• Security is not present in our deployed nodes .
• There may be a chance of intruder node in our deployed tree .
 Proposed System

• So we propose the fast data collection in tree based wireless

sensor network by single source shortest path dijkstra's
algorithm
• And the transferring data will be secured by the three tier
security schemes
 Modules
Module 1 : Node creation And Work assignment
Module 2 : Construct the one hob neighbor table
Module 3 : Creation of channel assignment scheme for
interference avoidance
Module 4 : Construct the routing tree topology to reduce the
schedule length
Module 5 : Apply the three tier security over the deployed nodes
 Modules description

Module 1 : Node creation and work assignment

– To create the node for sensing and transmitting the data to the
sink.
– For the visual representation the nodes , cluster heads and sink
node are created and differentiated from the colour in the
simulator tool , by use of the TCL coding .
Module 2 : construct the one hob neighbor table
– Routing table is create based on the deployed nodes distance
– This routing table is only decided the path of data flow .
 Cont..

Module 3 : Creation of channel assignment scheme for

interference avoidance
– Interference will be eliminated by use of
• Transmission power control
• Multichannel scheduling
Transmission power control :
By transmitting the signals with just enough power instead of
maximum power , from this method node’s energy will be saved .
Multichannel scheduling :
Multichannel communication is an efficient method to eliminate
interference by enabling concurrent transmission over different
frequencies .
 Cont..

• Module 4 : Construct the routing tree topology to reduce the

schedule length

– Create the dijkstra's shortest path algorithm in this deployed tree .

– This shortest path algorithm is used to reduce the traversal nodes .
– Now the data will be reach the sink very quicker

• Module 5 : Apply the three tier security over the tree

– There may be a chance of attacker node is in our node

– That attacker nodes are helps to the intruders theft our data
– Based on the cryptographic MD5 algorithm , we secure our nodes , cluster heads
and the sink nodes .
 Secure Routing
• MD5 has 128 bit (16 –byte ) hash value .
• Generate a key value and assigned for each node in
the network .
• While sending the data to destination the key value
has been checked by the sending node and
destination node .
• So the unauthorized node cannot send data to
network .
• From this secure routing we can avoid replica
attack , DDOs attack and spoofing attack .
 Works Completed

• Studied about NS2 simulation tool .

• Simulation setup and node creation .
• Routing table construction .
• Applied single source shortest path algorithm .
Simulation Result
Cont..
Cont..
Cont..
 Works to be done

• Works going to be do in next phase :

– Create the security algorithm for avoid the intruders

attack .
– Apply that created algorithm to deployed nodes for
detect the intruder node .
– Test the security of the data transmission over the
deployed nodes
– Result submission .
 References
• S. Gandham, Y. Zhang, and Q. Huang, “Distributed time-optimal
scheduling for convergecast in wireless sensor networks,” Computer
Networks, vol. 52, no. 3, pp. 610–629, 2008.
• T. Moscibroda, “The worst-case capacity of wireless sensor networks,”
in IPSN ’07, Cambridge, MA, USA, pp. 1–10.
• A. Ghosh, O. D. Incel, V. A. Kumar, and B. Krishnamachari,
“scheduling algorithms for fast aggregated convergecast in sensor networks,”
in MASS ’09, Macau, China.
• S. Upadhyayula and S. Gupta, “Spanning tree based algorithms
for low latency and energy efficient data aggregation enhanced
convergecast (dac) in wireless sensor networks,” Ad Hoc Networks,
vol. 5, no. 5, pp. 626–648, 2007.
• B. Krishnamachari, D. Estrin, and S. Wicker, “The impact of data
aggregation in sensor networks,” in ICDCSW ’02, pp. 575–578.
• O. D. Incel and B. Krishnamachari, “Enhancing the data collection
rate of tree-based aggregation in wireless sensor networks,” in
SECON ’08, San Francisco, CA, USA, pp. 569–577.
• Mohamed Younis , Osama Farrang , and Bryan Althouse , “A Tiered Authendication of Multicast Protocol for
Adhoc Networks” , IEEE transaction on network and service management vol 9,no 1.march 2012 .
Thank You…