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.

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 A Novel Centroid Localization for Wireless Sensor Networks

2012 ◽  
Vol 8 (1) ◽  
pp. 829253 ◽  
Author(s):  
Yu Liu ◽  
Xiao Yi ◽  
You He
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Key Issues ◽  
Alternate Solution

Self-localization of sensor nodes is one of the key issues in wireless sensor networks. Based on the analysis of traditional range-free algorithms such as centroid and APIT (approximate perfect point in triangulation test) schemes, the effect of random deployment of all nodes on node localization is researched. And then, an improved centroid localization algorithm (ICLA) based on APIT and the quality of perpendicular bisector is proposed. In ICLA, nodes are categorized into several kinds and localized, respectively. Extensive simulation results indicate that ICLA obtains a better localization result in random topology networks without any additional hardware. Therefore, ICLA can be an alternate solution for the node self-localization problem in large-scale wireless sensor networks.

Taxonomy on Localization Issues and Challenges in Wireless Sensor Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 193-202
Author(s):  
Amit Sharma ◽  
Pradeep K. Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Harsh Environments ◽  
Localization Algorithm ◽  
Hardware Cost ◽  
Localization Algorithms ◽  
Unknown Node

Background: In Wireless Sensor Networks, Localization is the most dynamic field for research. The data extracted from the sensor nodes that carries physical location information is very much helpful in WSNs as it is useful in major applications such as for the purpose of monitoring of any environment, tracking and for the detection purpose. Localization is known as the estimation of unknown node locations and its positions by communicating through localized nodes as well as unlocalized nodes. Objective: The aim of this study is to present classification of various localization algorithms and to compare them. Methods: The prime consideration is to know that how localization affects the network lifetime and how these algorithms work for increasing the lifetime of a network in a severe. Results: This paper also aims for finding the position of the node with respect to range based, anchor based and distributed localization techniques for harsh environments. Additionally, this paper also features the concern that occurs with these localization techniques. Conclusion: The technique that gives highly accurate location coordinates and having less hardware cost is distributed RSSI based localization algorithm.

scholarly journals Localization Algorithm Based on Iterative Centroid Estimation for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Rui Jiang ◽  
Xin Wang ◽  
Li Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Node ◽  
Centroid Estimation ◽  
Anchor Nodes ◽  
Localization Precision ◽  
Unknown Node ◽  
Received Signal Strength Indication

According to the application of range-free localization technology for wireless sensor networks (WSNs), an improved localization algorithm based on iterative centroid estimation is proposed in this paper. With this methodology, the centroid coordinate of the space enclosed by connected anchor nodes and the received signal strength indication (RSSI) between the unknown node and the centroid are calculated. Then, the centroid is used as a virtual anchor node. It is proven that there is at least one connected anchor node whose distance from the unknown node must be farther than the virtual anchor node. Hence, in order to reduce the space enclosed by connected anchor nodes and improve the location precision, the anchor node with the weakest RSSI is replaced by this virtual anchor node. By applying this procedure repeatedly, the localization algorithm can achieve a good accuracy. Observing from the simulation results, the proposed algorithm has strong robustness and can achieve an ideal performance of localization precision and coverage.

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.

Sign in / Sign up

Export Citation Format

Share Document