scholarly journals Localization of isotropic and anisotropic wireless sensor networks in 2D and 3D fields

2021 ◽  
Author(s):  
Soumya J. Bhat ◽  
K. V. Santhosh
Keyword(s):  
Least Squares Method ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Smart Systems ◽  
Reference Node ◽  
Accurate Localization ◽  
Localization Algorithms ◽  
Node Ratio

AbstractInternet of Things (IoT) has changed the way people live by transforming everything into smart systems. Wireless Sensor Network (WSN) forms an important part of IoT. This is a network of sensor nodes that is used in a vast range of applications. WSN is formed by the random deployment of sensor nodes in various fields of interest. The practical fields of deployment can be 2D or 3D, isotropic or anisotropic depending on the application. The localization algorithms must provide accurate localization irrespective of the type of field. In this paper, we have reported a localization algorithm called Range Reduction Based Localization (RRBL). This algorithm utilizes the properties of hop-based and centroid methods to improve the localization accuracy in various types of fields. In this algorithm, the location unknown nodes identify the close-by neighboring nodes within a predefined threshold and localize themselves by identifying and reducing the probable range of existence from these neighboring nodes. The nodes which do not have enough neighbors are localized using the least squares method. The algorithm is tested in various irregular and heterogeneous conditions. The results are compared with a few state-of-the-art hop-based and centroid-based localization techniques. RRBL has shown an improvement in localization accuracy of 28% at 10% reference node ratio and 26% at 20% reference node ratio when compared with other localization algorithms.

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>

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 Localization of Sensor Nodes using Flooding in Wireless Sensor Networks

2013 ◽  
Vol 9 (3) ◽  
pp. 1153-1161
Author(s):  
Basavaraj K Madagouda ◽  
Varsha M Patil ◽  
Pradnya Godse
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks (WSN). In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel which uses forwarding a query message in flooding technique for localization using anchor nodes and once a node localized it acts as virtual anchor node and it helps to localize remaining sensor nodes. It is scheme to increase and upgrade the virtual anchor nodes, while the real number of physical anchors is the same as before.

Accuracy analysis of BLE beacon-based localization in smart buildings

2021 ◽  
pp. 1-20
Author(s):  
Rosen Ivanov
Keyword(s):  
Use Case ◽  
Accuracy Analysis ◽  
Localization Algorithm ◽  
Computing Power ◽  
Smart Buildings ◽  
Localization Accuracy ◽  
Positioning Systems ◽  
Deployment Strategy ◽  
Accurate Localization ◽  
Localization Algorithms

The majority of services that deliver personalized content in smart buildings require accurate localization of their clients. This article presents an analysis of the localization accuracy using Bluetooth Low Energy (BLE) beacons. The aim is to present an approach to create accurate Indoor Positioning Systems (IPS) using algorithms that can be implemented in real time on platforms with low computing power. Parameters on which the localization accuracy mostly depends are analyzed: localization algorithm, beacons’ density, deployment strategy, and noise in the BLE channels. An adaptive algorithm for pre-processing the signals from the beacons is proposed, which aims to reduce noise in beacon’s data and to capture visitor’s dynamics. The accuracy of five range-based localization algorithms in different use case scenarios is analyzed. Three of these algorithms are specially designed to be less sensitive to noise in radio channels and require little computing power. Experiments conducted in a simulated and real environment show that using proposed algorithms the localization accuracy less than 1 m can be obtained.

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.

Localization in Wireless Sensor Networks in Beacon Drifting Scenarios

2012 ◽  
Vol 562-564 ◽  
pp. 1234-1239
Author(s):  
Ming Xia ◽  
Qing Zhang Chen ◽  
Yan Jin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Probability Density ◽  
Sensor Nodes ◽  
Density Model ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Scenarios Simulation ◽  
Simulation Results

The beacon drifting problem occurs when the beacon nodes move accidentally after deployment. In this occasion, the localization results of sensor nodes in the network will be greatly affected and become inaccurate. In this paper, we present a localization algorithm in wireless sensor networks in beacon drifting scenarios. The algorithm first uses a probability density model to calculate the location reliability of each node, and in localization it will dynamically choose nodes with highest location reliabilities as beacon nodes to improve localization accuracy in beacon drifting scenarios. Simulation results show that the proposed algorithm achieves its design goals.

Incremental Multi-Hop Localization Algorithm Based on Regularized Weighted Least Squares

2019 ◽  
Vol 33 (09) ◽  
pp. 1959032 ◽  
Author(s):  
Ru-Lin Dou ◽  
Bo Hu ◽  
Wei-Juan Shi
Keyword(s):  
Least Squares ◽  
High Efficiency ◽  
Least Squares Method ◽  
Weighted Least Squares ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Weighted Least Squares Method ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Regularized Method

Incremental multi-hop localization algorithm applies to networks with broad range and low density of anchor nodes. However, during the localization process, it tends to be affected by accumulative errors and collinear problem between anchor nodes. We have proposed an incremental multi-hop localization algorithm based on regularized weighted least squares method, and the algorithm uses weighted least squares method to reduce the influence of accumulative errors and uses regularized method to weaken the collinear problem between anchor nodes. The results of both real experiment and simulative experiment show that compared to previous incremental multi-hop localization algorithms, the algorithm proposed in this paper can not only well solve the accumulated errors problem and obtain high localization accuracy, but it has also considered the influence of collinear problem on localization computation during the localization process. We evaluate our method based on various network scenes, and analyze its performance. We also compare our method with several existing methods, and demonstrate the high efficiency of our proposed method.

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.

Improved DV-Hop Algorithm for Enhancing Localization Accuracy in WSN

2014 ◽  
Vol 543-547 ◽  
pp. 3256-3259 ◽  
Author(s):  
Da Peng Man ◽  
Guo Dong Qin ◽  
Wu Yang ◽  
Wei Wang ◽  
Shi Chang Xuan
Keyword(s):  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Node Localization ◽  
Localization Accuracy ◽  
Global Average ◽  
Key Technologies ◽  
Simulation Results ◽  
Range Free

Node Localization technology is one of key technologies in wireless sensor network. DV-Hop localization algorithm is a kind of range-free algorithm. In this paper, an improved DV-Hop algorithm aiming to enhance localization accuracy is proposed. To enhance localization accuracy, average per-hop distance is replaced by corrected value of global average per-hop distance and global average per-hop error. When calculating hop distance, unknown nodes use corresponding average per-hop distance expression according to different hop value. Comparison with DV-Hop algorithm, simulation results show that the improved DV-Hop algorithm can reduce the localization error and enhance the accuracy of sensor nodes localization more effectively.

scholarly journals An Efficient Node Localization Approach with RSSI for Randomly Deployed Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Xihai Zhang ◽  
Junlong Fang ◽  
Fanfeng Meng
Keyword(s):  
Path Planning ◽  
Weighting Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Sensor Field ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Mobile Beacon

An efficient path planning approach in mobile beacon localization for the randomly deployed wireless sensor nodes is proposed in this paper. Firstly, in order to improve localization accuracy, the weighting function based on the distance between nodes is constructed. Moreover, an iterative multilateration algorithm is also presented to avoid decreasing the localization accuracy. Furthermore, a path planning algorithm based on grid scan which can traverse entirely in sensor field is described. At the same time, the start conditions of localization algorithm are also proposed to improve localization accuracy. To evaluate the proposed path planning algorithm, the localization results of beacon nodes randomly deployed in sensor field are also provided. The proposed approach can provide the deployment uniformly of virtual beacon nodes among the sensor fields and the lower computational complexity of path planning compared with method which utilizes only mobile beacons on the basis of a random movement. The performance evaluation shows that the proposed approach can reduce the beacon movement distance and the number of virtual mobile beacon nodes by comparison with other methods.

Sign in / Sign up

Export Citation Format

Share Document