3,552 research outputs found
Distributed Detection and Estimation in Wireless Sensor Networks
In this article we consider the problems of distributed detection and
estimation in wireless sensor networks. In the first part, we provide a general
framework aimed to show how an efficient design of a sensor network requires a
joint organization of in-network processing and communication. Then, we recall
the basic features of consensus algorithm, which is a basic tool to reach
globally optimal decisions through a distributed approach. The main part of the
paper starts addressing the distributed estimation problem. We show first an
entirely decentralized approach, where observations and estimations are
performed without the intervention of a fusion center. Then, we consider the
case where the estimation is performed at a fusion center, showing how to
allocate quantization bits and transmit powers in the links between the nodes
and the fusion center, in order to accommodate the requirement on the maximum
estimation variance, under a constraint on the global transmit power. We extend
the approach to the detection problem. Also in this case, we consider the
distributed approach, where every node can achieve a globally optimal decision,
and the case where the decision is taken at a central node. In the latter case,
we show how to allocate coding bits and transmit power in order to maximize the
detection probability, under constraints on the false alarm rate and the global
transmit power. Then, we generalize consensus algorithms illustrating a
distributed procedure that converges to the projection of the observation
vector onto a signal subspace. We then address the issue of energy consumption
in sensor networks, thus showing how to optimize the network topology in order
to minimize the energy necessary to achieve a global consensus. Finally, we
address the problem of matching the topology of the network to the graph
describing the statistical dependencies among the observed variables.Comment: 92 pages, 24 figures. To appear in E-Reference Signal Processing, R.
Chellapa and S. Theodoridis, Eds., Elsevier, 201
Optimal treatment allocations in space and time for on-line control of an emerging infectious disease
A key component in controlling the spread of an epidemic is deciding where, whenand to whom to apply an intervention.We develop a framework for using data to informthese decisionsin realtime.We formalize a treatment allocation strategy as a sequence of functions, oneper treatment period, that map up-to-date information on the spread of an infectious diseaseto a subset of locations where treatment should be allocated. An optimal allocation strategyoptimizes some cumulative outcome, e.g. the number of uninfected locations, the geographicfootprint of the disease or the cost of the epidemic. Estimation of an optimal allocation strategyfor an emerging infectious disease is challenging because spatial proximity induces interferencebetween locations, the number of possible allocations is exponential in the number oflocations, and because disease dynamics and intervention effectiveness are unknown at outbreak.We derive a Bayesian on-line estimator of the optimal allocation strategy that combinessimulation–optimization with Thompson sampling.The estimator proposed performs favourablyin simulation experiments. This work is motivated by and illustrated using data on the spread ofwhite nose syndrome, which is a highly fatal infectious disease devastating bat populations inNorth America
Distributed optimization in transportation and logistics networks
Many important problems in communication networks, transportation networks, and logistics networks are solved by the minimization of cost functions. In general, these can be complex optimization problems involving many variables. However, physicists noted that in a network, a node variable (such as the amount of resources of the nodes) is connected to a set of link variables (such as the flow connecting the node), and similarly each link variable is connected to a number of (usually two) node variables. This enables one to break the problem into local components, often arriving at distributive algorithms to solve the problems. Compared with centralized algorithms, distributed algorithms have the advantages of lower computational complexity, and lower communication overhead. Since they have a faster response to local changes of the environment, they are especially useful for networks with evolving conditions. This review will cover message-passing algorithms in applications such as resource allocation, transportation networks, facility location, traffic routing, and stability of power grids
Modeling and Optimization of Dynamical Systems in Epidemiology using Sparse Grid Interpolation
Infectious diseases pose a perpetual threat across the globe, devastating communities, and straining public health resources to their limit. The ease and speed of modern communications and transportation networks means policy makers are often playing catch-up to nascent epidemics, formulating critical, yet hasty, responses with insufficient, possibly inaccurate, information. In light of these difficulties, it is crucial to first understand the causes of a disease, then to predict its course, and finally to develop ways of controlling it. Mathematical modeling provides a methodical, in silico solution to all of these challenges, as we explore in this work. We accomplish these tasks with the aid of a surrogate modeling technique known as sparse grid interpolation, which approximates dynamical systems using a compact polynomial representation. Our contributions to the disease modeling community are encapsulated in the following endeavors. We first explore transmission and recovery mechanisms for disease eradication, identifying a relationship between the reproductive potential of a disease and the maximum allowable disease burden. We then conduct a comparative computational study to improve simulation fits to existing case data by exploiting the approximation properties of sparse grid interpolants both on the global and local levels. Finally, we solve a joint optimization problem of periodically selecting field sensors and deploying public health interventions to progressively enhance the understanding of a metapopulation-based infectious disease system using a robust model predictive control scheme
Optimal deployment of resources for maximizing impact in spreading processes
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential spreaders" for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings the problem is often characterized by heterogeneous interactions and requires interventions over a finite time window via a restricted set of controllable nodes. The optimal distribution of available resources hence results from an interplay between network topology and spreading dynamics. We show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples
Effects of Diversity on Multi-agent Systems: Minority Games
We consider a version of large population games whose agents compete for
resources using strategies with adaptable preferences. The games can be used to
model economic markets, ecosystems or distributed control. Diversity of initial
preferences of strategies is introduced by randomly assigning biases to the
strategies of different agents. We find that diversity among the agents reduces
their maladaptive behavior. We find interesting scaling relations with
diversity for the variance and other parameters such as the convergence time,
the fraction of fickle agents, and the variance of wealth, illustrating their
dynamical origin. When diversity increases, the scaling dynamics is modified by
kinetic sampling and waiting effects. Analyses yield excellent agreement with
simulations.Comment: 41 pages, 16 figures; minor improvements in content, added
references; to be published in Physical Review
- …