Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks

Authors:
Olga Saukh;Robert Sauter;Pedro José Marrón
Affiliations:
Germany and Fraunhofer IAIS, St. Augustin, Universität Bonn, Bonn, Germany;Germany and Fraunhofer IAIS, St. Augustin, Universität Bonn, Bonn, Germany;Germany and Fraunhofer IAIS, St. Augustin, Universität Bonn, Bonn, Germany
Venue:
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Year:
2008

Citing 7
Cited 0

COUGAR: the network is the database

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks

IEEE Transactions on Computers
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Distributed collaboration for event detection in wireless sensor networks

MPAC '05 Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing
Hole detection or: "how much geometry hides in connectivity?"

Proceedings of the twenty-second annual symposium on Computational geometry
The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Scheduling Algorithms

Scheduling Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most papers on sensing in wireless sensor networks use only very simple sensors, e.g. humidity or temperature, to illustrate their concepts. However, in a large number of scenarios including structural health monitoring, more complex sensors that usually employ medium to high frequency sampling and post-processing are required. Additionally, to capture an event completely several sensors of different types are needed which have to be in range of the event and used in a timely manner. We study the problem of time-bounded and space-bounded sensing where parallel use of different sensors on the same node is impossible and not all nodes possess all required sensors. We provide a model formalizing the requirements and present algorithms for spatial grouping and temporal scheduling to tackle these problems.