Decentralized subspace tracking via gossiping
We consider a fully decentralized model for adaptively tracking the signal’s principal subspace, which arises in multi-sensor array detection and estimation problems. Our objective is to equip the network of dispersed sensors with a primitive for online spectrum sensing, which does not require a cen...
Saved in:
| Published in | Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems pp. 130 - 143 |
|---|---|
| Main Authors | , , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
Berlin, Heidelberg
Springer-Verlag
21.06.2010
|
| Series | ACM Other Conferences |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3642136508 9783642136504 |
| DOI | 10.5555/2163970.2163980 |
Cover
| Summary: | We consider a fully decentralized model for adaptively tracking the signal’s principal subspace, which arises in multi-sensor array detection and estimation problems. Our objective is to equip the network of dispersed sensors with a primitive for online spectrum sensing, which does not require a central fusion node. In this model, each node updates its local subspace estimate with its received data and a weighted average of the neighbors’ data. The quality of the estimate is measured by the total subspace mismatch of the individual subspace component estimates, which converge asymptotically in the Lyapunov sense. |
|---|---|
| ISBN: | 3642136508 9783642136504 |
| DOI: | 10.5555/2163970.2163980 |