Querying sensor networks by using dynamic task sets

Yükleniyor...
Küçük Resim

Tarih

2006-05-15

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Elsevier B.V.

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Araştırma projeleri

Organizasyon Birimleri

Dergi sayısı

Özet

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.

Açıklama

Anahtar Kelimeler

Data aggregation, Data dissemination, Data fusion, Data querying, Node clustering, Quadtree addressing, Sensor networks, Task assignment, Task sets, Algorithms, Database systems, Sensors, Querying sensor networks, Computer networks

Kaynak

Computer Networks

WoS Q Değeri

Q1
Q1

Scopus Q Değeri

Q1

Cilt

50

Sayı

7

Künye

Ç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