Title | ||
---|---|---|
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks |
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. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/TMC.2007.34 | IEEE Trans. Mob. Comput. |
Keywords | Field | DocType |
Large-scale systems,Frequency,Wireless sensor networks,Needles,Routing,Costs,Broadcasting,Floods,Data analysis,Performance analysis | Data deduplication,Broadcasting,Haystack,Computer science,Sensor array,Computer network,Information Dissemination,Wireless sensor network,Distributed computing,Information discovery | Journal |
Volume | Issue | ISSN |
6 | 3 | 1536-1233 |
Citations | PageRank | References |
34 | 1.67 | 19 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xin Liu | 1 | 3919 | 320.56 |
Qingfeng Huang | 2 | 749 | 50.42 |
Ying Zhang | 3 | 1692 | 118.14 |