Social-Aware Data Diffusion in Delay Tolerant MANETs
Most existing mobility-assisted data access techniques in delay tolerant mobile ad hoc networks (DT-MANETs) are designed to disseminate data to one or several particular destinations. Different from these works, we study the data diffusion problem which diffuses data among all moving nodes so that the nodes that are interested in this data item can get it easily either from their encountered friend nodes or stranger nodes. To reduce the data access delay, we introduce four social-aware data diffusion schemes based on the social relationship and data similarity of the contacts. We also provide solutions to quantify data/interest similarity and to determine whether two nodes are friends or strangers. Theoretical models are developed to analyze the data diffusion process and compare the performance of the four proposed diffusion schemes in terms of diffusion speed and query delay. We use real traces of human contacts to emulate data diffusion under different schemes. Both theoretical analysis and experimental results imply an interesting fact: to achieve better diffusion performance, each node should first diffuse the data similar to their common interests when it meets a friend, and first diffuse the data different to their common interests when it meets a stranger.
KeywordsInterested Node Data Item Data Diffusion Delay Tolerant Network Infected Node
Unable to display preview. Download preview PDF.
This work was supported in part by Network Science CTA under Grant W911NF-09-2-0053.
- 1.S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In SIGCOMM, pages 145–158, 2004.Google Scholar
- 2.W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In MobiHoc, pages 187–198, 2004.Google Scholar
- 3.T. Small and Z. J. Haas. The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way). In MobiHoc, pages 233–244, 2003.Google Scholar
- 5.E. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets. In MobiHoc, pages 32–40, 2007.Google Scholar
- 6.P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: Social based forwarding in delay tolerant networks. In MobiHoc, 2008.Google Scholar
- 9.J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In INFOCOM, 2006.Google Scholar
- 10.M. McPherson, L. Smith-Lovin, and J. Cook. Birds of a feather: Homophily in social networks. In Annual Review of Sociology, pages 15–44, 2001.Google Scholar
- 11.Cambridge Haggle Project. http://www.haggleproject.org/.
- 12.MIT Realisty Mining Project. http://reality.media.mit.edu/.
- 13.M. Motani, V. Srinivasan, and P. S. Nuggehalli. Peoplenet: engineering a wireless virtual social network. In MobiCom, pages 243–257, 2005.Google Scholar
- 14.W. Gao, Q. Li, B. Zhao, and G.Cao. Multicasting in delay tolerant networks: A social network perspective. In MobiHoc, 2009.Google Scholar
- 15.F. Bai and A. Helmy. Impact of mobility on last encounter routing protocols. SECON, pages 461–470, June 2007.Google Scholar
- 16.W. Gao, and G. Cao. On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks. In IEEE International conference on network protocols(ICNP), 2010.Google Scholar
- 17.Q. Li, S. Zhu, and G. Cao. Routing in socially selfish delay tolerant networks. In INFOCOM, 2010.Google Scholar
- 18.Y. Zhang, J. Zhao, G. Cao, and C. Das. On interest locality in content-based routing for large-scale manets. In IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS), pages 178–187, 2009.Google Scholar
- 19.A. Miklas, K. Gollu, K. Chan, S. Saroiu, K. Gummadi, and E. Lara. Exploiting social interactions in mobile systems. In UbiComp, 2007.Google Scholar
- 20.T. Karagiannis, J. Boudec, and M. Vojnović. Power law and exponential decay of inter contact times between mobile devices. In MobiCom, pages 183–194, 2007.Google Scholar
- 21.Y. Wang, B. Krishnarnachari, and T. Valente. Findings from an empirical study of fine-grained human social contacts. In The Sixth International Conference on Wireless On-Demand Network Systems and Services (WONS), pages 141–148, 2009.Google Scholar
- 22.W. Hsu, D. Dutta, and A. Helmy. Mining behavioral groups in large wireless lans. In MobiCom, pages 338–341, 2007.Google Scholar
- 24.Y. Zhang, J. Zhao, and G. Cao. Roadcast: a popularity aware content sharing scheme in vanets. In IEEE ICDCS, pages 223–230, 2009.Google Scholar
- 25.S. Kapadia, B. Krishnamachari, and S. Ghandeharizadeh. Static replication strategies for content availability in vehicular ad-hoc networks. Journal of Mobile Network and Applications (MONET), 14(5):590–610, 2009.Google Scholar
- 26.S. Ghandeharizadeh and S. Kapadia. An evaluation of location-demographic replacement policies for zebroids. In IEEE Consumer Communications and Networking Conference (CCNC), Jan 2006.Google Scholar
- 27.C. Boldrini, M. Conti, and A. Passarella. Contentplace: social-aware data dissemination in opportunistic networks. In MSWiM, pages 203–210, 2008.Google Scholar
- 28.V. Lenders, G. Karlsson, and M. May. Wireless ad hoc podcasting. In SECON, pages 273–283, 2007.Google Scholar
- 30.K. Lee, M. Le, J. Haerri, and M. Gerla. Louvre: Landmark overlays for urban vehicular routing environments. IEEE WiVeC, 2008.Google Scholar
- 31.Q. Yuan, I. Cardei, and J. Wu. Predict and relay: an efficient routing in disruption-tolerant networks. In MobiHoc, pages 95–104, 2009.Google Scholar
- 32.RDF Core Working Group http://www.w3.org/RDF/.
- 33.Web Services Description Language (WSDL) Version 2.0 http://www.w3.org/TR/wsdl20.
- 34.S. Kullback and R. A. Leibler. On information and sufficiency. In Annals of Mathematical Statistics 22: 79-86., 1951.Google Scholar
- 35.W. J. Reed. The pareto, zipf and other power laws. In Economics Letters, pages 15–19, 2001.Google Scholar