An Improved Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 1049-1050 ◽  
pp. 2144-2148
Author(s):  
Ran Ran Li ◽  
Lei Li ◽  
Xiao Hui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Low Complexity ◽  
Position Estimation ◽  
Original Version ◽  
Wireless Sensor ◽  
Localization Algorithm

Min-Max localization algorithm is usually used to acquire the position of a sensor node in wireless sensor networks by the reason of its simpleness and low complexity. However, Min-Max algorithm provides a coarse position estimation. In order to increase its accuracy, an Extended Min-Max (E-Min-Max) algorithm has been proposed. In this paper we focus on this algorithm and propose an improved E-Min-Max algorithm to enhance its accuracy further. Simulations show that the improved E-Min-Max algorithm outperforms its original version in 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.

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.

A Range Free Acoustic Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 538 ◽  
pp. 502-507
Author(s):  
Jiang Shan Ai ◽  
Xiao Hong Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Background Noise ◽  
Low Complexity ◽  
Wireless Sensor ◽  
Perpendicular Bisector ◽  
Localization Algorithm ◽  
Acoustic Localization ◽  
Localization Precision ◽  
Range Free

For accomplishing acoustic location in wireless sensor networks (WSNs), a range free acoustic localization algorithm based on perpendicular bisector partition is proposed, taking into account of reducing computation complexity and reduce the interference of the background noise. Adopting a range free perpendicular bisector partition, the proposed method can find the sub-region of the source, and the time complexity is much lower than that of existing methods. According to extensive analysis on noise, the concept of noise sensitive region is derived. Experimental results show that the proposed method has a high localization precision and low complexity.

scholarly journals Optimized Low Complexity Sensor Node Positioning in Wireless Sensor Networks

2014 ◽  
Vol 14 (1) ◽  
pp. 39-46 ◽  
Author(s):  
Naveed Salman ◽  
Mounir Ghogho ◽  
Andrew H. Kemp
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Low Complexity ◽  
Wireless Sensor

scholarly journals Improved Recursive DV-Hop Localization Algorithm with RSSI Measurement for Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4152
Author(s):  
Sana Messous ◽  
Hend Liouane ◽  
Omar Cheikhrouhou ◽  
Habib Hamam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Position Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Recursive Computation

As localization represents the main backbone of several wireless sensor networks applications, several localization algorithms have been proposed in the literature. There is a growing interest in the multi-hop localization algorithms as they permit the localization of sensor nodes even if they are several hops away from anchor nodes. One of the most famous localization algorithms is the Distance Vector Hop (DV-Hop). Aiming to minimize the large localization error in the original DV-Hop algorithm, we propose an improved DV-Hop algorithm in this paper. The distance between unknown nodes and anchors is estimated using the received signal strength indication (RSSI) and the polynomial approximation. Moreover, the proposed algorithm uses a recursive computation of the localization process to improve the accuracy of position estimation. Experimental results show that the proposed localization technique minimizes the localization error and improves the localization accuracy.

scholarly journals Detecting Anonymous Target and Predicting Target Trajectories in Wireless Sensor Networks

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 719
Author(s):  
P. Leela Rani ◽  
G. A. Sathish Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Target Detection ◽  
Sensor Node ◽  
Minimum Energy ◽  
Maximum Error ◽  
Base Station ◽  
Position Estimation ◽  
Wireless Sensor

Target Tracking (TT) is an application of Wireless Sensor Networks (WSNs) which necessitates constant assessment of the location of a target. Any change in position of a target and the distance from each intermediate sensor node to the target is passed on to base station and these factors play a crucial role in further processing. The drawback of WSN is that it is prone to numerous constraints like low power, faulty sensors, environmental noises, etc. The target should be detected first and its path should be tracked continuously as it moves around the sensing region. This problem of detecting and tracking a target should be conducted with maximum accuracy and minimum energy consumption in each sensor node. In this paper, we propose a Target Detection and Target Tracking (TDTT) model for continuously tracking the target. This model uses prelocalization-based Kalman Filter (KF) for target detection and clique-based estimation for tracking the target trajectories. We evaluated our model by calculating the probability of detecting a target based on distance, then estimating the trajectory. We analyzed the maximum error in position estimation based on density and sensing radius of the sensors. The results were found to be encouraging. The proposed KF-based target detection and clique-based target tracking reduce overall expenditure of energy, thereby increasing network lifetime. This approach is also compared with Dynamic Object Tracking (DOT) and face-based tracking approach. The experimental results prove that employing TDTT improves energy efficiency and extends the lifetime of the network, without compromising the accuracy of tracking.

An Efficient Area-Based Localization Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 10 (10) ◽  
pp. 1062
Author(s):  
A. Mesmoudi ◽  
Mohammed Feham ◽  
Nabila Labraoui ◽  
Chakib Bekara
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Sensor Node ◽  
Large Scale ◽  
Performance Metrics ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

scholarly journals CWDV-Hop: A Hybrid Localization Algorithm With Distance-Weight DV-Hop and CSO for Wireless Sensor Networks

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 380-399
Author(s):  
Jiaxing Chen ◽  
Wei Zhang ◽  
Zhihua Liu ◽  
Rui Wang ◽  
Shujing Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Hybrid Localization
Sign in / Sign up

Export Citation Format

Share Document