27-08-2014, 01:54 PM
DETECTION OF REPLICATION ATTACKS WITH ALTERED PRIMARY KEY USING LOCALIZATION APPROACH & PRIORITY STATUS OF DELIVERY PROJECT REPORT
DETECTION OF REPLICATION.doc (Size: 118.5 KB / Downloads: 10)
ABSTRACT
In the EXISTING SYSTEM, Defending against Node Replication is not achieved in the Present System, only few methods are deployed. In the PROPOSED SYSTEM, using Localization Algorithm to identify the exact place of the original node which is verified and compared with the requested node to detect whether it is Replica or original node. We are monitoring Primary Key for every Node. In the MODIFICATION, this Primary Key will be changed on Random basis with Tine Stamp & as attack occurs. Source node will specify Time to Live (TTL) for every data Transmission, based on the TTL value Priority of the Packet is identified and transmitted accordingly.
INTRODUCTION
Most of the existing distributed detection protocols adopt the witness-finding strategy to detect the replicas. In particular, the general procedure of applying witness- finding to detect the replicas. There is no Distributed Replica Detection is achieved. LSM, RED Protocols are used to identify the Replica Nodes in one single Network only
PROPOSED SYSTEM
In the Proposed System, we are using Localization Algorithm to identify the exact place of the original node which is verified and compared with the requested node to detect whether it is Replica or original node. This Process is achieved using two Algorithms.
1. Extremely Efficient Detection (XED) The idea behind XED is motivated by the observation that, if a sensor node meets another sensor node at an earlier time and sends a random number to at that time, then, when and meet again, can ascertain whether this is the node met before by requesting the random number.
2. Algorithmic Description of EDD: The idea behind EDD is motivated by the following observations. The maximum number of times, that node encounters a specific node, should be limited with high probability during a fixed period of time, while the minimum number of times,
Primary Key based Verification is also achieved in this System in order to identify the Replica Nodes
MODIFICATION
1. Primary is changeable with respect to the Time Stamp for effective and secured Data Transfer.
2. Priority based Data Transfer is also achieved in this Implementation.
3. Source can specify less TTL (Time to Live) for every Data, Intermediate server verified the TTL value and transmitting most important Priority data then normal Data
ADVANTAGES
1. Precise Implementation to prevent Replica Node.
2. Most Priority based data are transmitted very quickly
3. Location identification helps to find exact and original Node.
4. Primary changeable ensures much more security in the system
CONCLUSION
In this paper, two replica detection algorithms for mobile sensor networks, XED and EDD, are proposed. Although XED is not resilient against collusive replicas, its detection framework, challenge-and-response, is considered novel as compared with the existing algorithms. We are also using Primary Key Authentication which id changeable with Time stamp. We have designed Priority based data sending which helps to transmit the packets more quickly.