scholarly journals Experimental Evaluation of an RSSI-Based Localization Algorithm on IoT End-Devices

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3931 ◽  
Author(s):  
Rosa Pita ◽  
Ramiro Utrilla ◽  
Roberto Rodriguez-Zurrunero ◽  
Alvaro Araujo

In recent years, wireless sensor networks (WSNs) have experienced a significant growth as a fundamental part of the Internet of Things (IoT). WSNs nodes constitute part of the end-devices present in the IoT, and in many cases location data of these devices is expected by IoT applications. For this reason, many localization algorithms for WSNs have been developed in the last years, although in most cases the results provided are obtained from simulations that do not consider the resource constraints of the end-devices. Therefore, in this work we present an experimental evaluation of a received signal strength indicator (RSSI)-based localization algorithm implemented on IoT end-devices, comparing its results with those obtained from simulations. We have implemented the fuzzy ring-overlapping range-free (FRORF) algorithm with some modifications to make its operation feasible on resource-constrained devices. Multiple tests have been carried out to obtain the localization accuracy data in three different scenarios, showing the difference between simulation and real results. While the overall behaviour is similar in simulations and in real tests, important differences can be observed attending to quantitative accuracy results. In addition, the execution time of the algorithm running in the nodes has been evaluated. It ranges from less than 10 ms to more than 300 ms depending on the fuzzification level, which demonstrates the importance of evaluating localization algorithms in real nodes to prevent the introduction of large overheads that may not be affordable by resource-constrained nodes.

Author(s):  
Rosen Ivanov

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.


2015 ◽  
Vol 740 ◽  
pp. 823-829
Author(s):  
Meng Long Cao ◽  
Chong Xin Yang

Firstly, the characteristics of regular Zigbee localization algorithms-the received signal strength indicator algorithm (RSSI) and the weighted centroid localization algorithm are introduced. Then, the factors of the errors existing in the aforementioned algorithms are analyzed. Based on these above, the improved RSSI algorithm-correction geometric measurement based on weighted is proposed. Finally, utilizing this algorithm to design and implement the localization nodes, which have the CC2431 wireless microcontroller on them. The simulation and experimental results show that the accuracy of this localization algorithm improved about 2%, comparing with the regular algorithms.


Author(s):  
Soumya J. Bhat ◽  
K. V. Santhosh

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.


Author(s):  
Ru-Lin Dou ◽  
Bo Hu ◽  
Wei-Juan Shi

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.


2011 ◽  
Vol 2011 ◽  
pp. 1-7
Author(s):  
Oscar Rodríguez ◽  
Tomoaki Ohtsuki

We introduce a system for multiple target range-based localization systems, such as those based on time-of-arrival (TOA) and received signal strength indicator (RSSI) for distance measurement estimations. In order to improve the accuracy of the location estimation for all target nodes, our system makes use of distance estimations between target nodes as well as between anchor and target nodes, and weights for all nodes. We propose variations on two popular localization algorithms and compare their accuracy against that of the conventional algorithms using simulations and experiments. Our results show that our proposal consistently offers a better localization accuracy than the conventional algorithms.


2017 ◽  
Vol 13 (09) ◽  
pp. 69 ◽  
Author(s):  
Lianjun Yi ◽  
Miaochao Chen

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


Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4152
Author(s):  
Sana Messous ◽  
Hend Liouane ◽  
Omar Cheikhrouhou ◽  
Habib Hamam

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.


2014 ◽  
Vol 543-547 ◽  
pp. 989-992
Author(s):  
Xiao Qin Li ◽  
Guang Rong Chen

The node self-localization is the basis of target localization for wireless sensor network (WSN), the WSN nodes localization algorithms have two types based on distance and non distance. The node localization based on RSSI is simple and widely used in application. According to the traditional WSN nodes localization algorithm, the RSSI signal intensity changes greatly and with nonlinearity. And it is converted into distance feature with a large deviation, which leads to inaccurate positioning and localization. In order to solve this problem, a sensor node localization algorithm is proposed based on fuzzy RSSI distance. The nodes information is collected based on RSSI ranging method. And the location information is processed with fuzzy operation. The disturbance from the environmental factors for the positioning is solved. The accuracy of the node localization is improved. Simulation result shows that this algorithm can locate the sensor nodes accurately. The localization accuracy is high, and the performance of nodes localization is better than the traditional algorithm. It has good application value in the WSN nodes distribution and localization design.


2012 ◽  
Vol 192 ◽  
pp. 401-405 ◽  
Author(s):  
Kai Sheng Zhang ◽  
Ya Ming Xu ◽  
Wu Yang ◽  
Qian Zhou

How to enhance the accuracy of sensor node self-localization for limited energy resource networks is an important problem in the study of wireless sensor networks (WSNs). Concerning the advantages and disadvantages of some main algorithms for senor node self-localization, an easy and simple algorithm is proposed to locate the unknown node itself. The algorithm is to improve weight centroid localization (WCL), by the way of determining weight through using the proportion of differential received signal strength indicator (RSSI) that are derived from unknown node and criterion nodes. In contrast to WCL, the algorithm has the strengths of less computation and better determination of weight, and the determination of weight shows more distinguished distinction in the effect on the localization of unknown node, which is caused by various beacon nodes. Simulations demonstrate that the algorithm has a higher localization accuracy than WCL


Sign in / Sign up

Export Citation Format

Share Document