A Distributed Delay-Efficient Data Aggregation Scheduling

for Duty-cycled WSNs

ABSTRACT:

The majority of security systems for wireless sensor networks are based on
symmetric encryption. The main open issue for these approaches concerns the
establishment of symmetric keys. A promising key distribution technique is the
random pre distribution of secret keys. Despite its effectiveness, this approach
presents considerable memory overheads, in contrast with the limited resources of
wireless sensor networks. In this paper, an in-depth analytical study is conducted
on the state-of-the-art key distribution schemes based on random pre distribution.
A new protocol, called q-s-composite, is proposed in order to exploit the best
features of random pre distribution and to improve it with lower requirements. The
main novelties of q-s-composite are represented by the organization of the secret
material that allows a storing reduction, by the proposed technique for pair wise
key generation, and by the limited number of pre distributed keys used in the
generation of a pairwise key. A comparative analysis demonstrates that the
proposed approach provides a higher level of security than the state-of-the-art
schemes.
EXISTING SYSTEM:

 In Existing system, Blom proposed a well-known scheme for key ex-change

based on matrix multiplication. Each node in the network knows some
cryptographic material used to generate a specific pair-wise key for each
other node which is able to generate the same key.
 Two schemes based on Blom’s work have been presented. In both schemes,
a pool of secret matrices D k×k is generated off-line. According to Blom’s
scheme, a matrix of identifiers Gn×k is generated, and each row is matched
to a node. Then, a ring of randomly chosen matrices G is matched to each
node.
 Each secret row of each (DG) T is given to its corresponding node. After
deployment, during network initialization, each node verifies if any
neighbors share a matrix with it. The shared-key discovery is performed
broadcasting the list of the identifiers of the matrix in the ring.

DISADVANTAGES OF EXISTING SYSTEM:

 More memory overheads.

 It provides only less amount of resilience against eavesdropping.
 It requires more storage space.

PROPOSED SYSTEM:
  In the proposed system, an analysis based on the statistical distribution of the
keys identifies the best configuration of q-composite, which can provide the
best performance with respect to state-of-the-art key distribution schemes
without special assumption (e.g., static or small networks).
 Although q-composite provides a high level of security, it is characterized
by a large memory requirement: storage represents a critical point for key
management schemes based on probabilistic pre distribution, since with a
larger available storage it is possible to distribute a larger quantity of keys
and to improve the resilience of the network.
 Similarly, with a fixed available memory, resilience can be increased by
reducing the memory requirements of the key management scheme. In order
to address this issue, a new protocol called q-s-composite is proposed here.

ADVANTAGES OF PROPOSED SYSTEM:

 It shows efficient memory management.

 It provides higher level of resilience against eavesdropping.
 It requires less storage space compared to existing systems.

SYSTEM ARCHITECTURE:
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:

 System : Pentium Dual Core.

 Hard Disk : 120 GB.
 Monitor : 15’’ LED
 Input Devices : Keyboard, Mouse
 Ram : 1GB.

SOFTWARE REQUIREMENTS:

 Operating system : Windows XP/UBUNTU.

 Implementation : NS2
 NS2 Version : NS2.2.28
 Front End : OTCL (Object Oriented Tool
Command Language)

 Tool : Cygwin (To simulate in Windows

OS)
REFERENCE:
Filippo Gandino, Member, IEEE, Renato Ferrero, Member, IEEE, and Maurizio
Rebaudengo, Senior Member, IEEE “A Key Distribution Scheme for Mobile
Wireless Sensor Networks: q -s-composite”, IEEE TRANSACTIONS ON
INFORMATION FORENSICS AND SECURITY, 2017.