E\(^2\)STA: An Energy-Efficient Spatio-Temporal Query Algorithm for Wireless Sensor Networks

摘要: After wireless sensor networks are deployed, spatio-temporal query is frequently submitted by users to obtain all the readings of an area interest in a period time. Most existing processing algorithms organized nodes whole network or into single routing tree guided which sent back sink. This study attempts answer following two questions: first, it feasible multiple trees? Second, for based and trees algorithms, one outperforms other? We pointed out that path along results sink fairly long when adopted, leads large amount energy consumption. Organizing can avoid this problem. Based on above findings, we designed protocol constructing area, proposed energy-efficient algorithm called E\(^2\)STA. Theoretical experimental show terms