Title :
Delay-Aware Query Routing Tree for Wireless Sensor Networks
Author :
Pervin, Shaila ; Kamruzzaman, Joarder ; Karmakar, Gour
Author_Institution :
Gippsland Sch. of IT, Monash Univ., Melbourne, VIC, Australia
Abstract :
Timeliness in query response is the major quality metric for query processing in the real-time applications of Wireless Sensor Networks (WSNs). The structure of the query routing tree directly affects the whole query processing delay as it provides the path to forward a query to the relevant nodes and return the response to the sink. In the current literature, query routing structure is designed irrespective of the variation in query loads among the sensors. As a consequence, current schemes do not guarantee for the routing tree to provide a faster path to the sensors with higher query load. This motivates the current work to consider query load in constructing and self-reconfiguring the routing tree. In this paper, we present a query load-based spanning tree construction method that reduces the query response delay as well as energy consumption in query execution and provides query response with the best possible accuracy. Simulation results illustrate the efficacy of the proposed framework.
Keywords :
delays; query processing; telecommunication computing; telecommunication network routing; trees (mathematics); wireless sensor networks; WSN; delay-aware query routing tree; energy consumption; query execution; query load-based spanning tree construction method; query processing delay; query routing structure; timeliness; wireless sensor networks; Accuracy; Delay; Query processing; Routing; Sensor fusion; Wireless sensor networks;
Conference_Titel :
Network Computing and Applications (NCA), 2012 11th IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2214-0
DOI :
10.1109/NCA.2012.39