Please use this identifier to cite or link to this item:
|Title:||Query allocation in wireless sensor networks with multiple base stations|
|Citation:||Xiang, S.,Zhou, Y.,Lim, H.-B.,Tan, K.-L. (2009). Query allocation in wireless sensor networks with multiple base stations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5463 : 107-122. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-00887-0_10|
|Abstract:||To support large-scale sensor network applications, in terms of both network size and query population, an infrastructure with multiple base stations is necessary. In this paper, we optimize the allocation of queries among multiple base stations, in order to minimize the total data communication cost among the sensors. We first examine the query allocation problem in a static context, where a two-phase semi-greedy allocation framework is designed to exploit the sharing among queries. Also, we investigate dynamic environments with frequent query arrivals and terminations and propose adaptive query migration algorithms. Finally, extensive experiments are conducted to compare the proposed techniques with existing works. The experimental results show the effectiveness of our proposed query allocation schemes.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 17, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.