Querying sensor networks by using dynamic task sets
dc.authorid | 0000-0003-3052-9821 | |
dc.contributor.author | Çayırcı, Erdal | en_US |
dc.contributor.author | Coşkun, Vedat | en_US |
dc.contributor.author | Çimen, Çağhan | en_US |
dc.date.accessioned | 2015-01-15T23:00:35Z | |
dc.date.available | 2015-01-15T23:00:35Z | |
dc.date.issued | 2006-05-15 | |
dc.department | Işık Üniversitesi, Fen Edebiyat Fakültesi, Enformasyon Teknolojileri Bölümü | en_US |
dc.department | Işık University, Faculty of Arts and Sciences, Department of Information Technologies | en_US |
dc.description.abstract | A data querying scheme is introduced for sensor networks where queries formed for each sensing task are sent to task sets. The sensor field is partitioned into subregions by using quadtree based addressing, and then a given number of sensors from each subregion are assigned to each task set by using a distributed algorithm. The number of nodes in a task set depends on the task specifications. Hence, the sensed data is retrieved from a sensor network in the level of detail specified by users, and a tradeoff mechanism between data resolution and query cost is provided. Experiments show that the dynamic task sets scheme systematically reduces the number of sensors involved in a query in the orders of magnitude in the expense of slight reduction in the event detection rate. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Çayırcı, E., Coşkun, V. & Çimen, C. (2006). Querying sensor networks by using dynamic task sets. Computer Networks, 50(7), 938-952. doi:10.1016/j.comnet.2005.05.031 | en_US |
dc.identifier.doi | 10.1016/j.comnet.2005.05.031 | |
dc.identifier.endpage | 952 | |
dc.identifier.issn | 1389-1286 | |
dc.identifier.issn | 1872-7069 | |
dc.identifier.issue | 7 | |
dc.identifier.scopus | 2-s2.0-33645154273 | |
dc.identifier.scopusquality | Q1 | |
dc.identifier.startpage | 938 | |
dc.identifier.uri | https://hdl.handle.net/11729/223 | |
dc.identifier.uri | http://dx.doi.org/10.1016/j.comnet.2005.05.031 | |
dc.identifier.volume | 50 | |
dc.identifier.wos | WOS:000236786000004 | |
dc.identifier.wosquality | Q1 | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.institutionauthor | Coşkun, Vedat | en_US |
dc.institutionauthorid | 0000-0003-3052-9821 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Elsevier B.V. | en_US |
dc.relation.ispartof | Computer Networks | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Data aggregation | en_US |
dc.subject | Data dissemination | en_US |
dc.subject | Data fusion | en_US |
dc.subject | Data querying | en_US |
dc.subject | Node clustering | en_US |
dc.subject | Quadtree addressing | en_US |
dc.subject | Sensor networks | en_US |
dc.subject | Task assignment | en_US |
dc.subject | Task sets | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Database systems | en_US |
dc.subject | Sensors | en_US |
dc.subject | Querying sensor networks | en_US |
dc.subject | Computer networks | en_US |
dc.title | Querying sensor networks by using dynamic task sets | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 223.pdf
- Boyut:
- 413.47 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version