Research Article
Decentralizing query processing in sensor networks
@INPROCEEDINGS{10.1109/MOBIQUITOUS.2005.22, author={R. Rosemark and W.-C. Lee}, title={Decentralizing query processing in sensor networks}, proceedings={2nd International ICST Conference on Mobile and Ubiquitous Systems: Networking and Services}, publisher={IEEE}, proceedings_a={MOBIQUITOUS}, year={2005}, month={11}, keywords={}, doi={10.1109/MOBIQUITOUS.2005.22} }- R. Rosemark
W.-C. Lee
Year: 2005
Decentralizing query processing in sensor networks
MOBIQUITOUS
IEEE
DOI: 10.1109/MOBIQUITOUS.2005.22
Abstract
Recent research has led to the advent of software systems capable of performing query processing in sensor networks. They perform query processing in a sensor network by constructing a routing tree rooted at an access point (i.e., a base station), where the queries are submitted, parsed, and optimized. This approach to query processing is centralized in nature. Performing query optimization at a single node (base station) does not generate efficient query plans, and requires each node to report metadata to the access point. In addition, the routing tree infrastructure inefficiently aggregates data packets. To address these issues, this paper proposes several decentralized query processing systems that utilize sensor node's innate spatial and semantic characteristics. Experimental results conclude that decentralizing query processing significantly reduces energy costs. In addition, experimental results show that the spatial and semantic properties of nodes are influential in designing a decentralized query processing system.