Efficient social-aware content placement in opportunistic networks

WONS 2010 - 7th International Conference on Wireless On-demand Network Systems and Services

Volumn , Issue , 2010, Pages 17-24

  Pantazopoulos, Panagiotis ^a   Stavrakakis, Ioannis ^a   Passarella, Andrea ^b   Conti, Marco ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AS CONTENT; DEGREE OF CONVERGENCE; DEMAND INFORMATION; GLOBAL TOPOLOGY; K-MEDIAN; NETWORKING ENVIRONMENT; NETWORKING STRUCTURE; OPPORTUNISTIC NETWORKS; OPTIMAL CONTENT; OPTIMAL LOCATIONS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; PLACEMENT PROBLEMS; RANDOM GRAPHS; SCALABLE APPROACH; SMALL-SCALE NETWORKS; SOCIAL STRUCTURE; USER-GENERATED CONTENT;

LOCATION; OPTIMIZATION;

WIRELESS NETWORKS;

EID: 77952171330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WONS.2010.5437139     Document Type: Conference Paper

References (24)

1. L. Pelusi, A. Passarella, and M. Conti, "Opportunistic networking: data forwarding in disconnected mobile ad hoc networks," IEEE Communications Magazine, vol.44, no.11, p. 134, 2006.
2. C. Boldrini, M. Conti, and A. Passarella, "ContentPlace: social-aware data dissemination in opportunistic networks," in Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems. ACM New York, NY, USA, 2008, pp. 203-210.
3. E. Jaho and I. Stavrakakis, "Joint interest- and locality-aware content dissemination in social networks," in IFIP/IEEE WONS, Snowbird, Utah, USA, February 2-4, 2009.
4. P. Erdos and A. Rényi, "On random graphs. I," Publ. Math. Debrecen, vol.6, pp. 290-297, 1959.
5. A. L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol.286, no.5439, pp. 509-512, Oct 1999.
6. P. Hui, E. Yoneki, S. Y. Chan, and J. Crowcroft, "Distributed community detection in delay tolerant networks," in MobiArch '07. New York, NY, USA: ACM, 2007, pp. 1-8.
7. V. Borrel, M. H. Ammar, and E. W. Zegura, "Understanding the wireless and mobile network space: a routing-centered classification," in Challenged Networks, 2007, pp. 11-18.
8. P. Mirchandani and R.Francis, Discrete location theory, John Wiley and Sons, 1990.
9. N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems," SIAM Journal on Computing, vol.13, no.1, pp. 182-196, 1984.
10. I. Baev, R. Rajaraman, and C. Swamy, "Approximation algorithms for data placement problems," SIAM Journal on Computing, vol.38, no.4, pp. 1411-1429, 2008.
11. T. Moscibroda and R. Wattenhofer, "Facility location: distributed approximation," in PODC '05, 2005, pp. 108-117.
12. E. Yoneki, P. Hui, S. Chan, and J. Crowcroft, "A socio-aware overlay for publish/subscribe communication in delay tolerant networks," in MSWiM '07, Chania, Greece, 2007.
13. D. B. Shmoys, E. Tardos, and K. Aardal, "Approximation algorithms for facility location problems (extended abstract)," in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1998, pp. 265-274.
14. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, "Local search heuristic for k-median and facility location problems," in STOC '01. ACM, 2001, pp. 21-29.
15. G. Wittenburg and J. Schiller, "A survey of current directions in service placement in mobile ad-hoc networks," in PERCOM '08. IEEE Computer Society, 2008, pp. 548-553.
16. C. Frank and K. Römer, "Distributed facility location algorithms for flexible configuration of wireless sensor networks." ser. Lecture Notes in Computer Science, vol.4549. Springer, 2007, pp. 124-141.
17. K. Oikonomou, I. Stavrakakis, and A. Xydias, "Scalable service migration in general topologies," in WOWMOM, 2008, pp. 1-6.
18. G. Smaragdakis, N. Laoutaris, K. Oikonomou, I. Stavrakakis, and A. Bestavros, "Distributed Server Migration for Scalable Internet Service Deployment," IEEE/ACM Transactions on Networking, (To Appear) 2010.
19. M. Evans, A. Phippen, G. Mueller, S. Furnell, P. Sanders, and P. Reynolds, "Strategies for content migration on the world wide web," Internet Research, vol.9, no.1, pp. 25-34, 1999.
20. L. C. Freeman, "A set of measures of centrality based on betweenness," Sociometry, vol.40, no.1, pp. 35-41, 1977.
21. -, "Centrality in social networks: Conceptual clarification," Social Networks, vol.1, no.3, pp. 215-239.
22. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press, September 2001.
23. U. Brandes, "A faster algorithm for betweenness centrality," Journal of Mathematical Sociology, vol.25, pp. 163-177, 2001.
24. R. Solis-Oba,"Approximation algorithms for the k-median problem," in Efficient Approximation and Online Algorithms, ser. Lecture Notes in Computer Science, vol.3484. Springer, 2006, pp. 292-320.