Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-04-03
Computer Science
Distributed, Parallel, and Cluster Computing
Paper submitted to IEEE Transactions on Signal Processing, August 2007. Revised November 30, 2007. Accepted January 14, 2008
Scientific paper
10.1109/TSP.2008.924857
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have been proposed, with convergence conditions depending on the graph describing the interaction among the nodes. In most works, the graph is undirected and there are no propagation delays. Only recently, the analysis has been extended to consensus algorithms incorporating propagation delays. In this work, we propose a consensus algorithm able to converge to a globally optimal decision statistic, using a wideband wireless network, governed by a fairly simple MAC mechanism, where each link is a multipath, frequency-selective, channel. The main contribution of the paper is to derive necessary and sufficient conditions on the network topology and sufficient conditions on the channel transfer functions guaranteeing the exponential convergence of the consensus algorithm to a globally optimal decision value, for any bounded delay condition.
Barbarossa Sergio
Scutari Gesualdo
No associations
LandOfFree
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-352286