The context of coordinating groups in dynamic mobile networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6721 LNCS, Issue , 2011, Pages 49-64

  Julien, Christine ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION OVERHEADS; COMPUTING ENVIRONMENTS; CONTEXT INFORMATION; CONTEXT-AWARENESS; SHARED CONTEXT; WIRELESS CONNECTION;

SEMANTICS;

EID: 79959750897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21464-6_4     Document Type: Conference Paper

References (24)

1. Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Improving collection selection with overlap awareness in p2p search engines. In: SIGIR (2005)
2. Bloom, B.: Space/time tradeoffs in hash coding with allowable errors. Comm. of the ACM 13(7) (1970)
3. Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics 1(4) (2004)
4. Byers, J., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. IEEE/ACM Trans. on Netw. 12(5) (2004)
5. Charles, D., Chellapilla, K.: Bloomier filters: A second look. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 259-270. Springer, Heidelberg (2008)
6. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: An efficient data structure for static support lookup tables. In: SIAM (2004)
7. Cohen, S., Matias, Y.: Spectral bloom filters. In: SIGMOD (2003)
8. Dorn, C., Truong, H.L., Dustdar, S.: Measuring and analyzing emerging properties for autonomic collaboration service adaptation. In: Rong, C., Jaatun, M.G., Sandnes, F.E., Yang, L.T., Ma, J. (eds.) ATC 2008. LNCS, vol. 5060, pp. 162-176. Springer, Heidelberg (2008)
9. Ferscha, A., Holzmann, C., Oppl, S.: Context awareness for group interaction support. In: MobiWac (2004)
10. Guo, D., Wu, J., Chen, H., Luo, X.: Theory and network applications of dynamic bloom filters. In: INFOCOM (2006)
11. Hackmann, G., Julien, C., Payton, J., Roman, G.C.: Supporting generalized context interactions. In: SEM (2005)
12. Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, p. 317. Springer, Heidelberg (2001)
13. Hebden, P., Pearce, A.: Bloom filters for data aggregation and discovery: A hierarchical clustering approach. In: ISSNIP (2005)
14. Jardak, C., Riihijarvi, J., Mahonen, P.: Analyzing the optimal use of bloom filters in wireless sensor networks storing replicas. In: WCNC (2009)
15. Jun, T., Julien, C.: Automated routing protocol selection in mobile ad hoc networks. In: SAC (2007)
16. Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High bandwidth data dissemination using an overlay mesh. In: SOSP (2003)
17. Kumar, A., Xu, J., Wang, J.: Space-code bloom filter for efficient per-flow traffic measurement. IEEE J. on Selected Areas in Comm. 24(12) (2006)
18. Ledlie, J., Taylor, J., Serben, L., Seltzer, M.: Self-organization in peer-to-peer systems. In: SIGOPS European Wkshp. (2002)
19. Mitzenmacher, M.: Compressed bloom filters. IEEE Trans. on Netw. 10(5) (2002)
20. Pagh, A., Pagh, R., Rao, S.: An optimal bloom filter replacement. In: SODA (2005)
21. Porat, E.: An optimal bloom filter replacement based on matrix solving. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 263-273. Springer, Heidelberg (2009)
22. Rhea, S., Kubiatowicz, J.: Probabilistic location and routing. In: INFOCOM (2002)
23. Salber, D., Dey, A.K., Abowd, G.D.: The context toolkit: Aiding the development of context-enabled applications. In: CHI (1999)
24. Wang, B., Bodily, J., Gupta, S.: Supporting persistent social groups in ubiquitous computing environments using context-aware ephemeral group service. In: PerCom (2004)