scholarly journals Distributed Asynchronous Fusion Algorithm for Sensor Networks with Packet Losses

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Tianpeng Chu ◽  
Guoqing Qi ◽  
Yinya Li ◽  
Andong Sheng
Keyword(s):  
Sensor Networks ◽  
Estimation Method ◽  
Distributed Estimation ◽  
Fusion Algorithm ◽  
Packet Losses ◽  
Packet Dropouts ◽  
Covariance Intersection ◽  
Measurement Equations ◽  
Simulation Results ◽  
Intersection Method

This paper is concerned with the problem of distributed estimation fusion over peer-to-peer asynchronous sensor networks with random packet dropouts. A distributed asynchronous fusion algorithm is proposed via the covariance intersection method. First, local estimator is developed in an optimal batch fashion by constructing augmented measurement equations. Then the fusion estimator is designed to fuse local estimates in the neighborhood. Both local estimator and fusion estimator are developed by taking into account the random packet losses. The presented estimation method improves local estimates and reduces the estimate disagreement. Simulation results validate the effectiveness of the proposed distributed asynchronous fusion algorithm.

A Distributed Multi-Robot Map Fusion Algorithm

2014 ◽  
Vol 536-537 ◽  
pp. 917-924
Author(s):  
Liang Zhang ◽  
Pei Yi Shen ◽  
Juan Song ◽  
Luo Bin Dong ◽  
Yan Zheng Zhang ◽  
...  
Keyword(s):  
Kalman Filter ◽  
Mahalanobis Distance ◽  
Relative Distance ◽  
Fusion Algorithm ◽  
New Approach ◽  
Unscented Transform ◽  
Covariance Intersection ◽  
Intersection Method ◽  
Initial Knowledge ◽  
Multi Robot

This paper proposes a new approach to the multi-robot map fusion algorithm that enables a team of robots to build a joint map without initial knowledge of their relative pose. First, the relative distance and bearing measurements between two robots are fused together by the covariance intersection method after they detect each other. Second, the transformation equations among multi robots coordinates are derived based on their relative distance and bearing measurements. Third, all the multi robots local maps are merged into one global map by unscented transform based on the transformation equations. Fourth, the possible duplicate features are filtered out by the robots maximal detection area and the features coordinate range, then the Mahalanobis distance is computed to decide the duplicate features correspondence through unscented transform, and the Kalman Filter is used while fusing the duplicate features information. As a means of validation for the proposed method, experimental results obtained from the two robots are presented.

An Obstacle-resistant Relay Node Placement in Constrained Environment

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Robots ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Simulation Results ◽  
Additional Hardware ◽  
Shape And Size

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

Multi-AUV Aided Cooperative 3D-localization for Underwater Sensor Networks

2020 ◽  
Vol 13 (1) ◽  
pp. 80-90 ◽  
Author(s):  
Meiyan Zhang ◽  
Wenyu Cai
Keyword(s):  
Sensor Networks ◽  
Mean Squared Error ◽  
Autonomous Underwater Vehicles ◽  
Estimation Method ◽  
Location Estimation ◽  
Underwater Sensor Networks ◽  
Coverage Ratio ◽  
Minimum Mean Squared Error ◽  
3D Localization ◽  
Localization Scheme

Background: Effective 3D-localization in mobile underwater sensor networks is still an active research topic. Due to the sparse characteristic of underwater sensor networks, AUVs (Autonomous Underwater Vehicles) with precise positioning abilities will benefit cooperative localization. It has important significance to study accurate localization methods. Methods: In this paper, a cooperative and distributed 3D-localization algorithm for sparse underwater sensor networks is proposed. The proposed algorithm combines with the advantages of both recursive location estimation of reference nodes and the outstanding self-positioning ability of mobile AUV. Moreover, our design utilizes MMSE (Minimum Mean Squared Error) based recursive location estimation method in 2D horizontal plane projected from 3D region and then revises positions of un-localized sensor nodes through multiple measurements of Time of Arrival (ToA) with mobile AUVs. Results: Simulation results verify that the proposed cooperative 3D-localization scheme can improve performance in terms of localization coverage ratio, average localization error and localization confidence level. Conclusion: The research can improve localization accuracy and coverage ratio for whole underwater sensor networks.

Sign in / Sign up

Export Citation Format

Share Document