HIPaG: An energy-efficient in-network join for distributed condition tables in sensor networks

Cited 1 time in webofscience Cited 1 time in scopus
  • Hit : 517
  • Download : 252
In sensor networks, the event-detection process can be considered as a join of two relations, i.e., a sensor table and a condition table, where a condition table is a set of triples each of which contains condition information about a certain event. When join operations are used for event-detection, it is desirable, if possible, to perform 'in-network' joins in order to reduce the communication cost. In this paper, we propose an in-network join algorithm, called HIPaG. In HIPaG, a condition table is partitioned into several fragments. Those fragments are stored either in paths from the base station to sensor nodes, or in groups of nodes each of which are within the broadcast range among each other. By distributing a condition table in this way, a distributed join of a sensor table and a condition table can be effectively performed in the network. The experimental results show that our proposed HIPaG works much better than the existing method. (C) 2009 Elsevier Inc. All rights reserved.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2009-07
Language
English
Article Type
Article
Keywords

DATABASE DESIGN; ALLOCATION; QUERIES; SYSTEM

Citation

JOURNAL OF SYSTEMS AND SOFTWARE, v.82, no.7, pp.1073 - 1086

ISSN
0164-1212
DOI
10.1016/j.jss.2009.01.012
URI
http://hdl.handle.net/10203/13960
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0