Secure localization of multiple spoofing attackers

2014 ◽  
Author(s):  
M. Vijayalakshmi ◽  
S. Banumathi
Keyword(s):  
Secure Localization

SecRET

2021 ◽  
Vol 15 (1) ◽  
pp. 1-26
Author(s):  
Sudip Misra ◽  
Tamoghna Ojha ◽  
Madhusoodhanan P
Keyword(s):  
Sensor Networks ◽  
Error Rates ◽  
Location Information ◽  
Underwater Sensor Networks ◽  
Node Localization ◽  
Limited Bandwidth ◽  
Secure Localization ◽  
Localization Scheme ◽  
Monitoring Application ◽  
Fundamental Requirement

Node localization is a fundamental requirement in underwater sensor networks (UWSNs) due to the ineptness of GPS and other terrestrial localization techniques in the underwater environment. In any UWSN monitoring application, the sensed information produces a better result when it is tagged with location information. However, the deployed nodes in UWSNs are vulnerable to many attacks, and hence, can be compromised by interested parties to generate incorrect location information. Consequently, using the existing localization schemes, the deployed nodes are unable to autonomously estimate the precise location information. In this regard, similar existing schemes for terrestrial wireless sensor networks are not applicable to UWSNs due to its inherent mobility, limited bandwidth availability, strict energy constraints, and high bit-error rates. In this article, we propose SecRET , a <underline>Sec</underline>ure <underline>R</underline>ange-based localization scheme empowered by <underline>E</underline>vidence <underline>T</underline>heory for UWSNs. With trust-based computations, the proposed scheme, SecRET , enables the unlocalized nodes to select the most reliable set of anchors with low resource consumption. Thus, the proposed scheme is adaptive to many attacks in UWSN environment. NS-3 based performance evaluation indicates that SecRET maintains energy-efficiency of the deployed nodes while ensuring efficient and secure localization, despite the presence of compromised nodes under various attacks.

Secure Localization in Sensor Networks

2006 ◽  
pp. 291-310
Author(s):  
Karthikeyan Ravichandran ◽  
Krishna Sivalingam
Keyword(s):  
Sensor Networks ◽  
Secure Localization

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