2007 · 97 citations · 5 references
ComputingComputer ScienceAlgorithmsDistributed SystemsOptimizationConvex OptimizationDistributed AlgorithmsDistributed ComputingPeer-to-peer NetworksSensor NetworksWireless Sensor NetworksCommunication Cost AnalysisConvergence Rate AnalysisDistributed Optimization
We propose a distributed algorithm that solves a special class of optimization problems using only peer-to- peer communication. One application is parameter estimation problems in sensor networks. Current decentralized algorithms for solving this class of optimization problems typically rely on passing around a parameter estimate in a ring consisting of all network nodes. In our algorithm, which extends the randomized incremental subgradient method with fixed stepsize due to Nedic and Bertsekas, nodes maintain individual estimates and need to exchange information only with their neighbors. We establish approach of the solution to an interval around the optimum value. We illustrate the algorithm's performance, in terms of convergence rate and communication cost relative to alternative schemes, through several numerical examples.
5
Keith Bush, John G. Kemeny, J. Laurie Snell · American Mathematical Monthly · 1960 · 1.6K citations
Distributed optimization in sensor networks
Michael Rabbat, Robert D. Nowak · 2004 · 917 citations
Fastest Mixing Markov Chain on a Graph
Stephen Boyd, Persi Diaconis, Lin Xiao · SIAM Review · 2004 · 761 citations
The value of clustering in distributed estimation for sensor networks
Sung-Hyun Son, Mung Chiang, Sanjeev R. Kulkarni et al. · 2005 · 44 citations