Learn More
—Cooperative diversity (CD) networks have been receiving a lot of attention recently as a distributed means of improving error performance and capacity. For sufficiently large signal-to-noise ratio (SNR), this paper derives the average symbol error probability (SEP) for analog forwarding CD links. The resulting expressions are general as they hold for an(More)
We study deterministic mean-location parameter estimation when only quantized versions of the original observations are available, due to bandwidth constraints. When the dynamic range of the parameter is small or comparable with the noise variance, we introduce a class of maximum-likelihood estimators that require transmitting just one bit per sensor to(More)
When dealing with decentralized estimation, it is important to reduce the cost of communicating the distributed observations-a problem receiving revived interest in the context of wireless sensor networks. In this paper, we derive and analyze distributed state estimators of dynamical stochastic processes, whereby the low communication cost is effected by(More)
Wireless sensor networks (WSNs) deployed to perform surveillance and monitoring tasks have to operate under stringent energy and bandwidth limitations. These motivate well distributed estimation scenarios where sensors quantize and transmit only one, or a few bits per observation, for use in forming parameter estimators of interest. In a companion paper, we(More)
Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in terms of long term averages. A policy that observes the state and decides on a resource allocation is proposed and shown to almost surely satisfy problem constraints and optimality(More)
RES, a regularized stochastic version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method, is proposed to solve strongly convex optimization problems with stochastic objectives. The use of stochastic gradient descent algorithms is widespread, but the number of iterations required to approximate optimal arguments can be prohibitive in high(More)
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireless sensor networks (WSNs) offer decentralized Kalman filtering (KF) based algorithms with documented merits over centralized alternatives. Adhering to the limited power and(More)
—This paper considers the control of a linear plant when plant state information is being transmitted from a sensor to the controller over a wireless fading channel. The power allocated to these transmissions determines the probability of successful packet reception and is allowed to adapt online to both channel conditions and plant state. The goal is to(More)
Global convergence of an online (stochastic) limited memory version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method for solving optimization problems with stochastic objectives that arise in large scale machine learning is established. Lower and upper bounds on the Hessian eigenvalues of the sample functions are shown to suffice to(More)