Adaptive spatial window aggregation query processing algorithm in wireless sensor networks Online publication date: Tue, 06-Jan-2015
by Liang Liu; Xiaolin Qin; Guineng Zheng; Bohan Li
International Journal of Sensor Networks (IJSNET), Vol. 16, No. 3, 2014
Abstract: Users of wireless sensor networks (WSNs) often submit spatial window aggregation queries to obtain the summary information about a local area in the monitored region. We propose an adaptive spatial window aggregation query processing algorithm called ASWAP in this paper. It divides the query area into several disjoint sub-regions. A cluster head node is elected in each sub-region which collects the sensory data of sensor nodes in it, uses the data collected to calculate the partial query result and sends it to the cluster head node of the next sub-region. While a cluster head node fails during the above process, a recovery area can be found in its corresponding sub-region in which any node can substitute the cluster head node to resume the process of query processing. Experimental results show that in most cases ASWAP outperforms the existing IWQE algorithm in terms of energy consumption and query success rate.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook