An efficient spatial query processing algorithm in multi-sink wireless sensor networks

In order to address the problem of energy and time-efficient execution of spatial queries in multi-sink wireless sensor networks, an efficient hybrid spatial query processing algorithm (EHSQP) is proposed in this paper. In EHSQP, sink nodes perform the sector selection for the query region and seek the query route to a query region using the known infrastructure information. Sensor nodes can adjust the query dissemination and reversing route for query results based on the available local information. To minimise the energy consumption and the response time, the proposed EHSQP algorithm ensures that only the relevant nodes are involved in the query execution. Experimental results show that the proposed algorithm reduces communication cost significantly, and saves energy and time very effectively for the connected sensors in the given region. The proposed technique has an advantage over other techniques in terms of energy and time-efficient query cover with lower communication cost.

[1]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[2]  Wang-Chien Lee,et al.  Optimizing parallel itineraries for knn query processing in wireless sensor networks , 2007, CIKM '07.

[3]  Jianliang Xu,et al.  Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Minyi Guo,et al.  Adaptive location updates for mobile sinks in wireless sensor networks , 2009, The Journal of Supercomputing.

[5]  Chonggang Wang,et al.  DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[6]  Ming-Syan Chen,et al.  Toward the Optimal Itinerary-Based KNN Query Processing in Mobile Sensor Networks , 2008, IEEE Transactions on Knowledge and Data Engineering.

[7]  Panos K. Chrysanthis,et al.  Optimized query routing trees for wireless sensor networks , 2011, Inf. Syst..

[8]  Wang-Chien Lee,et al.  Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks , 2010, IEEE Transactions on Knowledge and Data Engineering.

[9]  Raghupathy Sivakumar,et al.  A scalable correlation aware aggregation strategy for wireless sensor networks , 2005, WICON.

[10]  Sushanta Karmakar,et al.  A Tree-Based Local Repairing Approach for Increasing Lifetime of Query Driven WSN , 2011, 2011 14th IEEE International Conference on Computational Science and Engineering.

[11]  Weijia Jia,et al.  Routing with Virtual Region Coordinates in Wireless Sensor Networks , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[12]  Murat Demirbas,et al.  Peer-to-peer spatial queries in sensor networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[13]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[14]  Ming-Syan Chen,et al.  DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[15]  Jie Wu,et al.  Detecting Movements of a Target Using Face Tracking in Wireless Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[16]  Biplab Sikdar,et al.  A dynamic query-tree energy balancing protocol for sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).