Please use this identifier to cite or link to this item:
|Title:||Similarity-aware query allocation in sensor networks with multiple base stations|
|Citation:||Xiang, S.,Lim, H.-B.,Tan, K.-L.,Zhou, Y. (2007). Similarity-aware query allocation in sensor networks with multiple base stations. ACM International Conference Proceeding Series 273 : 1-6. ScholarBank@NUS Repository. https://doi.org/10.1145/1286380.1286382|
|Abstract:||In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be more energy efficient and scale well with the size of the sensor nodes. To support a large number of queries, we examine the problem of allocating queries across the base stations to minimize the total data communication cost among the sensors. In particular, we examine similarity-aware techniques that exploit the similarities among queries when allocating queries, so that queries that require data from a common set of sensor nodes are allocated to the same base stations. We first approximate the problem of allocating queries to K base stations as a max-K-cut problem, and adapts an existing solution to our context. However, the scheme only works in a static context, where all queries are known in advance. In order to operate in a dynamic environment with frequent query arrivals and termination, we further propose a novel similarity-aware strategy that allocates queries to base stations one at a time. We also propose several heuristics to order a batch of queries for incremental allocation. We conducted experiments to evaluate our proposed schemes, and our results show that our similarity-aware query allocation schemes can effectively exploit the sharing among queries to greatly reduce the communication cost.|
|Source Title:||ACM International Conference Proceeding Series|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 12, 2019
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.