Progressive Processing of Continuous Range Queries in Hierarchical Wireless Sensor Networks

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 707
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Jeong-Hoonko
dc.contributor.authorWhang, Kyu-Youngko
dc.contributor.authorLim, Hyo-Sangko
dc.contributor.authorLee, Byung-Sukko
dc.contributor.authorHeo, Jun-Seokko
dc.date.accessioned2013-03-12T00:13:54Z-
dc.date.available2013-03-12T00:13:54Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2010-07-
dc.identifier.citationIEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E93D, pp.1832 - 1847-
dc.identifier.issn0916-8532-
dc.identifier.urihttp://hdl.handle.net/10203/100765-
dc.description.abstractIn this paper, we study the problem of processing continuous range queries in a hierarchical wireless sensor network. Recently, as the size of sensor networks increases due to the growth of ubiquitous computing environments and wireless networks, building wireless sensor networks in a hierarchical configuration is put forth as a practical approach. Contrasted with the traditional approach of building networks in a "flat" structure using sensor devices of the same capability, the hierarchical approach deploys devices of higher-capability in a higher tier, i.e., a tier closer to the server. While query processing in flat sensor networks has been widely studied, the study on query processing in hierarchical sensor networks has been inadequate. In wireless sensor networks, the main costs that should be considered are the energy for sending data and the storage for storing queries. There is a trade-off between these two costs. Based on this, we first propose a progressive processing method that effectively processes a large number of continuous range queries in hierarchical sensor networks. The proposed method uses the query merging technique proposed by Xiang et al. as the basis. In addition, the method considers the trade-off between the two costs. More specifically, it works toward reducing the storage cost at lower-tier nodes by merging more queries and toward reducing the energy cost at higher-tier nodes by merging fewer queries (thereby reducing "false alarms"). We then present how to build a hierarchical sensor network that is optimal with respect to the weighted sum of the two costs. This allows for a cost-based systematic control of the trade-off based on the relative importance between the storage and energy in a given network environment and application. Experimental results show that the proposed method achieves a near-optimal control between the storage and energy and reduces the cost by 1.002 - 3.210 times compared with the cost achieved using the flat (i.e., non-hierarchical) setup as in the work by Xiang et al.-
dc.languageEnglish-
dc.publisherIEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG-
dc.titleProgressive Processing of Continuous Range Queries in Hierarchical Wireless Sensor Networks-
dc.typeArticle-
dc.identifier.wosid000281342100020-
dc.identifier.scopusid2-s2.0-77956041269-
dc.type.rimsART-
dc.citation.volumeE93D-
dc.citation.beginningpage1832-
dc.citation.endingpage1847-
dc.citation.publicationnameIEICE TRANSACTIONS ON INFORMATION AND SYSTEMS-
dc.identifier.doi10.1587/transinf.E93.D.1832-
dc.contributor.localauthorWhang, Kyu-Young-
dc.contributor.nonIdAuthorLee, Byung-Suk-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorhierarchical sensor network-
dc.subject.keywordAuthorprogressive processing-
dc.subject.keywordAuthorcontinuous range queries-
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 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