scholarly journals A Four-point three-dimensional spatial localization algorithm based on RSSI

2020 ◽  
Vol 1550 ◽  
pp. 032022
Author(s):  
Li Ma ◽  
Ning Cao ◽  
Minghe Mao ◽  
Jianping Zhang
2017 ◽  
Vol 14 (5) ◽  
pp. 172988141773275 ◽  
Author(s):  
Francisco J Perez-Grau ◽  
Fernando Caballero ◽  
Antidio Viguria ◽  
Anibal Ollero

This article presents an enhanced version of the Monte Carlo localization algorithm, commonly used for robot navigation in indoor environments, which is suitable for aerial robots moving in a three-dimentional environment and makes use of a combination of measurements from an Red,Green,Blue-Depth (RGB-D) sensor, distances to several radio-tags placed in the environment, and an inertial measurement unit. The approach is demonstrated with an unmanned aerial vehicle flying for 10 min indoors and validated with a very precise motion tracking system. The approach has been implemented using the robot operating system framework and works smoothly on a regular i7 computer, leaving plenty of computational capacity for other navigation tasks such as motion planning or control.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Iram Javed ◽  
Xianlun Tang ◽  
Kamran Shaukat ◽  
Muhammed Umer Sarwar ◽  
Talha Mahboob Alam ◽  
...  

In a wireless sensor network (WSN), node localization is a key requirement for many applications. The concept of mobile anchor-based localization is not a new concept; however, the localization of mobile anchor nodes gains much attention with the advancement in the Internet of Things (IoT) and electronic industry. In this paper, we present a range-free localization algorithm for sensors in a three-dimensional (3D) wireless sensor networks based on flying anchors. The nature of the algorithm is also suitable for vehicle localization as we are using the setup much similar to vehicle-to-infrastructure- (V2I-) based positioning algorithm. A multilayer C-shaped trajectory is chosen for the random walk of mobile anchor nodes equipped with a Global Positioning System (GPS) and broadcasts its location information over the sensing space. The mobile anchor nodes keep transmitting the beacon along with their position information to unknown nodes and select three further anchor nodes to form a triangle. The distance is then computed by the link quality induction against each anchor node that uses the centroid-based formula to compute the localization error. The simulation shows that the average localization error of our proposed system is 1.4 m with a standard deviation of 1.21 m. The geometrical computation of localization eliminated the use of extra hardware that avoids any direct communication between the sensors and is applicable for all types of network topologies.


Author(s):  
Songhao Jia ◽  
Cai Yang ◽  
Xing Chen ◽  
Yan Liu ◽  
Fangfang Li

Background: In the applications of wireless sensor network technology, three-dimensional node location technology is crucial. The process of node localization has some disadvantages, such as the uneven distribution of anchor nodes and the high cost of the network. Therefore, the mobile anchor nodes are introduced to effectively solve accurate positioning. Objective: Considering the estimated distance error, the received signal strength indication technology is used to optimize the measurement of the distance. At the same time, dynamic stiffness planning is introduced to increase virtual anchor nodes. Moreover, the bird swarm algorithm is also used to solve the optimal location problem of nodes. Method: Firstly, the dynamic path is introduced to increase the number of virtual anchor nodes. At the same time, the improved RSSI distance measurement technology is introduced to the node localization. Then, an intelligent three-dimensional node localization algorithm based on dynamic path planning is proposed. Finally, the proposed algorithm is compared with similar algorithms through simulation experiments. Results: Simulation results show that the node coordinates obtained by the proposed algorithm are more accurate, and the node positioning accuracy is improved. The execution time and network coverage of the algorithm are better than similar algorithms. Conclusion: The proposed algorithm significantly improves the accuracy of node positioning. However, the traffic of the algorithm is increased. A little increase in traffic in exchange for positioning accuracy is worthy of recognition. The simulation results show that the proposed algorithm is robust and can be implemented and promoted in the future.


Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2790 ◽  
Author(s):  
Jitong Zhang ◽  
Mingrong Ren ◽  
Pu Wang ◽  
Juan Meng ◽  
Yuman Mu

High-precision indoor localization plays a vital role in various places. In recent years, visual inertial odometry (VIO) system has achieved outstanding progress in the field of indoor localization. However, it is easily affected by poor lighting and featureless environments. For this problem, we propose an indoor localization algorithm based on VIO system and three-dimensional (3D) map matching. The 3D map matching is to add height matching on the basis of previous two-dimensional (2D) matching so that the algorithm has more universal applicability. Firstly, the conditional random field model is established. Secondly, an indoor three-dimensional digital map is used as a priori information. Thirdly, the pose and position information output by the VIO system are used as the observation information of the conditional random field (CRF). Finally, the optimal states sequence is obtained and employed as the feedback information to correct the trajectory of VIO system. Experimental results show that our algorithm can effectively improve the positioning accuracy of VIO system in the indoor area of poor lighting and featureless.


2012 ◽  
Vol 155-156 ◽  
pp. 445-449
Author(s):  
Fu Cai Wan ◽  
Yu Ji Shen

Node positioning technology in wireless sensor network plays an important role in the whole network, and a lot of scholars engage in this field. According to the background that wireless sensor network is applied in Three-Dimensional space, an improved algorithm is proposed in this paper. The algorithm makes the average distance of each hop more rational through choosing the external anchor nodes. After the achievement of the unknown nodes positioning, initial positioning location would be corrected in order to get a higher positioning accuracy. Simulation results show that the accuracy of the improved algorithm is 13% higher than the traditional DV-Hop algorithm.


2019 ◽  
Vol 19 (21) ◽  
pp. 10003-10015 ◽  
Author(s):  
Xingjuan Cai ◽  
Penghong Wang ◽  
Lei Du ◽  
Zhihua Cui ◽  
Wensheng Zhang ◽  
...  

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Jiang Minlan ◽  
Luo Jingyuan ◽  
Zou Xiaokang

This paper proposes a three-dimensional wireless sensor networks node localization algorithm based on multidimensional scaling anchor nodes, which is used to realize the absolute positioning of unknown nodes by using the distance between the anchor nodes and the nodes. The core of the proposed localization algorithm is a kind of repeated optimization method based on anchor nodes which is derived from STRESS formula. The algorithm employs the Tunneling Method to solve the local minimum problem in repeated optimization, which improves the accuracy of the optimization results. The simulation results validate the effectiveness of the algorithm. Random distribution of three-dimensional wireless sensor network nodes can be accurately positioned. The results satisfy the high precision and stability requirements in three-dimensional space node location.


Sign in / Sign up

Export Citation Format

Share Document