scholarly journals Distributed Estimation in Periodically Switching Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Jie Niu ◽  
Ya Zhang

This paper studies the distributed estimation problem of sensor networks, in which each node is periodically sensing and broadcasting in order. A consensus estimation algorithm is applied, and a weight design approach is proposed. The weights are designed based on an adjusting parameter and the nodes’ lengths of their shortest paths to the target node. By introducing a (T+2)-partite graph of the time-varying networks over a time period [0,T] and studying the relationships between the product of the time-sequence estimation error system matrices and the sequences of edges in the (T+2)-partite graph, a sufficient condition in terms of the observer gain and the adjusting parameter for the stability of the estimation error system is proposed. A simulation example is given to illustrate the results.

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2339 ◽  
Author(s):  
Xinyu Li ◽  
Qing Shi ◽  
Shuangyi Xiao ◽  
Shukai Duan ◽  
Feng Chen

Distributed estimation over sensor networks has attracted much attention due to its various applications. The mean-square error (MSE) criterion is one of the most popular cost functions used in distributed estimation, which achieves its optimality only under Gaussian noise. However, impulsive noise also widely exists in real-world sensor networks. Thus, the distributed estimation algorithm based on the minimum kernel risk-sensitive loss (MKRSL) criterion is proposed in this paper to deal with non-Gaussian noise, particularly for impulsive noise. Furthermore, multiple tasks estimation problems in sensor networks are considered. Differing from a conventional single-task, the unknown parameters (tasks) can be different for different nodes in the multitask problem. Another important issue we focus on is the impact of the task similarity among nodes on multitask estimation performance. Besides, the performance of mean and mean square are analyzed theoretically. Simulation results verify a superior performance of the proposed algorithm compared with other related algorithms.


2021 ◽  
Author(s):  
Sihai Guan ◽  
Qing Cheng ◽  
Yong Zhao ◽  
Bharat Biswal

Abstract To better perform distributed estimation, this paper, by combining the Fair cost function and adapt-then-combine scheme at all distributed network nodes, a novel diffusion adaptive estimation algorithm is proposed from an M-estimator perspective, which is called the diffusion Fair (DFair) adaptive filtering algorithm. The stability of the mean estimation error and the computational complexity of the DFair are theoretically analyzed. Compared with the RDLMS, DNLMM, DGCLD, and DPLMS algorithms, the simulation experiment results show that the DFair algorithm is more robust to input signals and impulsive interference. In conclusion, Theoretical analysis and simulation results show that the DFair algorithm performs better when estimating an unknown linear system in the changeable impulsive interference environments.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Sihai Guan ◽  
Qing Cheng ◽  
Yong Zhao ◽  
Bharat Biswal

AbstractTo better perform distributed estimation, this paper, by combining the Fair cost function and adapt-then-combine scheme at all distributed network nodes, a novel diffusion adaptive estimation algorithm is proposed from an M-estimator perspective, which is called the diffusion Fair (DFair) adaptive filtering algorithm. The stability of the mean estimation error and the computational complexity of the DFair are theoretically analyzed. Compared with the robust diffusion LMS (RDLMS), diffusion Normalized Least Mean M-estimate (DNLMM), diffusion generalized correntropy logarithmic difference (DGCLD), and diffusion probabilistic least mean square (DPLMS) algorithms, the simulation experiment results show that the DFair algorithm is more robust to input signals and impulsive interference. In conclusion, Theoretical analysis and simulation results show that the DFair algorithm performs better when estimating an unknown linear system in the changeable impulsive interference environments.


Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2830
Author(s):  
Sili Wang ◽  
Mark P. Panning ◽  
Steven D. Vance ◽  
Wenzhan Song

Locating underground microseismic events is important for monitoring subsurface activity and understanding the planetary subsurface evolution. Due to bandwidth limitations, especially in applications involving planetarily-distributed sensor networks, networks should be designed to perform the localization algorithm in-situ, so that only the source location information needs to be sent out, not the raw data. In this paper, we propose a decentralized Gaussian beam time-reverse imaging (GB-TRI) algorithm that can be incorporated to the distributed sensors to detect and locate underground microseismic events with reduced usage of computational resources and communication bandwidth of the network. After the in-situ distributed computation, the final real-time location result is generated and delivered. We used a real-time simulation platform to test the performance of the system. We also evaluated the stability and accuracy of our proposed GB-TRI localization algorithm using extensive experiments and tests.


Sign in / Sign up

Export Citation Format

Share Document