A New Path-Based In-Network Join Processing Method for Sensor Networks

Jae Wook PARK; Yong Kyu LEE

doi:10.1587/transcom.E97.B.602

A New Path-Based In-Network Join Processing Method for Sensor Networks

Jae Wook PARK, Yong Kyu LEE

Full Text Views

0

Cite this

Summary :

Methods for in-network joins of sensing data with tuples, in partitioned condition tables stored in sensor nodes, have been studied for efficient event detection. A recently proposed method performs the join operation after distributing the tuples of a condition table evenly among homogeneous sensor nodes with the same storage capacity. In the method, the condition table is horizontally partitioned, and each partition is allocated to the corresponding node, along the path from the highest level to the leaf level. If the path length is larger than the number of partitions, the second round distribution of the partitions resumes from the node at the next level, and so on. Thus, the last node at each round can be assigned the partition that is smaller than the others, which would otherwise cause wasted internal fragmentation. Further, little research has been conducted on methods for the cases of heterogeneous sensor nodes with different available spaces, as well as the vertical partitioning of condition table. In this study, we propose a method of partitioning a condition table that utilizes the internal fragmentation, by treating the tuples of a condition table as a circular list. The proposed method is applicable to the case in which nodes have different available spaces. Furthermore, a new method for vertically partitioning a condition table is suggested. Experiments verify the reduction in the data transmission amount offered by the proposed methods, as compared to existing methods.

Publication: IEICE TRANSACTIONS on Communications Vol.E97-B No.3 pp.602-609

Publication Date: 2014/03/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E97.B.602

Type of Manuscript: PAPER

Category: Network System

Authors

Jae Wook PARK
Dongguk University-Seoul
Yong Kyu LEE
Dongguk University-Seoul

Keyword

sensor network, condition table, in-network join, vertical partition, horizontal partition

Cite this

Copy

Jae Wook PARK, Yong Kyu LEE, "A New Path-Based In-Network Join Processing Method for Sensor Networks" in IEICE TRANSACTIONS on Communications, vol. E97-B, no. 3, pp. 602-609, March 2014, doi: 10.1587/transcom.E97.B.602.
Abstract: Methods for in-network joins of sensing data with tuples, in partitioned condition tables stored in sensor nodes, have been studied for efficient event detection. A recently proposed method performs the join operation after distributing the tuples of a condition table evenly among homogeneous sensor nodes with the same storage capacity. In the method, the condition table is horizontally partitioned, and each partition is allocated to the corresponding node, along the path from the highest level to the leaf level. If the path length is larger than the number of partitions, the second round distribution of the partitions resumes from the node at the next level, and so on. Thus, the last node at each round can be assigned the partition that is smaller than the others, which would otherwise cause wasted internal fragmentation. Further, little research has been conducted on methods for the cases of heterogeneous sensor nodes with different available spaces, as well as the vertical partitioning of condition table. In this study, we propose a method of partitioning a condition table that utilizes the internal fragmentation, by treating the tuples of a condition table as a circular list. The proposed method is applicable to the case in which nodes have different available spaces. Furthermore, a new method for vertically partitioning a condition table is suggested. Experiments verify the reduction in the data transmission amount offered by the proposed methods, as compared to existing methods.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.602/_p

Copy

@ARTICLE{e97-b_3_602,
author={Jae Wook PARK, Yong Kyu LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Path-Based In-Network Join Processing Method for Sensor Networks},
year={2014},
volume={E97-B},
number={3},
pages={602-609},
abstract={Methods for in-network joins of sensing data with tuples, in partitioned condition tables stored in sensor nodes, have been studied for efficient event detection. A recently proposed method performs the join operation after distributing the tuples of a condition table evenly among homogeneous sensor nodes with the same storage capacity. In the method, the condition table is horizontally partitioned, and each partition is allocated to the corresponding node, along the path from the highest level to the leaf level. If the path length is larger than the number of partitions, the second round distribution of the partitions resumes from the node at the next level, and so on. Thus, the last node at each round can be assigned the partition that is smaller than the others, which would otherwise cause wasted internal fragmentation. Further, little research has been conducted on methods for the cases of heterogeneous sensor nodes with different available spaces, as well as the vertical partitioning of condition table. In this study, we propose a method of partitioning a condition table that utilizes the internal fragmentation, by treating the tuples of a condition table as a circular list. The proposed method is applicable to the case in which nodes have different available spaces. Furthermore, a new method for vertically partitioning a condition table is suggested. Experiments verify the reduction in the data transmission amount offered by the proposed methods, as compared to existing methods.},
keywords={},
doi={10.1587/transcom.E97.B.602},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - A New Path-Based In-Network Join Processing Method for Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 602
EP - 609
AU - Jae Wook PARK
AU - Yong Kyu LEE
PY - 2014
DO - 10.1587/transcom.E97.B.602
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2014
AB - Methods for in-network joins of sensing data with tuples, in partitioned condition tables stored in sensor nodes, have been studied for efficient event detection. A recently proposed method performs the join operation after distributing the tuples of a condition table evenly among homogeneous sensor nodes with the same storage capacity. In the method, the condition table is horizontally partitioned, and each partition is allocated to the corresponding node, along the path from the highest level to the leaf level. If the path length is larger than the number of partitions, the second round distribution of the partitions resumes from the node at the next level, and so on. Thus, the last node at each round can be assigned the partition that is smaller than the others, which would otherwise cause wasted internal fragmentation. Further, little research has been conducted on methods for the cases of heterogeneous sensor nodes with different available spaces, as well as the vertical partitioning of condition table. In this study, we propose a method of partitioning a condition table that utilizes the internal fragmentation, by treating the tuples of a condition table as a circular list. The proposed method is applicable to the case in which nodes have different available spaces. Furthermore, a new method for vertically partitioning a condition table is suggested. Experiments verify the reduction in the data transmission amount offered by the proposed methods, as compared to existing methods.
ER -