SLP Header

Detection of Replication Attacks Using Randomized Unique Identifier

IJCSEC Front Page

In this the problem is node replication detection. Although defending against node replication attacks demands immediate attention, compared to the extensive exploration on the defense against node replication attacks in static networks, only a few solutions in mobile networks have been presented Defending against Node Replication is not achieved in the Present System. Localization Algorithm is used to identify the exact place of the original node. This is verified and compared with the requested node to detect whether it is Replica or original node. This Randomized unique identifier will be generated and will be changed on Random basis with Time Stamp &as attack occurs. Source node will specify Time to live for every data Transmission. Based on the TTL value Priority of the Packet is identified and transmitted accordingly...The advantages of our proposed algorithms include localized detection; efficiency and effectiveness.
Keywords:Attack, security, wireless sensor networks.
Sensor networks, which are composed of a number of sensor nodes with limited resources, been demonstrated to be useful in applications, such as environment monitoring and object tracking. As sensor networks could be deployed in a hostile region to perform critical missions, the sensor networks are unattended and the sensor nodes normally are not equipped with tamper-resistant hardware. This allows a situation where the adversary can compromise one sensor node, fabricate many replicas having the same identity (ID) from the captured node, and place these replicas back into strategic positions in the network for further malicious activities. This is a so-called node replication attack. Since the credentials of replicas are all clones of the captured nodes, the replicas can be considered as legitimate members of the network, making detection difficult. From the security point of view, the node replication attack is extremely harmful to networks because replicas, having keys, can easily launch insider attacks, without easily being detected. Recently, due to advances in robotics, mobile sensor networks have become feasible and applicable. Nevertheless, although the problem of node replication detection in static networks has been extensively studied, only a few schemes have been proposed for mobile sensor networks. Even worse, as indicated in, the techniques used in detecting replicas in static environments are not useful in identifying replicas in mobile environments. With the consideration of nodes’ mobility and the distributed nature of sensor networks, it is desirable, but very challenging, to have efficient and effective distributed algorithms for detecting replicas in mobile sensor networks.
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. All the Methods are Witness based Verification, Highly Complex, Very difficult to identify, Costlier. The witness-finding strategy exploits the fact that one sensor node cannot appear at different locations, but, unfortunately, the sensor nodes in mobile sensor networks have the possibility of appearing at different locations at different times, so the above schemes cannot be directly applied to mobile sensor networks.
Slight modification of these schemes can be helpful for applicability to mobile sensor networks. For instance, the witness-finding strategy can adapt to mobile environments if a timestamp is associated with each location claim. In addition, setting a fixed time window in advance and performing the witness- finding strategy for every units of time can also keep witness- finding feasible in mobile sensor networks. Nevertheless, accurate time synchronization among all the nodes in the network is necessary. Moreover, when witness-finding is applied to mobile sensor networks, routing the message to the witnesses incurs even higher communication cost.


  1. R. Brooks, P. Y. Govindaraju, M. Pirretti, N. Vijaykrishnan, and M.T. Kandemir, “On the detection of clones in sensor networks using random key predistribution,” IEEE Trans. Syst., Man, Cybern. C, Applicat.Rev., vol. 37, no. 6, pp. 1246–1258, Nov. 2007.
  2. C. Bettstetter, H. Hartenstein, and X. P. Costa, “Stochastic properties of the random waypoint mobility model,” Wireless Netw., vol. 10, no. 5, pp. 555–567, 2004.
  3. G. Cormode and S. Muthukrishnan, “An improved data stream summary the count-min sketch and its applications,” J. Algorithms, vol. 55, no. 1, pp. 56–75, 2005.
  4. M. Conti, R.Di Pietro, L. V. Mancini, andA.Mei, “Arandomized, efficient, and distributed protocol for the detection of node replication attacksin wireless sensor networks,” in Proc. ACMInt.Symp. Mobile AdHoc Networking and Computing (MobiHoc), Montreal, Canada, 2007, pp. 80–89.
  5. M. Conti, R. D. Pietro, L. V. Mancini, and A. Mei, “Distributed detection of clone attacks in wireless sensor networks,” IEEE Trans. Depend. Secure Computing., vol. 8, no. 5, pp. 685–698, Sep./Oct. 2012.
  6. M. Conti, R. D. Pietro, and A. Spognardi, “Wireless sensor replica detection in mobile environment,” in Proc. Int. Conf. Distributed Computing and Networking (ICDCN), Hong Kong, China, 2012, pp.249–264.
  7. H. Choi, S. Zhu, and T. F. La Porta, “SET: Detecting node clones in sensor networks,” in Proc. Int. ICST Conf. Security and Privacy In Communication Networks (Securecomm), Nice, France, 2007, pp. 341–350.