The d-hop k-data coverage query problem in wireless sensor networks
dc.creator | Kontaki, M. | en |
dc.creator | Katsaros, D. | en |
dc.creator | Manolopoulos, Y. | en |
dc.date.accessioned | 2015-11-23T10:35:27Z | |
dc.date.available | 2015-11-23T10:35:27Z | |
dc.date.issued | 2008 | |
dc.identifier | 10.1145/1402050.1402054 | |
dc.identifier.isbn | 9781605582849 | |
dc.identifier.uri | http://hdl.handle.net/11615/29603 | |
dc.description.abstract | The task of querying wireless sensor network (WSN) to retrieve data of interest is very significant and a wealth of query types have been proposed in the context of WSNs. This article describes the d-hop k-data coverage query problem, which is a novel query type, aiming at extracting feature(s) distribution maps from WSNs. This problem generalizes earlier research problems, like top-k, skyband, and d-hop dominating sets. For this problem, we provide a fully distributed solution, the DaCoN protocol, that avoids constructing a network spanner, since such a structure requires an expensive initialization procedure, misses the notion of neighborhoods, and most importantly, it creates hot-spots of communication, that shorten the network lifetime (i.e., some nodes deplete their energy very fast). We have developed a simulator to study the performance and behavior of the DaCoN protocol for various sensornet topologies and data distributions, and the obtained results attested the energy-efficiency and effectiveness of the protocol. Copyright 2008 ACM. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-65249086740&partnerID=40&md5=621e4d0da09ebfa55e20028ac3c8f6b7 | |
dc.subject | Data coverage | en |
dc.subject | Distributed algorithms | en |
dc.subject | Energy efficiency | en |
dc.subject | Wireless sensor networks | en |
dc.subject | Data distributions | en |
dc.subject | Distributed solutions | en |
dc.subject | Distribution maps | en |
dc.subject | Dominating sets | en |
dc.subject | Extracting features | en |
dc.subject | Hot-spots | en |
dc.subject | Network lifetimes | en |
dc.subject | Query types | en |
dc.subject | Research problems | en |
dc.subject | Sensornet | en |
dc.subject | Feature extraction | en |
dc.subject | Parallel algorithms | en |
dc.subject | Routing protocols | en |
dc.subject | Sensor networks | en |
dc.subject | Wireless telecommunication systems | en |
dc.subject | Network management | en |
dc.title | The d-hop k-data coverage query problem in wireless sensor networks | en |
dc.type | conferenceItem | en |
Αρχεία σε αυτό το τεκμήριο
Αρχεία | Μέγεθος | Τύπος | Προβολή |
---|---|---|---|
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο. |