The performance analysis of diffusion LMS algorithm in sensor networks based on quantized data and random topology

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the performance of diffusion LMS (Least-Mean-Square) algorithm for distributed parameter estimation problem over sensor networks with quantized data and random topology, where the data are quantized before transmission and the links are interrupted at random times. To achieve unbiased estimation of the unknown parameter, we add dither (small noise) to the sensor states before quantization. We first propose a diffusion LMS algorithm with quantized data and random link failures. We further analyze the stability and convergence of the proposed algorithmand derive the closed-formexpressions of theMSD (Mean-Square Deviation) and EMSE (Excess Mean-Square Errors), which characterize the steady-state performance of the proposed algorithm. We show that the convergence of the proposed algorithm is independent of quantized data and random topology. Moreover, the analytical results reveal which factors influence the network performance, and we show that the effect of quantization is the main factor in performance degradation of the proposed algorithm. We finally provide computer simulation results that illustrate the performance of the proposed algorithm and verify the results of the theoretical analysis.

Cite

CITATION STYLE

APA

Zhu, J., Zhang, M., Xu, C., Guan, J., & Zhang, H. (2016). The performance analysis of diffusion LMS algorithm in sensor networks based on quantized data and random topology. International Journal of Distributed Sensor Networks, 12(8). https://doi.org/10.1177/155014779685385

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free