Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks

  • Authors:
  • Xin Liu;Qingfeng Huang;Ying Zhang

  • Affiliations:
  • University of California;Palo Alto Research Center (PARC) Inc.;Palo Alto Research Center (PARC) Inc.

  • Venue:
  • SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we investigate efficient strategies for supporting on-demand information dissemination and gathering in large-scale vwireless 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 sands 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 discovery and query 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 discovery in large scale geometric networks are demonstrated. We also raise the issue of query coverage in unreliable networks and investigate how redundancy can improve the coverage via both theoretical analysis and simulation. Last, we study adaptive strategies for the case where the frequencies of query and events are unknown a priori and time-varying.