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.

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.

Node Location Model and Simulations in Matlab for Wireless Sensor Networks

2013 ◽  
Vol 694-697 ◽  
pp. 1060-1063 ◽  
Author(s):  
Fang Wei Liu ◽  
Zhi Long Shan
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Location Model ◽  
Sensor Nodes ◽  
System Level ◽  
Wireless Sensor ◽  
Location Error ◽  
Localization Algorithms ◽  
Node Location

The locations of sensor nodes are essential to Wireless Sensor Networks applications. Researchers have proposed many localization algorithms for Wireless Sensor Network and verified them through simulators. In this paper, a system-level node location model that aims to validate proposed algorithms for wireless sensor networks in Matlab environment is proposed. This model can reflect the reality networks effectively. Using this model, researchers can verify the performance of the localization algorithms including run time, location error, and location node numbers.

scholarly journals EARP: Extended Area Multihop Node Localization Algorithm for Anisotropic Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Yinghui Meng ◽  
Yuewen Chen ◽  
Qiuwen Zhang ◽  
Erlin Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Sensor Applications ◽  
Localization Algorithms ◽  
Extended Area ◽  
The Impact ◽  
Communication Path

Localization is one of the essential problems in the Internet of Things (IoT) and other wireless sensor applications. Most traditional range-free localization algorithms ignore the anisotropy factors, which are frequently observed in wireless sensor networks (WSNs) and result in low positioning precision. To mitigate the impact of anisotropy on localization, this paper proposes an extended area multihop node localization method. The proposed method classifies and discusses the boundaries of the concave area within the communication range of the node and then uses the maximum split communication distance of the node to identify and mark the boundary of the concave area. When the shortest communication path between the nodes is affected by the concave area, the boundary of the concave area is expanded to obtain the new shortest communication path, and the node distance is obtained by comparing the changes in the communication path. After a large number of simulation tests, it is shown that the calculation accuracy of this scheme is better than that of similar modern mainstream localization algorithms.

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 An Enhanced Hybrid 3D Localization Algorithm Based on APIT and DV-Hop

2017 ◽  
Vol 13 (09) ◽  
pp. 69 ◽  
Author(s):  
Lianjun Yi ◽  
Miaochao Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hybrid Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
3D Localization ◽  
Localization Algorithms ◽  
Wide Range

<p>Wireless sensor networks (WSN), as a new method of information collection and processing, has a wide range of applications. Since the acquired data must be bound with the location information of sensor nodes, the sensor localization is one of the supporting technologies of wireless sensor networks. However, the common localization algorithms, such as APIT algorithm and DV-Hop algorithm, have the following problems: 1) the localization accuracy of beacon nodes is not high; 2) low coverage rate in sparse environment. In this paper, an enhanced hybrid 3D localization algorithm is designed with combining the advantages of APIT algorithm and DV-Hop algorithm. The proposed hybrid algorithm can improve the localization accuracy of the beacon nodes in dense environments by reducing the triangles in the triangle interior point test (PIT) and selecting good triangles. In addition, the algorithm can combine the advantages of APIT algorithm and DV-Hop algorithm localization algorithm to calculate the unknown node coordinates, and also improve the location coverage of the beacon nodes in sparse environment. Simulation results show that the proposed hybrid algorithm can effectively improve the localization accuracy of beacon nodes in the dense environment and the location coverage of beacon nodes in sparse environment.</p>

Advanced Sequence-Based Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 651-653 ◽  
pp. 387-390 ◽  
Author(s):  
Fu Bin Zhou ◽  
Shao Li Xue
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Measuring Devices ◽  
Localization Algorithms ◽  
Positioning Algorithm ◽  
Range Free

As an important application of Internet of Things , Wireless Sensor Networks utilized in surveillance and other case.Localization of nodes in wireless sensor networks is the prerequisite and base of target tracking in some surveillance applications, so localization error of sensor nodes is a key. However, due to limited energy, unreliable link and limited communication ranges of sensor nodes, high accurate positioning is difficult to achieve, which made it hot and full of challenging for wireless sensor nodes to localize without any auxiliary facilities. Range-based localization algorithm , could achieve good accuracy but require measuring devices, thus it is not appropriate for large-scale wireless sensor networks.So range-free localization algorithms are more popular.This paper analyses the algorithms in range-free localization,and proposed Advanced Sequence-Based Localization algorithm to improve the performance of positioning algorithm in wireless sensor network.

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 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.

Householder Algorithm Applied to Localization for Wireless Sensor Networks

2012 ◽  
Vol 4 (1) ◽  
pp. 18-30 ◽  
Author(s):  
Abderrahim Beni Hssane ◽  
Moulay Lahcen Hasnaoui ◽  
Said Benkirane ◽  
Driss El Ouadghiri ◽  
Mohamed Laghdir
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Least Square ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithms ◽  
Node Location ◽  
New Formula ◽  
Range Free

Many applications in Wireless Sensor Networks (WSNs) must know the position of sensor nodes in the network. That is, information from the sensors is useful only if node location information is also available. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free algorithms. In this paper, the authors propose an Optimized DV-Hop (ODV-Hop), a localization range-free algorithm. The authors have used a new formula for computing the optimal hope size and used Householder algorithm for solving least square localization problem. Finally, simulation results show that the ODV-Hop achieves good location accuracy than normal DV-Hop.

Sign in / Sign up

Export Citation Format

Share Document