IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v7y2011i1p756067.html
   My bibliography  Save this article

Performance Analysis of Distributed Incremental LMS Algorithm with Noisy Links

Author

Listed:
  • Azam Khalili
  • Mohammad Ali Tinati
  • Amir Rastegarnia

Abstract

Recently proposed distributed adaptive estimation algorithms for wireless sensor networks (WSNs) do not consider errors due to noisy links, which occur during the transmission of local estimates between sensors. In this paper, we study the effect of noisy links on the performance of distributed incremental least-mean-square (DILMS) algorithm for the case of Gaussian regressors. More specifically, we derive theoretical relations which explain how steady-state performance of DILMS algorithm (in terms of mean-square deviation (MSD), excess mean-square error (EMSE), and mean-square error (MSE)) is affected by noisy links. In our analysis, we use a spatial-temporal energy conservation argument to evaluate the steady-state performance of the individual nodes across the entire network. Our simulation results show that there is a good match between simulations and derived theoretical expressions. However, the important result is that unlike the ideal links case, the steady-state MSD, EMSE and MSE are not monotonically increasing functions of step size parameter when links are noisy. In addition, the optimal step size is found in a closed form for a special case which minimizes the steady-state values of MSD, EMSE, and MSE in each node.

Suggested Citation

  • Azam Khalili & Mohammad Ali Tinati & Amir Rastegarnia, 2011. "Performance Analysis of Distributed Incremental LMS Algorithm with Noisy Links," International Journal of Distributed Sensor Networks, , vol. 7(1), pages 756067-7560, January.
  • Handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:756067
    DOI: 10.1155/2011/756067
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2011/756067
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2011/756067?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:756067. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.