Network warehouses: Efficient information distribution to mobile users

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 2069-2077

  Motskin, Arik ^a   Downes, Ian ^a   Kusy, Branislav ^b   Gnawali, Omprakash ^a   Guibas, Leonidas ^a  

^a STANFORD UNIVERSITY   (United States)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ADDRESSING SCHEME; COMMUNICATION OVERHEADS; DATA DRIVEN; HIGH PROBABILITY; INFORMATION DELIVERY; INFORMATION DISTRIBUTIONS; INFORMATION SOURCES; LOSSY LINKS; MOBILE USERS; MOBILITY PATTERN; MULTICAST ALGORITHMS; MULTICAST PROTOCOL; NODE FAILURE; ROUTING INFRASTRUCTURE; SPATIAL CLUSTERING; TIME-SENSITIVE INFORMATION;

ALGORITHMS; GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; MULTICASTING; NETWORK PROTOCOLS; PLANT EXTRACTS; WAREHOUSES; WIRELESS AD HOC NETWORKS;

WIRELESS NETWORKS;

EID: 79960854571     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935015     Document Type: Conference Paper

References (17)

1. Funkfeuer Free Net.
2. Y. Barta!' Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS, pages 184-193, 1996.
3. Y. Barta!' On approximating arbitrary metrics by tree metrics. In STOC, pages 161-168, 1998.
4. D. S. J. De Couto, D. Aguayo, J. C. Bicket, and R. Morris. A highthroughput path metric for multi-hop wireless routing. In MOBICOM, pages 134-146, 2003.
5. S. Deering and D. Cheriton. Multicast routing in datagram intemetworks and extended lans. ACM Trans. Comput. Syst., 8(2):85-110, 1990.
6. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, c.-G. Liu, and L. Wei. An architecture for wide-area multicast routing. In SIGCOMM '94, pages 126-135, 1994.
7. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In STOC, pages 448-455, 2003.
8. R. Fonseca, S. Ratnasamy, J. Zhao, C. T. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point routing in wireless sensomets. In Proceedings of the USENIX NSDI Con/, 2005.
9. J. Gao,L. Guibas,N. Milosavljevic,a nd D. Zhou. Distributed resource management and matching in sensor networks. In IPSN, April 2009.
10. X. Hong, M. Gerla, G. Pei, and c.-c. Chiang. A group mobility model for ad hoc wireless networks. In MSWiM, pages 53-60, 1999.
11. D. Karger and M. Ruh!. Finding nearest neighbors in growth-restricted metrics. In STOC, pages 741-750, 2002.
12. H. S. Kim, T. Abdelzaher, and W. H. Kwon. Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In SenSys, pages 193-204,2003.
13. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In SODA, pages 798-807, 2004.
14. S. J. Lee, W. Su, and M. Gerla. On-demand multicast routing protocol in multi hop wireless mobile networks. Mob. Netw. Appl., 7(6):441-453, 2002.
15. Y. Mao, F. Wang, L. Qiu, S. Lam, and J. M. Smith. S4: Small state and small stretch routing protocol for large wireless sensor networks. In Proc. of the USENIX NSDI Cotif', 2007.
16. A. Motskin, I. Downes, B. Kusy, O. Gnawali, and L. Guibas. Network warehouses technical report. Technical report, http://www.stanford.eduamotskin/ infocom11-tech.pdf, Stanford University, 2009.
17. R. Patra, S. Nedevschi, S. Surana, A. Sheth, L. Subramanian, and E. Brewer. Wildnet: Design and implementation of high performance wifi based long distance networks. In Proceedings of the USENIX NSDJ Con/, 2007.