Secure Localization Algorithms Against Localization Attacks in Wireless Sensor Networks

被引:0
作者
Tu N. Nguyen
Vinh V. Le
Shao-I Chu
Bing-Hong Liu
Yao-Chuan Hsu
机构
[1] Purdue University Fort Wayne,Department of Computer Science
[2] National Kaohsiung University of Science and Technology,Department of Electronic Engineering
来源
Wireless Personal Communications | 2022年 / 127卷
关键词
Wireless sensor network; Secure location; Independent attack; Collusion attack;
D O I
暂无
中图分类号
学科分类号
摘要
The accuracy of the location estimation of sensors in wireless sensor networks (WSNs) is important to many applications such as environment surveillance applications. In large-scale and distributed WSNs, locations of the sensors may not be recorded during the deployment process, resulting in the need of localization techniques to help collect the sensor location information. WSNs are highly vulnerable to localization attacks since the localization techniques totally rely on the neighboring relations to determine the location of sensors. In other words, some of malicious sensor nodes can take the advantage of the neighboring relations to manipulate the localization process. In this paper, we propose two localization algorithms to overcome both common types of localization attacks, independent attacks and collusion attacks. In the first algorithm, we propose the Improved Randomized Consistency Position Algorithm to determine the location of unknown nodes using the location estimation information provided by the three random anchor nodes and using the PSO algorithm paradigm to identify the coordinates of the unknown nodes’ location. In addition, the second algorithm, which is a combination of voting method, location optimization, and the PSO algorithm paradigm to identify the location of unknown nodes, is referred to as the Enhanced Attack-Resistant Secure Localization Algorithm. Through rigorous theoretical analysis and experimentation, we demonstrate that our proposed localization algorithms yield better performance comparing to the existing methods.
引用
收藏
页码:767 / 792
页数:25
相关论文
共 111 条
[1]  
Liu BH(2015)An efficient algorithm of constructing virtual backbone scheduling for maximizing the lifetime of dual-radio wireless sensor networks International Journal of Distributed Sensor Networks 11 475159-1350
[2]  
Pham VT(2016)A maximum-weight-independent-set-based algorithm for reader-coverage collision avoidance arrangement in rfid networks IEEE Sensors Journal 16 1342-1315
[3]  
Nguyen NT(2019)The mobile sensor deployment problem and the target coverage problem in mobile wireless sensor networks are np-hard IEEE Systems Journal 13 1312-110
[4]  
Liu B(2016)On maximizing the lifetime for data aggregation in wireless sensor networks using virtual data aggregation trees Computer Networks 105 99-60
[5]  
Nguyen N(2016)Constrained node-weighted Steiner tree based algorithms for constructing a wireless sensor network to cover maximum weighted critical square grids Computer Communications 81 52-2225
[6]  
Pham V(2017)Novel methods for energy charging and data collection in wireless rechargeable sensor networks International Journal of Communication Systems. 30 e3050-2196
[7]  
Yeh Y(2018)An efficient minimum-latency collision-free scheduling algorithm for data aggregation in wireless sensor networks IEEE Systems Journal 12 2214-2177
[8]  
Nguyen N(2018)Network under limited mobile devices: A new technique for mobile charging scheduling with multiple sinks IEEE Systems Journal 12 2186-5241
[9]  
Liu B(2018)Optimal solution for data collision avoidance in radio frequency identification networks Internet Technology Letters 1 e49-235
[10]  
Nguyen N-T(2017)Received-signal-strength threshold optimization using gaussian processes IEEE Transactions on Signal Processing 65 2164-3162