A New Random Walk for Replica Detection in WSNs

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division w...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2016-07, Vol.11 (7), p.e0158072-e0158072
Main Authors: Aalsalem, Mohammed Y, Khan, Wazir Zada, Saad, N M, Hossain, Md Shohrab, Atiquzzaman, Mohammed, Khan, Muhammad Khurram
Format: Article
Language:English
Subjects:
Access control
Algorithms
Analysis
Biology and Life Sciences
Cloning
Communication
Computer and Information Sciences
Computer Communication Networks
Computer memory
Computer science
Computer Security
Computer Simulation
Engineering and Technology
Expenditures
International conferences
Laboratories
Medicine and Health Sciences
Memory management
Nodes
Protocol (computers)
Random walk
Random walk theory
Remote sensors
Research and Analysis Methods
Security
Sensors
Software
Wireless networks
Wireless sensor networks
Wireless Technology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0158072