Distributed recursive least-squares for consensus-based in-network adaptive estimation

Gonzalo Mateos; Ioannis D. Schizas; Georgios B. Giannakis

doi:10.1109/TSP.2009.2024278

Distributed recursive least-squares for consensus-based in-network adaptive estimation

Gonzalo Mateos, Ioannis D. Schizas, Georgios B. Giannakis

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

119 Scopus citations

Abstract

Recursive least-squares (RLS) schemes are of paramount importance for reducing complexity and memory requirements in estimating stationary signals as well as for tracking nonstationary processes, especially when the state and/or data model are not available and fast convergence rates are at a premium. To this end, a fully distributed (D-) RLS algorithm is developed for use by wireless sensor networks (WSNs) whereby sensors exchange messages with one-hop neighbors to consent on the network-wide estimates adaptively. The WSNs considered here do not necessarily possess a Hamiltonian cycle, while the inter-sensor links are challenged by communication noise. The novel algorithm is obtained after judiciously reformulating the exponentially-weighted least-squares cost into a separable form, which is then optimized via the alternating-direction method of multipliers. If powerful error control codes are utilized and communication noise is not an issue, D-RLS is modified to reduce communication overhead when compared to existing noise-unaware alternatives. Numerical simulations demonstrate that D-RLS can outperform existing approaches in terms of estimation performance and noise resilience, while it has the potential of performing efficient tracking.

Original language	English (US)
Pages (from-to)	4583-4588
Number of pages	6
Journal	IEEE Transactions on Signal Processing
Volume	57
Issue number	11
DOIs	https://doi.org/10.1109/TSP.2009.2024278
State	Published - 2009

Bibliographical note

Funding Information:
Manuscript received January 07, 2009; accepted May 01, 2009. First published June 02, 2009; current version published October 14, 2009. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Biao Chen. Work in this paper was supported by the NSF Grants CCF 0830480 and CON 014658; and also by USDoD ARO Grant No. W911NF-05-1-0283, as well as through collaborative participation in the C&N Consortium sponsored by the U. S. ARL under the CTA Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.

Keywords

Distributed estimation
RLS algorithm
Wireless sensor networks (WSNs)

Access

10.1109/TSP.2009.2024278

OpenUrl availability

Full text

Cite this

@article{12daef4ba15d465a95d7598fb2486f33,

title = "Distributed recursive least-squares for consensus-based in-network adaptive estimation",

abstract = "Recursive least-squares (RLS) schemes are of paramount importance for reducing complexity and memory requirements in estimating stationary signals as well as for tracking nonstationary processes, especially when the state and/or data model are not available and fast convergence rates are at a premium. To this end, a fully distributed (D-) RLS algorithm is developed for use by wireless sensor networks (WSNs) whereby sensors exchange messages with one-hop neighbors to consent on the network-wide estimates adaptively. The WSNs considered here do not necessarily possess a Hamiltonian cycle, while the inter-sensor links are challenged by communication noise. The novel algorithm is obtained after judiciously reformulating the exponentially-weighted least-squares cost into a separable form, which is then optimized via the alternating-direction method of multipliers. If powerful error control codes are utilized and communication noise is not an issue, D-RLS is modified to reduce communication overhead when compared to existing noise-unaware alternatives. Numerical simulations demonstrate that D-RLS can outperform existing approaches in terms of estimation performance and noise resilience, while it has the potential of performing efficient tracking.",

keywords = "Distributed estimation, RLS algorithm, Wireless sensor networks (WSNs)",

author = "Gonzalo Mateos and Schizas, {Ioannis D.} and Giannakis, {Georgios B.}",

note = "Funding Information: Manuscript received January 07, 2009; accepted May 01, 2009. First published June 02, 2009; current version published October 14, 2009. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Biao Chen. Work in this paper was supported by the NSF Grants CCF 0830480 and CON 014658; and also by USDoD ARO Grant No. W911NF-05-1-0283, as well as through collaborative participation in the C&N Consortium sponsored by the U. S. ARL under the CTA Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.",

year = "2009",

doi = "10.1109/TSP.2009.2024278",

language = "English (US)",

volume = "57",

pages = "4583--4588",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - Distributed recursive least-squares for consensus-based in-network adaptive estimation

AU - Mateos, Gonzalo

AU - Schizas, Ioannis D.

AU - Giannakis, Georgios B.

N1 - Funding Information: Manuscript received January 07, 2009; accepted May 01, 2009. First published June 02, 2009; current version published October 14, 2009. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Biao Chen. Work in this paper was supported by the NSF Grants CCF 0830480 and CON 014658; and also by USDoD ARO Grant No. W911NF-05-1-0283, as well as through collaborative participation in the C&N Consortium sponsored by the U. S. ARL under the CTA Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.

PY - 2009

Y1 - 2009

N2 - Recursive least-squares (RLS) schemes are of paramount importance for reducing complexity and memory requirements in estimating stationary signals as well as for tracking nonstationary processes, especially when the state and/or data model are not available and fast convergence rates are at a premium. To this end, a fully distributed (D-) RLS algorithm is developed for use by wireless sensor networks (WSNs) whereby sensors exchange messages with one-hop neighbors to consent on the network-wide estimates adaptively. The WSNs considered here do not necessarily possess a Hamiltonian cycle, while the inter-sensor links are challenged by communication noise. The novel algorithm is obtained after judiciously reformulating the exponentially-weighted least-squares cost into a separable form, which is then optimized via the alternating-direction method of multipliers. If powerful error control codes are utilized and communication noise is not an issue, D-RLS is modified to reduce communication overhead when compared to existing noise-unaware alternatives. Numerical simulations demonstrate that D-RLS can outperform existing approaches in terms of estimation performance and noise resilience, while it has the potential of performing efficient tracking.

AB - Recursive least-squares (RLS) schemes are of paramount importance for reducing complexity and memory requirements in estimating stationary signals as well as for tracking nonstationary processes, especially when the state and/or data model are not available and fast convergence rates are at a premium. To this end, a fully distributed (D-) RLS algorithm is developed for use by wireless sensor networks (WSNs) whereby sensors exchange messages with one-hop neighbors to consent on the network-wide estimates adaptively. The WSNs considered here do not necessarily possess a Hamiltonian cycle, while the inter-sensor links are challenged by communication noise. The novel algorithm is obtained after judiciously reformulating the exponentially-weighted least-squares cost into a separable form, which is then optimized via the alternating-direction method of multipliers. If powerful error control codes are utilized and communication noise is not an issue, D-RLS is modified to reduce communication overhead when compared to existing noise-unaware alternatives. Numerical simulations demonstrate that D-RLS can outperform existing approaches in terms of estimation performance and noise resilience, while it has the potential of performing efficient tracking.

KW - Distributed estimation

KW - RLS algorithm

KW - Wireless sensor networks (WSNs)

UR - http://www.scopus.com/inward/record.url?scp=70350514091&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350514091&partnerID=8YFLogxK

U2 - 10.1109/TSP.2009.2024278

DO - 10.1109/TSP.2009.2024278

M3 - Article

AN - SCOPUS:70350514091

SN - 1053-587X

VL - 57

SP - 4583

EP - 4588

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 11

ER -

Distributed recursive least-squares for consensus-based in-network adaptive estimation

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this