Secure Node Localization in Clustered Sensor Networks with Effective Key Revocation

2016 ◽  
pp. 12-41
Author(s):  
Rachit Mittal ◽  
Sarita Agrawal ◽  
Manik Lal Das
Keyword(s):  
Sensor Networks ◽  
Low Cost ◽  
Impersonation Attack ◽  
Node Localization ◽  
Secure Localization ◽  
Node Location ◽  
Node Capture ◽  
Key Revocation ◽  
Encryption And Authentication ◽  
Adversarial Model

Wireless sensor networks are deployed in unattended and hostile environment for many applications such as battlefield surveillance. The WSN applications may require knowing the locations of the node in the network to assist in neighbour discovery, selective information sharing and so on. The trivial approach to node localization is to equip each node with GPS. However, the cost and size of GPS enabled nodes make it impractical for resource-constrained, low cost WSNs. GPS-free node localization has been addressed using two different approaches - Beacon Based (BB) and Without Beacon Based (WBB). In BB approach, few nodes aware of their locations serve as beacons to help other nodes in the network localize themselves. In WBB approach, nodes need to localize themselves with the help of their neighbours only. Although, knowledge of nodes' location within network is desirable, exposure of node location information to adversary may lead to undesirable consequences, such as ease of planning for node capture attack, and hence the need of secure localization. The BB approach has been studied extensively under adversarial model and many algorithms based on BB approach have been proposed in literature in order to localize nodes in a secure manner. In contrast, WBB approach for node localization under adversarial model has not received substantial attention from researchers. In this chapter, we discuss static and dynamic key settings for node localization using WBB for node localization under adversarial model. We consider the Localized Combinatorial Keying (LEAP) and Localized Encryption and Authentication Protocol (LEAP) as the building block and propose a protocol for pair-wise key establishment and key revocation to facilitate secure node localization without using beacon nodes in mobile sensor networks, aiming at providing resilience against node impersonation attack and thus minimizing the impact of node capture threats. We provide a comparison of the improved protocol with other related protocols. We show that the improved protocol provides effective node localization in a secure manner with minimal node capture threats.

Secure Node Localization in Mobile Sensor Networks

2014 ◽  
Vol 3 (1) ◽  
pp. 18-33
Author(s):  
Rachit Mittal ◽  
Manik Lal Das
Keyword(s):  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Building Blocks ◽  
Mobile Sensor ◽  
Node Localization ◽  
Free Node ◽  
Node Capture ◽  
Encryption And Authentication ◽  
Adversarial Model ◽  
The Impact

Secure node localization in wireless sensor networks (WSN) has become an important research topic. Although, Global Positioning System (GPS) based node localization has got significant attention from researchers, GPS-free node localization trend is evolving in recent times. GPS-free node localization in mobile sensor networks can be constructed in two ways: Beacon based (BB) and Without Beacon based (WBB). The BB approach has been studied extensively under adversarial model and many algorithms based on BB approach have been proposed in literature in order to localize nodes in a secure manner. In contrast, WBB approach for node localization under adversarial model has not received substantial attention from researchers. In this paper, the authors discuss WBB approach for node localization under adversarial model. The authors discuss static and dynamic key settings for node localization using WBB approach. The authors present an improved protocol for node localization in mobile sensor networks, aiming at minimizing the impact of node capture threats. The authors consider the LEAP (Localized Encryption and Authentication Protocol) (Zhu, Setia, & Jajodia, 2003) and the LOCK (Localized Combinatorial Keying) (Eltoweissy, Moharrum, & Mukkamala, 2006) as the building blocks of their proposed scheme. The authors show that the improved protocol provides effective node localization in a secure manner with minimal node capture threats.

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.

scholarly journals Decomposition Based Localization for Anisotropic Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Baojian Gao ◽  
Xiaoning Zhao ◽  
Jun Wang ◽  
Xiaojiang Chen
Keyword(s):  
Sensor Networks ◽  
Euclidean Distance ◽  
Low Cost ◽  
Recognition Algorithm ◽  
Node Localization ◽  
Hop Count ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anisotropic Network ◽  
Range Free

Range-free localization algorithms have caused widespread attention due to their low cost and low power consumption. However, such schemes heavily depend on the assumption that the hop count distance between two nodes correlates well with their Euclidean distance, which will be satisfied only in isotropic networks. When the network is anisotropic, holes or obstacles will lead to the estimated distance between nodes deviating from their Euclidean distance, causing a serious decline in localization accuracy. This paper develops HCD-DV-Hop for node localization in anisotropic sensor networks. HCD-DV-Hop consists of two steps. Firstly, an anisotropic network is decomposed into several different isotropic subnetworks, by using the proposed Hop Count Based Decomposition (HCD) scheme. Secondly, DV-Hop algorithm is carried out in each subnetwork for node localization. HCD first uses concave/convex node recognition algorithm and cleansing criterion to obtain the optimal concave and convex nodes based on boundary recognition, followed by segmentation of the network’s boundary. Finally, the neighboring boundary nodes of the optimal concave nodes flood the network with decomposition messages; thus, an anisotropic network is decomposed. Extensive simulations demonstrated that, compared with range-free DV-Hop algorithm, HCD-DV-Hop can effectively reduce localization error in anisotropic networks without increasing the complexity of the algorithm.

Localization System Optimization in Wireless Sensor Networks (LSO-WSN)

2020 ◽  
pp. 1048-1081
Author(s):  
Surjit Singh ◽  
Rajeev Mohan Sharma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
System Optimization ◽  
Wireless Sensor ◽  
Computational Techniques ◽  
Computational Technique ◽  
Node Localization ◽  
Position Information ◽  
Localization System ◽  
Node Location

Localization of nodes in wireless sensor networks is needed to track/know the event origin and node location both, routing, network coverage and querying of sensor clusters. Wireless Sensor Networks (WSN) have different applications along with different challenges. Here, position information system is one of the challenging aspect that plays an important role in increasing the lifetime and survivability of WSN. And, the computational techniques have been successfully used in recent years to address the localization system of nodes in WSN. However it is very difficult to know about the best computational technique for optimizing localization system of nodes. This work intends to close the gap for selecting suitable computational technique for node localization system optimization. Our aim is to provide a better understanding of the current research trends in this field.

Localization System Optimization in Wireless Sensor Networks (LSO-WSN)

2017 ◽  
pp. 1-34 ◽  
Author(s):  
Surjit Singh ◽  
Rajeev Mohan Sharma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
System Optimization ◽  
Wireless Sensor ◽  
Computational Techniques ◽  
Computational Technique ◽  
Node Localization ◽  
Position Information ◽  
Localization System ◽  
Node Location

Localization of nodes in wireless sensor networks is needed to track/know the event origin and node location both, routing, network coverage and querying of sensor clusters. Wireless Sensor Networks (WSN) have different applications along with different challenges. Here, position information system is one of the challenging aspect that plays an important role in increasing the lifetime and survivability of WSN. And, the computational techniques have been successfully used in recent years to address the localization system of nodes in WSN. However it is very difficult to know about the best computational technique for optimizing localization system of nodes. This work intends to close the gap for selecting suitable computational technique for node localization system optimization. Our aim is to provide a better understanding of the current research trends in this field.

A Localization Algorithm of Nodes Based on Hypersphere Granular Computing in Wireless Sensor Networks

2014 ◽  
Vol 998-999 ◽  
pp. 1390-1393
Author(s):  
Yong He
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Training Set ◽  
Node Localization ◽  
Single Output ◽  
Node Location ◽  
Unknown Node

This paper proposes a node localization algorithm based on super chondritic calculation, super chondritic calculation scanning of a training set is able to complete the training process, the training has characteristics of fast, the problem of node localization for wireless sensor networks. Firstly, according to the related parameter information for the location of wireless sensor nodes, a multi input, multi output problem of training set, and then through the methods of grid division, location area, the original training set into the classification of multi input, single output training set, the super chondritic algorithm by scanning training, in order to get the relevant parameters, and the estimation of the unknown node location. Simulation results show that the proposed algorithm has better positioning accuracy.

scholarly journals An improved node localization algorithm based on DV-Hop for wireless sensor networks

2011 ◽  
Vol 8 (4) ◽  
pp. 953-972 ◽  
Author(s):  
Qingji Qian ◽  
Xuanjing Shen ◽  
Haipeng Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Location Error ◽  
Node Localization ◽  
Localization Algorithms ◽  
Node Location ◽  
The Impact

Sensor node localization is the basis for the entire wireless sensor networks. Because of restricted energy of the sensor nodes, the location error, costs of communication and computation should be considered in localization algorithms. DV-Hop localization algorithm is a typical positioning algorithm that has nothing to do with distance. In the isotropic dense network, DV-Hop can achieve position more precisely, but in the random distribution network, the node location error is great. This paper summed up the main causes of error based on the analysis on the process of the DV-Hop algorithm, aimed at the impact to the location error which is brought by the anchor nodes of different position and different quantity, a novel localization algorithm called NDVHop_Bon (New DV-Hop based on optimal nodes) was put forward based on optimal nodes, and it was simulated on Matlab. The results show that the new proposed location algorithm has a higher accuracy on localization with a smaller communication radius in the circumstances, and it has a wider range of applications.

Sign in / Sign up

Export Citation Format

Share Document