In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
— Simulation is frequently used in the study of multi-agent systems. Unfortunately, in many cases, it is not necessarily clear how faithfully the details of the simulated model r...
Christopher M. Cianci, Jim Pugh, Alcherio Martinol...
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
This paper investigates the role of existing "probabilistic" schemes to reason about various everyday situations on the basis of data from multiple heterogeneous physical...
In a sensor network monitoring natural environment, the readings of sensor nodes show high temporal and spatial correlation. This stems from the fact that most characteristics of ...