Author:
Bin Saeed Muhammad O,Zerguine Azzedine,Zummo Salam A
Abstract
Abstract
A lot of work has been done recently to develop algorithms that utilize the distributed structure of an ad hoc wireless sensor network to estimate a certain parameter of interest. One such algorithm is called diffusion least-mean squares (DLMS). This algorithm estimates the parameter of interest using the cooperation between neighboring sensors within the network. The present work proposes an improvement on the DLMS algorithm by using a variable step-size LMS (VSSLMS) algorithm. In this work, first, the well-known variants of VSSLMS algorithms are compared with each other in order to select the most suitable algorithm which provides the best trade-off between performance and complexity. Second, the detailed convergence and steady-state analyses of the selected VSSLMS algorithm are performed. Finally, extensive simulations are carried out to test the robustness of the proposed algorithm under different scenarios. Moreover, the simulation results are found to corroborate the theoretical findings very well.
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Estrin D, Girod L, Pottie G, Srivastava M: Instrumenting the world with wireless sensor networks. In Proceedings of the ICASSP. Salt Lake City; 07–11 May 2001:2033-2036.
2. Olfati-Saber R, Fax JA, Murray RM: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 2007, 95(1):215-233.
3. Lopes CG, Sayed AH: Incremental adaptive strategies over distributed networks. IEEE Trans. Signal Process 2007, 55(8):4064-4077.
4. Ram SS, Nedic A, Veeravalli VV: Stochastic incremental gradient descent for estimation in sensor networks. In Proceedings of the 41st Asilomar Conference on Signals, Systems and Computers. Pacific Grove; 4–7 November 2007:582-586.
5. Rastegarnia A, Tinati MA, Khalili A: Performance analysis of quantized incremental LMS algorithm for distributed adaptive estimation. Signal Process 2010, 90(8):2621-2627. 10.1016/j.sigpro.2010.02.019
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献