Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/22089
Title: Prevention of node replication attacks in wireless sensor networks using unified defense methods
Researcher: Anandkumar, K M
Guide(s): Jayakumar, C
Keywords: Distance Vector Based Detection
Information and communication engineering
Open System Interconnection
Wireless networks
Wireless Sensor Networks
Upload Date: 5-Aug-2014
University: Anna University
Completed Date: 01/11/2012
Abstract: The main objective of this research work is to develop an enhanced newlinealgorithm and methodology for solving node replication attack problems in newlinewireless sensor networks Wireless sensor networks may be deployed in hefty self organized and adaptable fields for many applications such as military environmental health care remote sensing Unfortunately the simplicity of the design of these sensors makes replication of compromised nodes easy by attackers inside or outside the network This replication attack is the entry point for a large span the number of sinister attacks During such an attack an adversary uses the credentials of a compromised node to introduce the replicas secretly into the network These replicas are then used to launch a variety of attacks that challenge the sensor applications Therefore the detection of node replication attacks called clone attacks in a wireless sensor network is a fundamental problem The proposed Secured Randomized Efficient and Distributed algorithm relates only to static sensor network This not only detects newlinebut isolates the clone node s This new algorithm is developed by the combined application of location and ID based detection methods The amendments made in the classical Randomized Efficient and Distributed algorithm ensure reliable and faster convergence in obtaining a global optimum The algorithm executes routinely at fixed intervals of time Every run of the protocol consists of three steps In the first step a random value isshared among all the nodes This random value can be broadcasted with a centralized mechanism In the second step each node digitally signs and locally broadcasts its claim ID and geographic location Then the third step involves using another witness through random selection to verify the statement of the first witness This ensures the security level of the network and overcomes the drawback of the classical RED Algorithm newline
Pagination: xxi, 172p.
URI: http://hdl.handle.net/10603/22089
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File68.69 kBAdobe PDFView/Open
02_certificate.pdf399.98 kBAdobe PDFView/Open
03_abstract.pdf28.13 kBAdobe PDFView/Open
04_acknowledgement.pdf20.01 kBAdobe PDFView/Open
05_contents.pdf57.53 kBAdobe PDFView/Open
06_chapter 1.pdf217.84 kBAdobe PDFView/Open
07_chapter 2.pdf66.2 kBAdobe PDFView/Open
08_chapter 3.pdf1.65 MBAdobe PDFView/Open
09_chapter 4.pdf801.39 kBAdobe PDFView/Open
10_chapter 5.pdf2.22 MBAdobe PDFView/Open
11_chapter 6.pdf2.28 MBAdobe PDFView/Open
12_chapter 7.pdf30.96 kBAdobe PDFView/Open
13_references.pdf56.46 kBAdobe PDFView/Open
14_publications.pdf29.59 kBAdobe PDFView/Open
15_vitae.pdf21.91 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: