Issue No. 12 - December (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.38
Xianjin Zhu , Microsoft, Inc., Seattle
Himanshu Gupta , Stony Brook University, Stony Brook
Bin Tang , Wichita State University, Wichita
Sensor networks are multihop wireless networks of resource-constrained sensor nodes used to realize high-level collaborative sensing tasks. To query or access data generated by the sensor nodes, the sensor network can be viewed as a distributed database. In this paper, we develop algorithms for communication-efficient implementation of join of multiple (two or more) data streams in a sensor network. The distributed implementation of join in sensor networks is particularly challenging due to unique characteristics of the sensor networks such as limited memory and battery energy on individual nodes, arbitrary and dynamic network topology, multihop communication, and unreliable infrastructure. One of our proposed approaches, viz., the Perpendicular Approach (PA), is load balanced, and in fact, incurs near-optimal communication cost for the special case of binary joins in grid networks under the assumption of uniform generation of tuples across the network. We compare the performance of our designed approaches through extensive simulations on the ns2 simulator, and show that PA results in substantially prolonging the network lifetime compared to other approaches, especially for joins involving spatial constraints.
Distributed query processing, Sensor networks.
H. Gupta, B. Tang and X. Zhu, "Join of Multiple Data Streams in Sensor Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1722-1736, 2009.