scholarly journals UWB/BLE Tracking System for Elderly People Monitoring

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1574 ◽  
Author(s):  
Jerzy Kolakowski ◽  
Vitomir Djaja-Josko ◽  
Marcin Kolakowski ◽  
Katarzyna Broczek
Keyword(s):  
Elderly People ◽  
Tracking System ◽  
Localization Algorithm ◽  
People Tracking ◽  
Localization Accuracy ◽  
Adult Participation ◽  
Emergency Situations ◽  
Synchronization Method ◽  
System A ◽  
Anchor Nodes

Localization systems are the source of data that allows to evaluate elderly person’s behaviour, to draw conclusions concerning his or her health status and wellbeing, and to detect emergency situations. The article contains a description of a system intended for elderly people tracking. Two novel solutions have been implemented in the system: a hybrid localization algorithm and a method for wireless anchor nodes synchronization. The algorithm fuses results of time difference of arrival and received signal strength measurements in ultrawideband (UWB) and Bluetooth Low Energy (BLE) radio interfaces, respectively. The system allows to change the intensity of UWB packets transmission to adapt localization accuracy and energy usage to current needs and applications. In order to simplify the system installation, communication between elements of the system infrastructure instead of wire interfaces is performed over wireless ones. The new wireless synchronization method proposed in the article consists in retransmission of UWB synchronization packets by selected anchor nodes. It allows for extension of the system coverage, which is limited by the short range of UWB transmission. The proposed solution was experimentally verified. The synchronization method was tested in a laboratory, and the whole system’s performance was investigated in a typical flat. Exemplary results of the tests performed with older adult participation in their own homes are also included.

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.

scholarly journals Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Chenguang Shao
Keyword(s):  
Three Dimensional ◽  
Target Localization ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
2D And 3D ◽  
The Relationship

The target localization algorithm is critical in the field of wireless sensor networks (WSNs) and is widely used in many applications. In the conventional localization method, the location distribution of the anchor nodes is fixed and cannot be adjusted dynamically according to the deployment environment. The resulting localization accuracy is not high, and the localization algorithm is not applicable to three-dimensional (3D) conditions. Therefore, a Delaunay-triangulation-based WSN localization method, which can be adapted to two-dimensional (2D) and 3D conditions, was proposed. Based on the location of the target node, we searched for the triangle or tetrahedron surrounding the target node and designed the localization algorithm in stages to accurately calculate the coordinate value of the target. The relationship between the number of target nodes and the number of generated graphs was analysed through numerous experiments, and the proposed 2D localization algorithm was verified by extending it the 3D coordinate system. Experimental results revealed that the proposed algorithm can effectively improve the flexibility of the anchor node layout and target localization accuracy.

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.

Enhanced the Weighted Centroid Localization Algorithm Based on Received Strength Signal in Indoor Wireless Sensor Network

2020 ◽  
Vol 1 (1) ◽  
Author(s):  
Medhav Kumar Goonjur ◽  
◽  
Irfan Dwiguna Sumitra ◽  
Sri Supatmi ◽  
◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Maximum Error ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Scheme ◽  
Indoor Wireless ◽  
Anchor Nodes ◽  
Weighted Centroid Localization

A challenging problem that arises in the Wireless Sensor Network (WSN) is localization. It is essential for applications that need information about target positions, are inside an indoor environment. The Localization scheme presented in this experiment consists of four anchor nodes that change their position coordinates and one target node that is used to control the distance. The Localization algorithm designed in this paper makes use of the combination of two algorithms; the Received Strength Signal Indication (RSSI) and Weight Centroid Localization Algorithm (WCLA), called the RSSI-WCLA algorithm. The laboratory results show that the fusion between the RSSI-WCLA algorithm is outstanding than RSSI and WCLA algorithms itself in terms of localization accuracy. However, our proposed algorithm shows that the maximum error distance is less than 0.096m.

scholarly journals An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm

2015 ◽  
Vol 11 (9) ◽  
pp. 17 ◽  
Author(s):  
Xiaoying Yang ◽  
Wanli Zhang ◽  
Qixiang Song
Keyword(s):  
Localization Algorithm ◽  
Shuffled Frog Leaping Algorithm ◽  
Excellent Performance ◽  
Node Localization ◽  
Position Information ◽  
Localization Accuracy ◽  
Optimization Function ◽  
Anchor Nodes ◽  
Shuffled Frog Leaping ◽  
Unknown Node

According to that node localization accuracy is not high in the DV Hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of DV-Hop algorithm. A new DV-Hop algorithm based on shuffled frog leaping algorithm (Shuffled Frog Leaping DV-Hop Algorithm, SF LA DV-Hop) is proposed in this paper. Based on traditional DV-Hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of DV-Hop algorithm. The simulation results showed that compared with the traditional DV-Hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.

scholarly journals Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2860 ◽  
Author(s):  
Lijun Sun ◽  
Tianfei Chen
Keyword(s):  
Correction Coefficient ◽  
Localization Algorithm ◽  
Node Localization ◽  
Experimental Conditions ◽  
Correction Model ◽  
Essential Requirement ◽  
Localization Accuracy ◽  
Ranging Error ◽  
Anchor Nodes ◽  
Actual Contribution

Node localization is an essential requirement in the increasing prevalence of wireless sensor networks applications. As the most commonly used localization algorithm, the DV_Distance algorithm is more sensitive to ranging error, and also has lower localization accuracy. Therefore, this paper proposes a novel difference DV_Distance localization algorithm using correction coefficients of unknown nodes. Taking account of the fact that correction coefficients of unknown nodes should be different, the proposed method has employed the correction model based on unknown nodes. Some correction coefficients for different direction anchor nodes can be indirectly calculated using the known difference of actual Euclidean distance and corresponding accumulated hop distance between anchor nodes, and then the weighting factors for the correction coefficients of different direction anchor nodes are also computed according to their actual contribution degree, so as to make sure that the corrected distances from unknown nodes to anchor nodes, modified by the final correction coefficient, are closer to the actual distances. At last, the positions of unknown nodes can be calculated using multilateral distance measurement. The simulation results demonstrate that the proposed approach is a localization algorithm with easier implementation, and it not only has better performance on localization accuracy than existing DV_Distance localization algorithm, but also improves the localization stability under the same experimental conditions.

Research on the Bounding-Inbox Localization Algorithm for Wireless Sensor Networks Based on RSSI

2011 ◽  
Vol 135-136 ◽  
pp. 814-819
Author(s):  
Xue Cun Yang ◽  
Yuan Bin Hou ◽  
Ling Hong Kong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Underground Mine ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Simulating Experiment ◽  
The People ◽  
Anchor Nodes ◽  
Range Free

Aimed at the people localization in the underground mine, the bounding-inbox localization algorithm of wireless sensor networks based on RSSI is presented in this paper, which combines the merits of range-based and range-free localization methods. And, signal strength information between fixed anchor nodes and unknown ones is taken as the weights of bounding-inbox algorithm to calculate. The result of simulating experiment in underground mine environment proves that this algorithm is of less computing cost and can improve 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.

scholarly journals Improved recursive DV-Hop localization algorithm for average hop distance optimization

2021 ◽  
Vol 336 ◽  
pp. 07014
Author(s):  
Keqiang Ren ◽  
Panpan Wang
Keyword(s):  
Experimental Results ◽  
Localization Error ◽  
Localization Algorithm ◽  
Forgetting Factor ◽  
Recursion Method ◽  
Localization Accuracy ◽  
Related Literature ◽  
Anchor Nodes ◽  
Improved Algorithm

Aiming at the problem of DV-HOP algorithm with error and energy exhaustion, the average hop distance is used for optimization, and an improved recursion method is used to solve it. The algorithm first squares the distance of anchor nodes, proposes a forgetting factor to optimize the average hop distance between anchor nodes, and secondly uses recursive operations to replace anchor nodes with insufficient energy, so that the localization process of unknown nodes can continue. Experimental results show that compared with the DV-Hop algorithm and the algorithms in related literature, the improved algorithm can reduce the localization error to a certain extent and improve the localization accuracy of unknown nodes.

Sign in / Sign up

Export Citation Format

Share Document