This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks
March 2007 (vol. 6 no. 3)
pp. 241-251
Xin Liu, IEEE
Ying Zhang, IEEE

Abstract—In this paper, we investigate efficient strategies for supporting on-demand information dissemination and gathering in large-scale wireless sensor networks. In particular, we propose a “comb-needle” discovery support model resembling an ancient method: Use a comb to help find a needle in sand or a haystack. The model combines push and pull for information dissemination and gathering. The push component features data duplication in a linear neighborhood of each node. The pull component features a dynamic formation of an on-demand routing structure resembling a comb. The comb-needle model enables us to investigate the cost of a spectrum of push and pull combinations for supporting query and discovery in large-scale sensor networks. Our result shows that the optimal routing structure depends on the frequency of query occurrence and the spatial-temporal frequency of related events in the network. The benefit of balancing push and pull for information discovery is demonstrated.

Index Terms:
Information discovery, query, geographical routing, wireless sensor networks.
Citation:
Xin Liu, Qingfeng Huang, Ying Zhang, "Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 3, pp. 241-251, March 2007, doi:10.1109/TMC.2007.34
Usage of this product signifies your acceptance of the Terms of Use.