In this paper, we propose a novel scheme to optimize the allocation of continuous queries in a sensor network with multiple sinks. The existing scheme compares the coverage areas of given queries and estimates the amount of sharing among them. It tries to allocate queries to the optimal sink that maximizes the amount of sharing and reduces the communication costs among sensor nodes and sinks. However, it inefficiently allocates continuous queries. The amount of sharing among continuous queries depends not only on their coverage area but also on their time-parameters like time-duration and time-interval. We define a new cost estimator with time-parameters for continuous queries and optimize their allocation in the sensor network. Simulation results show that our scheme performs the allocation of continuous queries efficiently and reduces the communication cost.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Myungho YEO, Junho PARK, Haksin KIM, Jaesoo YOO, "A Continuous Query Allocation Scheme with Time-Parameters in Wireless Sensor Networks with Multiple Sinks" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 4, pp. 1431-1434, April 2012, doi: 10.1587/transcom.E95.B.1431.
Abstract: In this paper, we propose a novel scheme to optimize the allocation of continuous queries in a sensor network with multiple sinks. The existing scheme compares the coverage areas of given queries and estimates the amount of sharing among them. It tries to allocate queries to the optimal sink that maximizes the amount of sharing and reduces the communication costs among sensor nodes and sinks. However, it inefficiently allocates continuous queries. The amount of sharing among continuous queries depends not only on their coverage area but also on their time-parameters like time-duration and time-interval. We define a new cost estimator with time-parameters for continuous queries and optimize their allocation in the sensor network. Simulation results show that our scheme performs the allocation of continuous queries efficiently and reduces the communication cost.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.1431/_p
Copy
@ARTICLE{e95-b_4_1431,
author={Myungho YEO, Junho PARK, Haksin KIM, Jaesoo YOO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Continuous Query Allocation Scheme with Time-Parameters in Wireless Sensor Networks with Multiple Sinks},
year={2012},
volume={E95-B},
number={4},
pages={1431-1434},
abstract={In this paper, we propose a novel scheme to optimize the allocation of continuous queries in a sensor network with multiple sinks. The existing scheme compares the coverage areas of given queries and estimates the amount of sharing among them. It tries to allocate queries to the optimal sink that maximizes the amount of sharing and reduces the communication costs among sensor nodes and sinks. However, it inefficiently allocates continuous queries. The amount of sharing among continuous queries depends not only on their coverage area but also on their time-parameters like time-duration and time-interval. We define a new cost estimator with time-parameters for continuous queries and optimize their allocation in the sensor network. Simulation results show that our scheme performs the allocation of continuous queries efficiently and reduces the communication cost.},
keywords={},
doi={10.1587/transcom.E95.B.1431},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - A Continuous Query Allocation Scheme with Time-Parameters in Wireless Sensor Networks with Multiple Sinks
T2 - IEICE TRANSACTIONS on Communications
SP - 1431
EP - 1434
AU - Myungho YEO
AU - Junho PARK
AU - Haksin KIM
AU - Jaesoo YOO
PY - 2012
DO - 10.1587/transcom.E95.B.1431
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2012
AB - In this paper, we propose a novel scheme to optimize the allocation of continuous queries in a sensor network with multiple sinks. The existing scheme compares the coverage areas of given queries and estimates the amount of sharing among them. It tries to allocate queries to the optimal sink that maximizes the amount of sharing and reduces the communication costs among sensor nodes and sinks. However, it inefficiently allocates continuous queries. The amount of sharing among continuous queries depends not only on their coverage area but also on their time-parameters like time-duration and time-interval. We define a new cost estimator with time-parameters for continuous queries and optimize their allocation in the sensor network. Simulation results show that our scheme performs the allocation of continuous queries efficiently and reduces the communication cost.
ER -