IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i4p1550147717703967.html

An improved incremental least-mean-squares algorithm for distributed estimation over wireless sensor networks

Author

Listed:
  • Mou Wu
  • Liansheng Tan
  • Rong Yang
  • Runze Wan

Abstract

Distributed parameter estimation problem has attracted much attention due to its important foundation of some applications in wireless sensor networks. In this work, we first investigate the performance tradeoff between existing incremental least-mean-squares algorithm and traditional steepest-descent algorithm from the aspects of initial convergence rate, steady-state convergence behavior, and oscillation, and present the motivations for improvements. Thereby we propose an improved incremental least-mean-squares distributed estimation algorithm that starts from the incremental least-mean-squares algorithm and works toward the objective of improvement on initial convergence rate and steady-state performance. The proposed algorithm meets the requirements of diminishing step size for wireless sensor networks without any increase in communication overhead and the mean stability condition is derived for a practical guideline. A target localization model in wireless sensor networks is used to illustrate the effect of the proposed algorithm. Simulation results confirm the performance improvement of our method, as well as the effectiveness of application in wireless sensor networks.

Suggested Citation

  • Mou Wu & Liansheng Tan & Rong Yang & Runze Wan, 2017. "An improved incremental least-mean-squares algorithm for distributed estimation over wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(4), pages 15501477177, April.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:4:p:1550147717703967
    DOI: 10.1177/1550147717703967
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717703967
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717703967?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
    ---><---

    References listed on IDEAS

    as
    1. Baxter, Matthew & Elgindy, Tarek & Ernst, Andreas T. & Kalinowski, Thomas & Savelsbergh, Martin W.P., 2014. "Incremental network design with shortest paths," European Journal of Operational Research, Elsevier, vol. 238(3), pages 675-684.
    2. Long Cheng & Chengdong Wu & Yunzhou Zhang & Hao Wu & Mengxin Li & Carsten Maple, 2012. "A Survey of Localization in Wireless Sensor Network," International Journal of Distributed Sensor Networks, , vol. 8(12), pages 962523-9625, December.
    3. Ali Eshragh & Jerzy Filar & Michael Haythorpe, 2011. "A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem," Annals of Operations Research, Springer, vol. 189(1), pages 103-125, September.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    2. Thomas Kalinowski & Sogol Mohammadian, 2021. "Feasible Bases for a Polytope Related to the Hamilton Cycle Problem," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1366-1389, November.
    3. Canca, David & Andrade-Pineda, José Luis & De-Los-Santos, Alicia & González-R, Pedro Luis, 2021. "A quantitative approach for the long-term assessment of Railway Rapid Transit network construction or expansion projects," European Journal of Operational Research, Elsevier, vol. 294(2), pages 604-621.
    4. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    5. Kalinowski, Thomas & Matsypura, Dmytro & Savelsbergh, Martin W.P., 2015. "Incremental network design with maximum flows," European Journal of Operational Research, Elsevier, vol. 242(1), pages 51-62.
    6. Averbakh, Igor & Pereira, Jordi, 2015. "Network construction problems with due dates," European Journal of Operational Research, Elsevier, vol. 244(3), pages 715-729.
    7. Yoon, Gyugeun & Chow, Joseph Y.J., 2024. "A sequential transit network design algorithm with optimal learning under correlated beliefs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 191(C).
    8. Michael Haythorpe & Walter Murray, 2022. "Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem," Computational Optimization and Applications, Springer, vol. 81(1), pages 309-336, January.
    9. Chagas, Rosklin Juliano & Valle, Cristiano Arbex & da Cunha, Alexandre Salles, 2018. "Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 57-71.
    10. Garrett, Richard A. & Sharkey, Thomas C. & Grabowski, Martha & Wallace, William A., 2017. "Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic," European Journal of Operational Research, Elsevier, vol. 257(1), pages 272-286.
    11. Andreas Bärmann & Alexander Martin & Hanno Schülldorf, 2017. "A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany," Transportation Science, INFORMS, vol. 51(4), pages 1102-1121, November.
    12. Xiaowei Guo & Thomas C. Sharkey, 2026. "Maxflow-Based Integrated Network Design and Scheduling Problems with Downgraded Capacities," SN Operations Research Forum, Springer, vol. 7(1), pages 1-53, March.
    13. Ali Eshragh & Jerzy A. Filar & Thomas Kalinowski & Sogol Mohammadian, 2020. "Hamiltonian Cycles and Subsets of Discounted Occupational Measures," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 713-731, May.
    14. Wang, Zhuolin & You, Keyou & Song, Shiji & Zhang, Yuli, 2020. "Wasserstein distributionally robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 31-43.
    15. Iloglu, Suzan & Albert, Laura A., 2018. "An integrated network design and scheduling problem for network recovery and emergency response," Operations Research Perspectives, Elsevier, vol. 5(C), pages 218-231.
    16. Ni, Ni & Howell, Brendan J. & Sharkey, Thomas C., 2018. "Modeling the impact of unmet demand in supply chain resiliency planning," Omega, Elsevier, vol. 81(C), pages 1-16.
    17. Hongtan Sun & Thomas C. Sharkey, 2017. "Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems," Journal of Global Optimization, Springer, vol. 68(3), pages 623-640, July.
    18. Tianyu Wang & Igor Averbakh, 2022. "Network construction/restoration problems: cycles and complexity," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 51-73, August.
    19. Konstantin Avrachenkov & Ali Eshragh & Jerzy A. Filar, 2016. "On transition matrices of Markov chains corresponding to Hamiltonian cycles," Annals of Operations Research, Springer, vol. 243(1), pages 19-35, August.
    20. Natashia Boland & Thomas Kalinowski & Simranjit Kaur, 2016. "Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 885-905, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:13:y:2017:i:4:p:1550147717703967. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.