Probabilistic cells in Replica Node Detection in Wireless Sensor Networks
- 1Anna University Chennai, Lord Jegannath College of Engineering and Technology, Nagercoil, IN
- 2Anna University Chennai, Lord Jegannath College of Engineering and Technology, IN
Wireless sensor networks (WSNs) are deployed in potentially hostile environments where enemies may be present, especially in the military. Since WSNs are mostly left without any notice since they are available in remote areas. Due to this unnoticed nature of wireless sensor networks, an attacker can easily capture and get access to the sensor nodes and replicate them, and then impose a variety of attacks with these replicas. These attacks are dangerous because they allow the attacker to extend the control over few nodes to much of the network. A fast and effective mobile replica node detection scheme using the localized multicast is proposed. Here, a scheme called P-MPC is used. The efficiency and security of this approach are evaluated theoretically. The results show that, compared to previous approaches proposed, this approach is more efficient in terms of communication and memory costs in large-scale sensor networks, and at the same time achieve a higher probability of detecting node replicas.
Conclusion
In this paper, we proposed two variants of the Localized Multicast approach for distributed detection of node replication attacks in wireless sensor networks. Unlike the two randomized algorithms approach previously proposed [14], our approach combines deterministic mapping (to reduce communication and storage costs) with randomization (to increase the level of resilience to node compromise). Our theoretical analysis and empirical results show that, compared to previous algorithms, our schemes are more efficient in large-scale sensor networks, in terms of communication and memory costs. Moreover, the probability of replica detection in our approach is higher than that achieved in these two algorithms. Our preliminary analysis also shows that, our approaches are more robust than RED against selective node compromise, and the communication and memory overheads of our approaches are similar or slightly higher than that of RED. One of our future works is to simulate the RED protocol and then have a more detailed comparison of efficiency based on empirical results.
References
- Conti. M, R.D. Pietro, L.V. Mancini, and A. Mei, “A Randomized, Efficient, and Distributed Protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks,” Sept. 2007..
- Ho. J, M. Wright, and S.K. Das, “Fast Detection of Replica Node Attacks in Mobile Sensor Networks Using Sequential Analysis,” Apr. 2009.
- Ho. J, D. Liu, M. Wright, and S.K. Das, “Distributed Detection of Replicas with Deployment Knowledge in Wireless Sensor Networks,” Ad Hoc Networks, vol. 7, no. 8, Nov. 2009.
- Hu. L and D. Evans, “Localization for Mobile Sensor Networks,” Proc. ACM MobiCom, pp. 45-57, Sept. 2004.
- Jung. J, V. Paxon, A.W. Berger, and H. Balakrishnan, “Fast Portscan Detection Using Sequential Hypothesis Testing,” Proc. IEEE Symp. Security and Privacy, pp. 211-225, May 2004.
- Liu. A and P. Ning, “TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks,” Apr. 2008.
- PalChaudhuri. S, J.-Y.L. Boudec, and M. Vojnovi_c, “Perfect Simulations for Random Trip Mobility Models,” Apr. 2005.
- Parno. B, A. Perrig, and V.D. Gligor, “Distributed Detection of Node Replication Attacks in Sensor Networks,” May 2005
- Song. H, S. Zhu, and G. Cao, “Attack-Resilient Time Synchronization for Wireless Sensor Networks,” Ad Hoc Networks, vol. 5, no. 1, pp. 112-125, Jan. 2007.
- Sun. H, P. Ning, C. Wang, A. Liu, and Y. Zhou, “TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks,” Proc. 13th ACM Conf. Computer and Comm. Security (CCS), pp. 264-271, Oct. 2006.
- B. Zhu, V.G.K. Addada, S. Setia, S. Jajodia, and S. Roy, “Efficient Distributed Detection of Node Replication Attacks in Sensor Networks,”Proc. 23rd Ann. Computer Security Applications Conf. (ACSAC ’07),2007.
- H. Sabbineni “Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks,”IEEE Trans. Computers, vol. 54, no. 1, Jan. 2005
- J. Newsome, E. Shi, D. Song, and A. Perrig, “The Sybil Attack in Sensor Networks: Analysis & Defenses,”Proc. Third Int’l Symp. Information Processing in Sensor Networks , 2004
- B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,”.
- T.J.Kwon and M.Gerla, “Efficient Flooding with Passive Clustering (PC) in Ad Hoc Networks,”ACM SIGCOMM Computer Comm. Rev.,vol. 32, no. 1, pp. 44-56, 2002.
Keywords: Replica detection, mobile sensor networks, security, distributed protocol, efficiency
Citation: R. Sheeba *, Anish Prem Jani, R. Sheeba , Anish Prem Jani ( 2013), Probabilistic cells in Replica Node Detection in Wireless Sensor Networks . , 1(1): 1-7
Received: 01/06/2024; Accepted: 01/06/2024;
Published: 01/06/2024
Edited by:
Mr.ERES JOURNALS