Secure Localization Algorithms Against Localization Attacks in Wireless Sensor Networks

2021 ◽  
Author(s):  
Tu N. Nguyen ◽  
Vinh V. Le ◽  
Shao-I Chu ◽  
Bing-Hong Liu ◽  
Yao-Chuan Hsu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Secure Localization ◽  
Localization Algorithms

Secure localization algorithms for wireless sensor networks

2008 ◽  
Vol 46 (4) ◽  
pp. 96-101 ◽  
Author(s):  
A. Boukerche ◽  
H.A.B. Oliveira ◽  
E.F. Nakamura ◽  
A.A.F. Loureiro
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Secure Localization ◽  
Localization Algorithms

scholarly journals Research on Secure Localization Model Based on Trust Valuation in Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Li ◽  
Xiaotian Yu ◽  
He Xu ◽  
Jiewei Qian ◽  
Lu Dong ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Position Information ◽  
Secure Localization ◽  
Localization Algorithms ◽  
Localization Model ◽  
Proposed Model ◽  
And Performance

Secure localization has become very important in wireless sensor networks. However, the conventional secure localization algorithms used in wireless sensor networks cannot deal with internal attacks and cannot identify malicious nodes. In this paper, a localization based on trust valuation, which can overcome a various attack types, such as spoofing attacks and Sybil attacks, is presented. The trust valuation is obtained via selection of the property set, which includes estimated distance, localization performance, position information of beacon nodes, and transmission time, and discussion of the threshold in the property set. In addition, the robustness of the proposed model is verified by analysis of attack intensity, localization error, and trust relationship for three typical scenes. The experimental results have shown that the proposed model is superior to the traditional secure localization models in terms of malicious nodes identification and performance improvement.

scholarly journals IMPROVING LOCALIZATION ACCURACY IN WIRELESS SENSOR NETWORKS

2013 ◽  
pp. 152-156
Author(s):  
VINOD KUMAR ◽  
SATYENDRA YADAV ◽  
ASHUTOSH KUMAR SINGH
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Sequential Monte Carlo ◽  
Fundamental Problem ◽  
Geographical Location ◽  
Wireless Sensor ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Direction Of Movement

The most fundamental problem of wireless sensor networks is localization (finding the geographical location of the sensors). Most of the localization algorithms proposed for sensor networks are based on Sequential Monte Carlo (SMC) method. To achieve high accuracy in localization it requires high seed node density and it also suffers from low sampling efficiency. There are some papers which solves this problems but they are not energy efficient. Another approach The Bounding Box method was used to reduce the scope of searching the candidate samples and thus reduces the time for finding the set of valid samples. In this paper we propose an energy efficient approach which will further reduce the scope of searching the candidate samples, so now we can remove the invalid samples from the sample space and we can introduce more valid samples to improve the localization accuracy. We will consider the direction of movement of the valid samples, so that we can predict the next position of the samples more accurately, hence we can achieve high localization accuracy.

scholarly journals Secure and Robust 3D Localization in Wireless Sensor Networks

2019 ◽  
Vol 9 (1S) ◽  
pp. 104-111
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Malicious Nodes ◽  
3D Localization ◽  
Secure Localization ◽  
Simulation Results ◽  
Two Phases

The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.

Secure Range-Dependent Localization in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 2247-2252
Author(s):  
Jia Zhang ◽  
Hai Yan Zhang ◽  
Jin Na Lv ◽  
Yan Chang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Wireless Sensor ◽  
Location Information ◽  
Correct Information ◽  
Secure Localization ◽  
Localization Algorithms ◽  
Reference Signals ◽  
Almost All ◽  
Multiple Reference

In many applications of wireless sensor network (WSN), it is essential to ensure that sensors can determine their location, even in the presence of malicious adversaries. However, almost all the localization algorithms need the location information of reference nodes to locate the unknown nodes. When the location information is tempered by the attacks, the accuracy of these algorithms will degrade badly. We present a novel mechanism for secure localization. The mechanism aims to filter out malicious reference signals on the basis of the normal distribution trait among multiple reference signals. This will ensure each node to obtain correct information about its position in the presence of attackers. In this paper, a simulation circumstance which might be attacked is constructed to compare the improved algorithm with original one. The experiment results demonstrate that the proposed mechanism can effectively survive malicious attacks.

Sign in / Sign up

Export Citation Format

Share Document