The ACQUIRE mechanism for efficient querying in sensor networks

We propose a novel and efficient mechanism for obtaining information in sensor networks which we refer to as ACQUIRE. In ACQUIRE an active query is forwarded through the network, and intermediate nodes use cached local information (within a look-ahead of d hops) in order to partially resolve the query. When the query is fully resolved, a completed response is sent directly back to the querying node. We take a mathematical modelling approach in this paper to calculate the energy costs associated with ACQUIRE. The models permit us to characterize analytically the impact of critical parameters, and compare the performance of ACQUIRE with respect to alternatives such as flooding-based querying (FBQ) and expanding ring search (ERS). We show that with optimal parameter settings, depending on the update frequency, ACQUIRE obtains order of magnitude reduction over FBQ and potentially over 60% reduction over ERS in consumed energy.

[1]  Philippe Bonnet,et al.  Querying the physical world , 2000, IEEE Wirel. Commun..

[2]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[3]  Deborah Estrin,et al.  Impact of network density on data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[4]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[5]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[6]  Saurabh Garg,et al.  Contact-based architecture for resource discovery (CARD) in large scale MANets , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[7]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[8]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[9]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[10]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[11]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[12]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[13]  Jerry Zhao,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[14]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, SIGCOMM LA '01.

[15]  B. R. Badrinath,et al.  Routing on a curve , 2003, CCRV.

[16]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[17]  Ramesh Govindan,et al.  The Sensor Network as a Database , 2002 .