scholarly journals SDSWSN—A Secure Approach for a Hop-Based Localization Algorithm Using a Digital Signature in the Wireless Sensor Network

Electronics ◽  
2021 ◽  
Vol 10 (24) ◽  
pp. 3074
Author(s):  
Deepak Prashar ◽  
Mamoon Rashid ◽  
Shams Tabrez Siddiqui ◽  
Dilip Kumar ◽  
Amandeep Nagpal ◽  
...  
Keyword(s):  
Digital Signature ◽  
Wireless Sensor ◽  
Main Task ◽  
Sensitive Information ◽  
Localization Algorithm ◽  
Malicious Nodes ◽  
Localization Accuracy ◽  
Secure Localization ◽  
Node Compromise ◽  
The Impact

Localization and security are among the most dominant tasks of wireless sensor networks (WSN). For applications containing sensitive information on the location parameters of the event, secure localization is mandatory and must not be compromised at any cost. The main task, as if any node is malicious, is to authenticate nodes that are involved in the localization process. In this paper, we propose a secure hop-based algorithm that provides a better localization accuracy. In addition, to maintain the security of the localization process, the digital signature approach is used. Moreover, the impact of malicious nodes on the proposed scheme has also been observed. The proposed approach is also contrasted with the basic DV-Hop and improved DV-Hop based on error correction. From the simulation outcomes, we infer that this secure digital-signature-based localization strategy is quite robust against any node compromise attacks, thereby boosting its precision. Comparisons between the proposed algorithm and the state of the art were made on the grounds of different parameters such as the node quantity, ratio of anchor nodes, and range value towards the localization error.

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.

A Centroid Localization Algorithm for Wireless Sensor Networks Based on RSSI

2013 ◽  
Vol 303-306 ◽  
pp. 197-200 ◽  
Author(s):  
Yun Bai ◽  
Chun Ming Li ◽  
Yuan Xue
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Transmission Loss ◽  
Signal Transmission ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Development Environment ◽  
Localization Accuracy ◽  
Original Algorithm ◽  
The Impact

In this paper, a new triangle centroid localization algorithm for wireless sensor networks based on received signal strength indicator (RSSI) was demonstrated in great detail, and was simulated using MATLAB , and was compared with the original algorithm. Finally, wireless localization system based on CC2430/31 was set up in IAR development environment. Through hardware testing and comparison, The impact on the localization accuracy is illustrated about the signal transmission loss, beacon node density and outside interference. The superiority of this new algorithm is verified.

scholarly journals A Secure Localization Approach Using Mutual Authentication and Insider Node Validation in Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Hye-jin Kim ◽  
Rahul Saha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mutual Authentication ◽  
Location Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Localization Accuracy ◽  
Secure Localization ◽  
Random Node

Localization is a concerning issue in the applications of wireless sensor networks. Along with the accuracy of the location estimation of the sensor nodes, the security of the estimation is another priority. Wireless sensor networks often face various attacks where the attackers try to manipulate the estimated location or try to provide false beacons. In this paper, we have proposed a methodology that will address this problem of security aspects in localization of the sensor nodes. Moreover, we have considered the network environment with random node deployment and mobility as these two conditions are less addressed in previous research works. Further, our proposed algorithm provides low overhead due to the usage of less control messages in a limited transmission range. In addition, we have also proposed an algorithm to detect the malicious anchor nodes inside the network. The simulated results show that our proposed algorithm is efficient in terms of time consumption, localization accuracy, and localization ratio in the presence of malicious nodes.

Sequence Localization Algorithm Based on 3D Voronoi Diagram in Wireless Sensor Network

2014 ◽  
Vol 644-650 ◽  
pp. 4422-4426 ◽  
Author(s):  
Xi Yang ◽  
Jun Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Voronoi Diagram ◽  
Wireless Sensor ◽  
Weighted Estimate ◽  
Localization Algorithm ◽  
Simulation Experiments ◽  
Localization Accuracy ◽  
3D Space ◽  
Unknown Node

For nodes’ self-localization in wireless sensor networks (WSN), a new localization algorithm called Sequence Localization algorithm based on 3D Voronoi diagram (SL3V) is proposed, which uses 3D Voronoi diagram to divide the localization space.It uses the polyhedron vertices as the virtual beacon nodes and constructs the rank sequence table of virtual beacon nodes. Then it computes Kendall coefficients of the ranks in the optimal rank sequence table and that of the unknown node. Finally, it realizes the weighted estimate of the unknown node by normalization processing Kendall coefficients. Simulation experiments prove that itcan obviously improve the localization accuracy compared with the traditional 2D sequence-based localization and can satisfy the need of localization for 3D space.

An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2 (2) ◽  
pp. 16-35 ◽  
Author(s):  
Shrawan Kumar ◽  
D. K. Lobiyal
Keyword(s):  
Wireless Sensor Networks ◽  
Linear Programming ◽  
Sensor Networks ◽  
Problem Formulation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Location Accuracy ◽  
Localization Accuracy ◽  
Error Terms

Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.

scholarly journals Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Random Mutation ◽  
Localization Accuracy ◽  
De Algorithm ◽  
Distance Vector

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.

scholarly journals A Localization Algorithm of Wireless Sensor Network Based on Statistical Uncorrelated Vector

2017 ◽  
Vol 13 (07) ◽  
pp. 57
Author(s):  
Min Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Inner Product ◽  
Localization Algorithm ◽  
Product Matrix ◽  
Ranging Error ◽  
Location Algorithm ◽  
The Impact

<span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">For exploring wireless sensor network - a self-organized network, a new node location algorithm based on statistical uncorrelated vector (SUV) model, namely SUV location algorithm, is proposed. The algorithm, by translating the node coordinate, simplifies the solution to double center coordinate matrix, and gets the coordinate inner product matrix; then it uses statistical uncorrelated vectors to reconstruct the coordinates of the inner product matrix and remove the correlation of inner matrix of coordinates caused by the ranging error, so as to reduce the impact of ranging error on subsequent positioning accuracy. The experimental results show that the proposed algorithm does not consider the network traffic, bust still has good performance in localization. At last, it is concluded that reducing the amount of communication of sensor nodes is beneficial to prolong the service life of the sensor nodes, thus increasing the lifetime of the whole network.</span>

scholarly journals Security of Intelligent Building Network Based on Wireless Sensor Network

2018 ◽  
Vol 14 (06) ◽  
pp. 151
Author(s):  
Shuang Xu ◽  
Tong Zhou
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Low Cost ◽  
Security Analysis ◽  
Working Environment ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Intelligent Building ◽  
Intelligent Buildings ◽  
Secure Localization

<p class="0abstract"><span lang="EN-US">In order to study the intelligent buildings, the intelligent building network security of wireless sensor was explored. Because of its advantages of low cost, easy installation, low maintenance and update cost, wireless sensor network system was applied to intelligent building. In view of the characteristics of various influencing factors on the wireless sensor network working environment, node hardware cost and location accuracy, a secure localization algorithm based on DV-Hop was put forward. The security analysis results showed that the algorithm resisted external attacks and guaranteed the accuracy of location results. Based on the above findings, it is concluded that the algorithm can be used to protect the safety of wireless sensor network in building. </span></p>

Sign in / Sign up

Export Citation Format

Share Document