A New Random Walk for Replica Detection in WSNs

被引:15
作者
Aalsalem, Mohammed Y. [1 ]
Khan, Wazir Zada [1 ]
Saad, N. M. [2 ]
Hossain, Md. Shohrab [3 ]
Atiquzzaman, Mohammed [4 ]
Khan, Muhammad Khurram [5 ]
机构
[1] Jazan Univ, Farasan Networking Res Lab, Fac CS & IS, Jazan, Saudi Arabia
[2] Univ Teknol PETRONAS, Elect & Elect Engn Dept, Tronoh, Perak, Malaysia
[3] Bangladesh Univ Engn & Technol, Dept Comp Sci & Engn, Dhaka, Bangladesh
[4] Univ Oklahoma, Sch Comp Sci, Norman, OK USA
[5] King Saud Univ, Ctr Excellence Informat Assurance, Riyadh, Saudi Arabia
来源
PLOS ONE | 2016年 / 11卷 / 07期
关键词
WIRELESS SENSOR NETWORKS; DISTRIBUTED DETECTION; CLONE ATTACKS; SECURITY; PROTOCOL;
D O I
10.1371/journal.pone.0158072
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页数:20
相关论文
共 44 条
[1]  
Aalsalem M. Y., 2010, COMP SYST APPL AICCS, P1
[2]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[3]  
Angelopoulos CM, 2011, ACM INT SYM MOB MAN, P53
[4]  
[Anonymous], 2013, Principles of random walk
[5]  
[Anonymous], AD HOC NETWORKS, DOI DOI 10.1016/S1570-8705(03)00008-8
[6]  
[Anonymous], 2002, Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. WSNA'02, DOI [DOI 10.1145/570738.570750, 10.1145/570738.570750]
[7]  
[Anonymous], 1997, Handbook of Applied Cryptography
[8]  
[Anonymous], 2015, INT C SEC PRIV COMM
[9]   The power of choice in random walks: An empirical study [J].
Avin, Chen ;
Krishnainachari, Bhaskar .
COMPUTER NETWORKS, 2008, 52 (01) :44-60
[10]   On the detection of clones in sensor networks using random key predistribution [J].
Brooks, Richard ;
Govindaraju, P. Y. ;
Pirretti, Matthew ;
Vijaykrishnan, N. ;
Kandemir, Mahmut T. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2007, 37 (06) :1246-1258