dc.date.accessioned | 2005-12-22T01:20:12Z | |
dc.date.accessioned | 2018-11-24T10:24:03Z | |
dc.date.available | 2005-12-22T01:20:12Z | |
dc.date.available | 2018-11-24T10:24:03Z | |
dc.date.issued | 2004-03-22 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/30452 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30452 | |
dc.description.abstract | This paper presents an algorithm for handling many types of filters insensor networks that cannot be expressed using a simple predicate.Specifically, the action of the filter may be predicated on sensor produceddata where an entire table of sensor-data/result-value pairs are needed toresolve the filter. We describe and evaluate three algorithms that canperform these filters that take advantage of database distributed jointechniques. Our join-based algorithms are capable of running in verylimited amounts of RAM, can distribute the storage burden over groups ofnodes, and are tolerant to dropped packets and node failures. REED isthus suitable for a wide range of event-detection applications thattraditional sensor network database and data collection systems cannot beused to implement. | |
dc.format.extent | 14 p. | |
dc.format.extent | 29691355 bytes | |
dc.format.extent | 1109049 bytes | |
dc.language.iso | en_US | |
dc.title | REED: Robust, Efficient Filtering and Event Detection in Sensor Networks | |