scholarly journals A Multi-Objective DV-Hop Localization Algorithm Based on NSGA-II in Internet of Things

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 184 ◽  
Author(s):  
Penghong Wang ◽  
Fei Xue ◽  
Hangjuan Li ◽  
Zhihua Cui ◽  
Jinjun Chen
Keyword(s):  
Internet Of Things ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Nsga Ii ◽  
Multi Objective ◽  
Network Topologies ◽  
Objective Model ◽  
Distance Vector ◽  
Estimation Precision ◽  
Simulation Results

Locating node technology, as the most fundamental component of wireless sensor networks (WSNs) and internet of things (IoT), is a pivotal problem. Distance vector-hop technique (DV-Hop) is frequently used for location node estimation in WSN, but it has a poor estimation precision. In this paper, a multi-objective DV-Hop localization algorithm based on NSGA-II is designed, called NSGA-II-DV-Hop. In NSGA-II-DV-Hop, a new multi-objective model is constructed, and an enhanced constraint strategy is adopted based on all beacon nodes to enhance the DV-Hop positioning estimation precision, and test four new complex network topologies. Simulation results demonstrate that the precision performance of NSGA-II-DV-Hop significantly outperforms than other algorithms, such as CS-DV-Hop, OCS-LC-DV-Hop, and MODE-DV-Hop algorithms.

Based on RSSI Ranging Technology for DV-Hop Localization Algorithm of Wireless Sensor Network

2012 ◽  
Vol 442 ◽  
pp. 360-365 ◽  
Author(s):  
Yang Jun Zhong
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Approximate Calculation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Original Algorithm ◽  
Approximate Distance ◽  
Anchor Nodes ◽  
Simulation Results

For the DV-Hop algorithm of wireless sensor networks,there is an error arising problem that anchor nodes and location node hop distance is only an approximate calculation. A method based on the original Algorithm introducing RSSI ranging technique is proposed.Using RSSI ranging technology,we accord that if the anchor nodes is only a hop away from the location node,then decide whether using the DV-Hop algorithm to approach to the approximate distance between them. Simulation results show that the algorithm can effectively improve the error problems of calculating the hop distance between the anchor nodes and the location nodes, meanwhile improve the positioning accuracy of the node.

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.

scholarly journals Online Sequential DV-Hop Localization Algorithm for Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Sana Messous ◽  
Hend Liouane
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Average Distance ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Multihop Wireless ◽  
Distance Vector ◽  
Node Position

One of the main issues of wireless sensor networks is localization. Besides, it is important to track and analyze the sensed information. The technique of localization can calculate node position with the help of a set of designed nodes, denoted as anchors. The set density of these anchors may be incremented or decremented because of many reasons such as maintenance, lifetime, and breakdown. The well-known Distance Vector Hop (DV-Hop) algorithm is a suitable solution for localizing nodes having few neighbor anchors. However, existing DV-Hop-based localization methods have not considered the problem of anchor breakdown which may happen during the localization process. In order to avoid this issue, an Online Sequential DV-Hop algorithm is proposed in this paper to sequentially calculate positions of nodes and improve accuracy of node localization for multihop wireless sensor networks. The algorithm deals with the variation of the number of available anchors in the network. We note that DV-Hop algorithm is used in this article to process localization of nodes by a new optimized method for the estimation of the average distance of hops between nodes. Our proposed localization method is based on an online sequential computation. Compared with the original DV-Hop and other localization methods from the literature, simulation results prove that the proposed algorithm greatly minimizes the average of localization error of sensor nodes.

scholarly journals Energy-Level Jumping Algorithm for Global Optimization in Compressive Sensing-Based Target Localization

Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2502
Author(s):  
Tianjing Wang ◽  
Xinjie Guan ◽  
Xili Wan ◽  
Guoqing Liu ◽  
Hang Shen
Keyword(s):  
Global Optimization ◽  
Energy Level ◽  
Initial Point ◽  
Target Localization ◽  
Global Minimizer ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Simulation Results ◽  
Sparse Solutions ◽  
Recovery Problem

Target localization is one of the essential tasks in almost applications of wireless sensor networks. Some traditional compressed sensing (CS)-based target localization methods may achieve low-precision target localization because of using locally optimal sparse solutions. Solving global optimization for the sparse recovery problem remains a challenge in CS-based target localization. In this paper, we propose a novel energy-level jumping algorithm to address this problem, which achieves high-precision target localization by solving the globally optimal sparse solution of l p -norm ( 0 < p < 1 ) minimization. By repeating the process of energy-level jumping, our proposed algorithm establishes a global convergence path from an initial point to the global minimizer. Compared with existing CS-based target localization methods, the simulation results show that our localization algorithm obtain more accurate locations of targets with the significantly reduced number of measurements.

Multi-Objective Three-Dimensional DV-Hop Localization Algorithm With NSGA-II

2019 ◽  
Vol 19 (21) ◽  
pp. 10003-10015 ◽  
Author(s):  
Xingjuan Cai ◽  
Penghong Wang ◽  
Lei Du ◽  
Zhihua Cui ◽  
Wensheng Zhang ◽  
...  
Keyword(s):  
Three Dimensional ◽  
Localization Algorithm ◽  
Nsga Ii ◽  
Multi Objective

A Collaborative Multilateral Localization Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 303-306 ◽  
pp. 201-205
Author(s):  
Shao Ping Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Method ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Localization technology is one of the key supporting technologies in wireless sensor networks. In this paper, a collaborative multilateral localization algorithm is proposed to localization issues for wireless sensor networks. The algorithm applies anchor nodes within two hops to localize unknown nodes, and uses Nelder-Mead simplex optimization method to compute coordinates of the unknown nodes. If an unknown node can not be localized through two-hop anchor nodes, it is localized by anchor nodes and localized nodes within two hops through auxiliary iterative localization method. Simulation results show that the localization accuracy of this algorithm is very good, even in larger range errors.

A GPS-Less Cell-Based Localization Technique for Wireless Sensor Networks

2012 ◽  
Vol 601 ◽  
pp. 376-382
Author(s):  
Xue Jun Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Power Level ◽  
Wireless Sensor ◽  
Transmission Power ◽  
Localization Algorithm ◽  
Localization Technique ◽  
Simulation Results

This paper presents a localization algorithm, namely Circle Based Localization (CBL) for GPS-less wireless sensor networks. CBL works by finding the centroid of intersection of any two circles. Furthermore, we study the effect of power level mismatch among anchors. Simulation results show that CBL can significantly improve the accuracy by 5% while reducing the transmission power of anchors.

A Localization Method for WSN Based on Variable Transmission Power

2013 ◽  
Vol 694-697 ◽  
pp. 1055-1059
Author(s):  
Guang Xiong Huang ◽  
Zhi Long Shan
Keyword(s):  
Wireless Sensor Network ◽  
Wireless Sensor ◽  
Location Information ◽  
Transmission Power ◽  
Localization Algorithm ◽  
Localization Method ◽  
Position Accuracy ◽  
Variable Transmission ◽  
Simulation Results ◽  
Range Free

Localization is an essential technology in the application of wireless sensor network. As a range-free localization algorithm, DV-Hop works well in dense and isotropic networks, but not much in irregular and sparse topologies, especially in the big curvature of shortest path case. In this paper, location information beyond the communication range was obtained by means of variable transmission power of enhanced nodes. Besides, three schemes was proposed to meet the need of different scenarios. Moreover, the simulation results validate that our method can improve position accuracy about 20% and ameliorate the performance of DV-Hop in irregular scenario.

Centroid Localization Algorithm Based on the Anchor Nodes Cellular Distribution

2013 ◽  
Vol 475-476 ◽  
pp. 579-582 ◽  
Author(s):  
Dong Yao Zou ◽  
Teng Fei Han ◽  
Dao Li Zheng ◽  
He Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Cellular Network ◽  
Wireless Sensor ◽  
Cellular Distribution ◽  
Localization Algorithm ◽  
Matlab Simulation ◽  
Node Localization ◽  
Key Technologies ◽  
Anchor Nodes ◽  
Simulation Results

The node localization is one of the key technologies in wireless sensor networks. To the accurate positioning of the nodes as the premise and foundation, this paper presents a centroid localization algorithm based on Cellular network. First, the anchor nodes are distributed in a regular hexagonal cellular network. Unknown nodes collect the RSSI of the unknown nodes nearby, then select the anchor nodes whose RSSI is above the threshold. Finally, the average of these anchor nodes coordinates is the positioning results. MATLAB simulation results show that localization algorithm is simple and effective, it applies to the need for hardware is relatively low.

Sign in / Sign up

Export Citation Format

Share Document