Predicate Signaling in Distributed Sensor Networks
Abstract
Nodes in a sensor network can generate messages periodically, or when anomalies are detected, or when queried by other nodes. In this paper we propose a strategy called predicate signaling that generalizes these schemes by generating messages when specified predicates - that can deal with both time and anomalies - hold. We show how power consumption, message generation rates and estimation errors can be controlled by choosing predicates appropriately. We compare predicate signaling with other schemes. We derive formulas based on stochastic differential equations to estimate performance measures in predicate signaling. We analyze measurement data, and we compare simulations based on measured data with results predicted by our theory.
Attached Files
Submitted - PredicateSignaling.pdf
Files
Name | Size | Download all |
---|---|---|
md5:991d92fda2372b379c90fd60541b412c
|
272.3 kB | Preview Download |
Additional details
- Eprint ID
- 27080
- Resolver ID
- CaltechCSTR:2006.002
- Created
-
2006-01-13Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports
- Series Volume or Issue Number
- 2006.001