Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 6 May 2014

EXTENDED-RANDOMIZED, EFFICIENT, DISTRIBUTED: A DYNAMIC DETECTION OF CLONE ATTACKS IN STATIC WIRELESS SENSOR NETWORKS

C. Geetha1 & M. Ramakrishnan1

Journal of Computer Science, Volume 10, Issue 10, pp. 1900–1907 · doi.org/10.3844/jcssp.2014.1900.1907

6,742 accesses4,407 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

A wireless sensor network is a collection of nodes organized in to a cooperative network. Each node consists of processing capability, multiple types of memory, a power source and actuators and sensors. This wireless sensor network is established in hostile and harsh environments like civil and military applications. This network is prone to various attacks. One of the major attack is clone attack. An adversary can capture the node and replicate the node including its cryptographic information and deploy these nodes in the network. This will lead to several problems like leaking the data, jamming the data flow, injecting false data etc. The RED protocol determined the witness node using pseudo-randomly but it is purely static. This study proposes eXtended-Randomized, Efficient, Distributed (X-RED), which detects clone nodes in the static wireless sensor networks in a dynamically fast manner. It is a distributed protocol, which computes the witness nodes dynamically. There is no pre-assumption in determining the witness node. We show that the protocol satisfies the major requirements of the distributed algorithms like the witness node is selected based on their id and location and also reduce the overhead. Simulation results show that our protocol is more efficient than other exiting protocols in terms of detection probability. This approach gives considerable amount of increase in detection probability than other existing protocols and also reduces the storage overhead. This study can be extended for mobile wireless network in the future.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Geetha, C. & Ramakrishnan, M. (2014). EXTENDED-RANDOMIZED, EFFICIENT, DISTRIBUTED: A DYNAMIC DETECTION OF CLONE ATTACKS IN STATIC WIRELESS SENSOR NETWORKS. Journal of Computer Science, 10(10), 1900–1907. https://doi.org/10.3844/jcssp.2014.1900.1907

Licence
© Science Publications
Issue
Volume 10, Issue 10
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
EXTENDED-RANDOMIZED, EFFICIENT, DISTRIBUTED: A DYNAMIC DETECTION OF CLONE ATTACKS IN STATIC WIRELESS SENSOR NETWORKSJournal of Computer Science · Volume 10, Issue 10 · pp. 1900–1907 · © Science PublicationsDownload