Вы находитесь на странице: 1из 22

Dynamic Data Discovery and

Diffusion with security in Wireless


Sensor Networks

Guided By Submitted By

Ms.Stiji Stephen, M.E., Adorna & Ajonna,II


(Assistant professor) year,ECE
ECE dept.
AIM
 The main goal of the project is securely data distribution
through network

 Thus the new mechanism is implement here namely


distributed data discovery and dissemination protocol
(DiDrip)

 DiDrip it allows network owners and authorized users to


disseminate data items into WSNs without relying on the
base station.

 DiDrip is provably secure.


ABSTRACT

 DiDrip the provable security technique to formally prove


the authenticity and integrity

 Existing system is based on the centralized approach only


the base station can distribute data items

 The proposed system implement DiDrip it allows the


network owners to authorize multiple network

 The main advantage of the proposed system is that the


owners will be shared by applications from multiple users.
Existing System
 Existing system the data discovery and dissemination
perform

i) centralized approach only the base station can


distribute data items.

ii)Existing algorithm is not designed with security


minded and hence attackers can easily attacks to harm
the network.
Disadvantage

 Centralized method

 Security weaknesses

 Not suitable for emergent multi-owner-multi-user

 Inefficient, non-scalable and vulnerable to security attacks


PROPOSED SYSTEM

 The propose system is secure and distributed data


discovery and dissemination protocol named DiDrip

 DiDrip allows network owners and authorized users to


disseminate data items into WSNs without relying on
the base station

 DiDrip allow provable security technique to formally


prove the authenticity and integrity
Advantage

 Supporting different user privileges

 Authenticity and integrity of data item

 User accountability

 Low energy overhead

 Scalability
BLOCK DIAGRAM
MODULES

1. Network Module

2. User joining

3. Packet Preprocessing

4. Packet Verification
MODULE DESCRIPTION

1. Network module

 In this module the WSN consist of large number of sensor


nodes.

 This was administered by the data owner and accessible by


many users

 The network users use some mobile devices to disseminate


data items into the network.

 The network owner is responsible for generating key.


2.User Joining

 Number of users are registered in the network for


transmitting data in wireless sensor network.

 User sends their user id, private key and public key to the
network owner

 Network owner verify whether they are the registered users

 If they are registered user then network owner will issue a


certificate.
Cont…
3. Packet Preprocessing

 User enters the WSN and need to disseminate n data items the
construction of the packets can be designed in two ways

Hash Chain

Merkle hash tree


Cont…
Hash Chain:

 In hash chain process, a packet is composed of packet header


and hash value of packet.

 The value of the hash packet is used to verify the next packet.

 After that user runs their own private key to perform sign
operation using that its will create an advertisement packet.

 Similarly, the network owner assigns a predefined key to


identify this advertisement packet
Cont…
Merkle hash tree:

 With the method of Merkle hash tree, user builds a Merkle


hash tree from the data items

 All the data items are treated as the leaves of the tree.

 A new set of internal nodes at the upper level is formed. Each


internal node is computed as the hash value of the
concatenation of two child nodes

 This process is continued until the root node is formed.


4.Packet Verification

 Sensor nodes receives packet from the authorized


users.

 Packet verification for hash chain is done by

verifying po{certj,h(p),SIGskj}

 Packet verification for Merkle hash tree is done by

verifying po{certj,root,SIGskj(root)}
Software Requirements

 Implementation - NS2

 Front End -OTCL(Object Oriented Tool


language)

 Operating System -Windows / Ubuntu


CONCLUSION
 Existing system used data discovery and dissemination

protocols there the security vulnerabilities are identified

when used in WSNs

 Also, existing system does not support distributed

operation.

 Therefore, here a secure and distributed data discovery

and dissemination protocol named DiDrip has been

proposed.
Cont..

 While analyzing the security of DiDrip, the evaluation

results of DiDrip shows that it is feasible in practice.

 In DiDrip the authenticity and integrity of the

disseminated data items is also proved.


FUTURE WORK

 In the future work, we will consider how to ensure data


confidentiality in the design of secure and distributed data
discovery and dissemination protocols.
REFERENCES
 He D.,Chen C.,Chan S., and Bu J.,( May 2012)“DiCode: DoS-resistant
and distributed code dissemination in wireless sensor networks,” IEEE
Trans. Wireless Communication., vol. 11, no. 5, pp. 1946–1956,

 Dang T.,Bulusu N.,Feng W., and Park S.,(2009)“DHV:Acode


consistency maintenance protocol for multi-hop wireless sensor
networks,” in Proc. 6th Eur. Conf.Wireless Sensor Netw, pp. 327–342.

 He D.,Chan S.,Tang S., and Guizani M.,(sep 2013) “Secure data


discovery and dissemination based on hash tree for wireless sensor
networks,” IEEE Trans. Wireless Communication., vol. 12, no. 9, pp.
4638– 4646, P.

 Tolle G., and Culler D.,(2005) “Design of an application-cooperative


management system for wireless sensor networks,” in Proc. Eur. Conf.
Wireless Sensor Netw., pp. 121–132.
Cont..
 Levis, Patel N., Culler D., and Shenker S.,(2004) “Trickle: A self-regulating
algorithm for code maintenance and propagation in wireless sensor
networks,” in Proc. 1st Conf. Symp. Netw. Syst. Design Implementation, pp.
15–28.

 Perrig A.,Canetti R.,Song D., and Tygar J.,( 2001) “Efficient and secure source
authentication for multicast,” in Proc. Netw. Distrib. Syst. Security Symp., ,
pp. 35–46.

 Hui J.W. and D. Culler,( 2004) “The dynamic behavior of a data dissemination
protocol for network programming at scale,” in Proc. 2nd Int. Conf. Embedded
Netw. Sensor Syst., pp. 81–94.

 Lin K., and Levis P.,(2008) “Data discovery and dissemination with DIP,” in
Proc. ACM/IEEE Int. Conf. Inf. Process. Sensor Netw, pp. 433–444.
THANK YOU

Вам также может понравиться