Energy-Efficient Distributed Spatial Join Processing in Wireless Sensor Networks

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 339
  • Download : 0
In the area of wireless sensor networks, the efficient spatial query processing based on the locations of sensor nodes is required. Especially, spatial queries on two sensor networks need a distributed spatial join processing among the sensor networks. Because the distributed spatial join processing causes lots of wireless transmissions in accessing sensor nodes of two sensor networks; our goal of this paper is to reduce the wireless transmissions for the energy efficiency of sensor nodes. In this paper, we propose an energy-efficient distributed spatial join algorithm on two heterogeneous sensor networks, which performs in-network spatial join processing. To optimize the in-network processing, we also propose a Grid-based Rectangle tree (GR-tree) and a grid-based approximation function. The GR-tree reduces the wireless transmissions by supporting a distributed spatial search for sensor nodes. The grid-based approximation function reduces the wireless transmissions by reducing the volume of spatial query objects which should be pushed down to sensor nodes: Finally, we compare naive and existing approaches through extensive experiments and clarify our approach's distinguished features.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2010-06
Language
English
Article Type
Article
Keywords

MIDDLEWARE; DATABASES

Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E93D, no.6, pp.1447 - 1458

ISSN
0916-8532
DOI
10.1587/transinf.E93.D.1447
URI
http://hdl.handle.net/10203/101933
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0