Indexing method for moving sensor node retrieval
by Ki Young Lee; Jeong Jin Kang; Jeong Joon Kim; Gyoo Seok Choi; Young Dae Lee; Seong Yun Cho; Sun Jin Oh
International Journal of Sensor Networks (IJSNET), Vol. 15, No. 4, 2014

Abstract: Most of previous studies attempted to solve problems resulting from the frequent update of moving sensor node data by extending R-tree, the representative space index structure. Some recent studies consider the distribution of moving sensor nodes using histogram as an additional structure. Nevertheless, it is not easy to process non-uniform distribution because in such related works uniform distribution is processed simply based on histogram of fixed split. In this paper, we propose RGP-tree (R-tree with dynamic non-uniform grid and sub R-tree), which integrates the dynamic non-uniform grid method and the sub R-tree method. Because RGP-tree can split space dynamically and non-uniformly even if moving sensor nodes are distributed densely in a specific area, it is possible to process moving sensor node data effectively.

Online publication date: Mon, 25-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com