Abstrait

An Extremely Versatile Key Pre-Distribution Plan for Remote Sensor Systems

M.V.Jayasree, S.Prathap

A procedure that prevents attackers from fast in sequence from both sensor composed information and be submerged issued queries. SafeQ also allows a descend to sense compromised storage nodes when they behave badly. To protect privacy, SafeQ uses a novel technique to instruct both information and queries such that a storage node can correctly procedure prearranged queries over encoded data without expressive their values. To preserve integrity, We Use two schemes—one using Merkle hash trees and a different using a new data structure called neighborhood chains—to generate integrity verification information so that a sink can use this information to verify whether the outcome of a query contains exactly the data items that satisfy the query. To improve presentation, we use an optimization method using Bloom filters to decrease the communication cost between sensors and storage space nodes. Therefore, we propose an enhanced unital-based key pre-sharing scheme providing high network scalability and good key sharing probability about lower bounded by We conduct approximate analysis and simulations and balance our solution to those of existing methods for different criteria such as storage overhead, network scalability, network connectivity, common secure path length and network resiliency. Our results show that the proposed approach enhances the network scalability while providing high secure connectivity reporting and overall improved performance. Moreover, for an equal network size, our solution reduces significantly the storage overhead compared to those of existing solutions.