17,541 research outputs found
Networked Slepian-Wolf: theory, algorithms, and scaling laws
Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the data-gathering scenario, which is relevant in sensor networks, and general traffic matrices, relevant for general networks. The minimization is achieved by jointly optimizing a) the transmission structure, which is shown to consist in general of a superposition of trees, and b) the rate allocation across the source nodes, which is done by Slepian-Wolf coding. The overall minimization can be achieved in two concatenated steps. First, the optimal transmission structure is found, which in general amounts to finding a Steiner tree, and second, the optimal rate allocation is obtained by solving an optimization problem with cost weights determined by the given optimal transmission structure, and with linear constraints given by the Slepian-Wolf rate region. For the case of data gathering, the optimal transmission structure is fully characterized and a closed-form solution for the optimal rate allocation is provided. For the general case of an arbitrary traffic matrix, the problem of finding the optimal transmission structure is NP-complete. For large networks, in some simplified scenarios, the total costs associated with Slepian-Wolf coding and explicit communication (conditional encoding based on explicitly communicated side information) are compared. Finally, the design of decentralized algorithms for the optimal rate allocation is analyzed
Network correlated data gathering with explicit communication: NP-completeness and algorithms
We consider the problem of correlated data gathering by a network with a sink node and a tree-based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, we consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. We first formulate the optimization problem definition in the general case and then we study further a network setting where the entropy conditioning at nodes does not depend on the amount of side information, but only on its availability. We prove that even in this simple case, the optimization problem is NP-hard. We propose some efficient, scalable, and distributed heuristic approximation algorithms for solving this problem and show by numerical simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal
Energy-efficient task allocation for distributed applications in Wireless Sensor Networks
We consider the scenario of a sensing, computing and communicating infrastructure with a a programmable middleware that allows for quickly deploying different applications running on top of it so as to follow the changing ambient needs. We then face the problem of setting up the desired application in case of hundreds of nodes, which consists in identifying which actions should be performed by each of the nodes so as to satisfy the ambient needs while minimizing the application impact on the infrastructure battery lifetime. We approach the problem by considering every possible decomposition of the application's sensing and computing operations into tasks to be assigned to the each infrastructure component. The contribution of energy consumption due to the performance of each task is then considered to compute a cost function, allowing us to evaluate the viability of each deployment solution. Simulation results show that our framework results in considerable energy conservation with respect to sink-oriented or cluster-oriented deployment approaches, particularly for networks with high node densities, non-uniform energy consumption and initial energy, and complex actions
Distributed Control of Microscopic Robots in Biomedical Applications
Current developments in molecular electronics, motors and chemical sensors
could enable constructing large numbers of devices able to sense, compute and
act in micron-scale environments. Such microscopic machines, of sizes
comparable to bacteria, could simultaneously monitor entire populations of
cells individually in vivo. This paper reviews plausible capabilities for
microscopic robots and the physical constraints due to operation in fluids at
low Reynolds number, diffusion-limited sensing and thermal noise from Brownian
motion. Simple distributed controls are then presented in the context of
prototypical biomedical tasks, which require control decisions on millisecond
time scales. The resulting behaviors illustrate trade-offs among speed,
accuracy and resource use. A specific example is monitoring for patterns of
chemicals in a flowing fluid released at chemically distinctive sites.
Information collected from a large number of such devices allows estimating
properties of cell-sized chemical sources in a macroscopic volume. The
microscopic devices moving with the fluid flow in small blood vessels can
detect chemicals released by tissues in response to localized injury or
infection. We find the devices can readily discriminate a single cell-sized
chemical source from the background chemical concentration, providing
high-resolution sensing in both time and space. By contrast, such a source
would be difficult to distinguish from background when diluted throughout the
blood volume as obtained with a blood sample
Comparison of CSMA based MAC protocols of wireless sensor networks
Energy conservation has been an important area of interest in Wireless Sensor
networks (WSNs). Medium Access Control (MAC) protocols play an important role
in energy conservation. In this paper, we describe CSMA based MAC protocols for
WSN and analyze the simulation results of these protocols. We implemented
S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware.
Previous surveys mainly focused on the classification of MAC protocols
according to the techniques being used or problem dealt with and presented a
theoretical evaluation of protocols. This paper presents the comparative study
of CSMA based protocols for WSNs, showing which MAC protocol is suitable in a
particular environment and supports the arguments with the simulation results.
The comparative study can be used to find the best suited MAC protocol for
wireless sensor networks in different environments.Comment: International Journal of AdHoc Network Systems, Volume 2, Number 2,
April 201
Techniques for improving the accuracy of cyrogenic temperature measurement in ground test programs
The performance of a sensor is often evaluated by determining to what degree of accuracy a measurement can be made using this sensor. The absolute accuracy of a sensor is an important parameter considered when choosing the type of sensor to use in research experiments. Tests were performed to improve the accuracy of cryogenic temperature measurements by calibration of the temperature sensors when installed in their experimental operating environment. The calibration information was then used to correct for temperature sensor measurement errors by adjusting the data acquisition system software. This paper describes a method to improve the accuracy of cryogenic temperature measurements using corrections in the data acquisition system software such that the uncertainty of an individual temperature sensor is improved from plus or minus 0.90 deg R to plus or minus 0.20 deg R over a specified range
- …