Paper Info
Title
PEJA: progressive energy-efficient join processing for sensor networks
Abstract
Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications, the exploration of the relationship and linkage of sensing data within multiple regions can be naturally expressed by joining tuples in these regions. However, the highly distributed and resource-constraint nature of the network makes join a challenging query. In this paper, we address the problem of processing join query among different regions progressively and energy-efficiently in sensor networks. The proposed algorithm PEJA (Progressive Energy-efficient Join Algorithm) adopts an event-driven strategy to output the joining results as soon as possible, and alleviates the storage shortage problem in the in-network nodes. It also installs filters in the joining regions to prune unmatchable tuples in the early processing phase, saving lots of unnecessary transmissions. Extensive experiments on both synthetic and real world data sets indicate that the PEJA scheme outperforms other join algorithms, and it is effective in reducing the number of transmissions and the delay of query results during the join processing.
Year
DOI
Venue
2008
10.1007/s11390-008-9191-2
J. Comput. Sci. Technol.
Keywords
Field
DocType
minimal join set,real world data set,query result,progressive energy-efficient,progressive energy-efficient join algorithm,collect information,storage shortage problem,sensor network,early processing phase,challenging query,unmatchable tuples,peja scheme,in-network processing,progressive join,energy efficient
Hash join,Data set,Tuple,Computer science,Efficient energy use,Sensing data,Sort-merge join,Wireless sensor network,Economic shortage,Distributed computing
Journal
Volume
Issue
ISSN
23
6
1860-4749
Citations 
PageRank 
References 
7
0.46
19
Authors
3
Name
Order
Citations
PageRank
yongxuan lai111220.24
Yilong Chen2223.10
Hong Chen39923.20