Abstract—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The problem class has wide applications in estimation, detection, localization, coordination and resource-sharing. We focus on peer-to-peer algorithms where nodes only exchange data with their immediate neighbors, and consider three distinct alternatives: a dual-based broadcast algorithm, a novel stochastic unicast algorithm, and a linear broadcast algorithm tailored for least-squares problems. We implement the algorithms in the network simulator NS2 and present extensive simulation results for random topologies. I
Abstract—We propose a class of convex relaxations to solve the sensor network localization problem, ...
We propose an efficient solution to peer-to-peer localization in a wireless sensor network which wor...
We consider a convex optimization problem for non-hierarchical agent networks where each agent has a...
This dissertation deals with developing optimization algorithms which can be distributed over a netw...
Motivated by a peer-to-peer estimation algorithm in which adaptive weights are optimized to minimize...
The focus of this thesis is to implement various distributed optimization algorithms on a physical w...
In this paper we study two problems which often occur in various applications arising in wireless se...
In this paper, we consider a general problem setup for a wide class of convex and robust distributed...
In this paper we consider a general problem set-up for a wide class of convex and robust distributed...
Abstract-This paper considers the problem of power-efficient distributed estimation of vector parame...
<p>This thesis is concerned with the design of distributed algorithms for solving optimization probl...
We consider a peer-to-peer approach to wireless sensor networks using the IEEE 802.15.4 standard, wi...
This dissertation contributes toward design, convergence analysis and improving the performance of t...
We design and analyze a fully distributed algorithm for convex constrained optimization in networks ...
We address general optimization problems formulated on networks. Each node in the network has a func...
Abstract—We propose a class of convex relaxations to solve the sensor network localization problem, ...
We propose an efficient solution to peer-to-peer localization in a wireless sensor network which wor...
We consider a convex optimization problem for non-hierarchical agent networks where each agent has a...
This dissertation deals with developing optimization algorithms which can be distributed over a netw...
Motivated by a peer-to-peer estimation algorithm in which adaptive weights are optimized to minimize...
The focus of this thesis is to implement various distributed optimization algorithms on a physical w...
In this paper we study two problems which often occur in various applications arising in wireless se...
In this paper, we consider a general problem setup for a wide class of convex and robust distributed...
In this paper we consider a general problem set-up for a wide class of convex and robust distributed...
Abstract-This paper considers the problem of power-efficient distributed estimation of vector parame...
<p>This thesis is concerned with the design of distributed algorithms for solving optimization probl...
We consider a peer-to-peer approach to wireless sensor networks using the IEEE 802.15.4 standard, wi...
This dissertation contributes toward design, convergence analysis and improving the performance of t...
We design and analyze a fully distributed algorithm for convex constrained optimization in networks ...
We address general optimization problems formulated on networks. Each node in the network has a func...
Abstract—We propose a class of convex relaxations to solve the sensor network localization problem, ...
We propose an efficient solution to peer-to-peer localization in a wireless sensor network which wor...
We consider a convex optimization problem for non-hierarchical agent networks where each agent has a...