A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Approximate distributed Kalman filtering in sensor networks with quantifiable performance
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
IEEE Transactions on Signal Processing
Amplify-and-Forward Cooperative Diversity Schemes for Multi-Carrier Systems
IEEE Transactions on Wireless Communications - Part 2
Hi-index | 0.00 |
In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly over fading channels. We consider different ways of using the available bandwidth, in terms of what each node can send to its neighbors. More specifically, we characterize the impact of local fusion and show how it is a suitable policy when graph connectivity is low. When poor link qualities are the main bottleneck, on the other hand, we show how a diversity approach can be more beneficial. The proposed framework highlights the underlying tradeoffs between fusion and diversity approaches in cooperative networks. It furthermore explores the impact of multiple sensing on the overall performance.