In-network-processing: distributed consensus-based linear estimation
In-network-processing: distributed consensus-based linear estimation
In a cooperative broadcast scenario, a group of nodes in a network aims to reconstruct a common message. In this paper, we present a new algorithm for distributed consensus-based estimation in such scenarios. Possible applications comprise mobile communication systems and sensor networks. Starting with a least squares estimation problem, the algorithm is developed using techniques from optimization theory. The required communication effort for parallel implementation in a resource-constrained network is estimated and compared to existing approaches. We show that the proposed algorithm requires fewer iterations and a reduced communication overhead per iteration while keeping the estimation accuracy. A modification of the algorithm based on an approximation is presented, which reduces the communication effort even further. All results are corroborated by computer simulations considering different system parameters.
59-62
Paul, Henning
9c90b207-e42f-467a-9f23-7e33e3bc43f8
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
January 2013
Paul, Henning
9c90b207-e42f-467a-9f23-7e33e3bc43f8
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
Paul, Henning, Fliege, Jörg and Dekorsy, Armin
(2013)
In-network-processing: distributed consensus-based linear estimation.
IEEE Communication Letters, 17 (1), .
(doi:10.1109/LCOMM.2012.112812.121788).
Abstract
In a cooperative broadcast scenario, a group of nodes in a network aims to reconstruct a common message. In this paper, we present a new algorithm for distributed consensus-based estimation in such scenarios. Possible applications comprise mobile communication systems and sensor networks. Starting with a least squares estimation problem, the algorithm is developed using techniques from optimization theory. The required communication effort for parallel implementation in a resource-constrained network is estimated and compared to existing approaches. We show that the proposed algorithm requires fewer iterations and a reduced communication overhead per iteration while keeping the estimation accuracy. A modification of the algorithm based on an approximation is presented, which reduces the communication effort even further. All results are corroborated by computer simulations considering different system parameters.
This record has no associated files available for download.
More information
e-pub ahead of print date: 30 November 2012
Published date: January 2013
Organisations:
Operational Research
Identifiers
Local EPrints ID: 342872
URI: http://eprints.soton.ac.uk/id/eprint/342872
PURE UUID: 05aa3684-6723-4e31-bfe0-82911b3ddbf0
Catalogue record
Date deposited: 17 Sep 2012 15:36
Last modified: 15 Mar 2024 03:30
Export record
Altmetrics
Contributors
Author:
Henning Paul
Author:
Armin Dekorsy
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics