Journal Home > Volume 2 , Issue 1
Big Data Mining and Analytics 2019, 2(1): 12-24 https://doi.org/10.26599/BDMA.2018.9020028
Open Access | Issue | Published: 15 October 2018

Disseminating Authorized Content via Data Analysis in Opportunistic Social Networks

Show Author's Information Chenguang Kong( ),  Guangchun Luo,  Ling Tian,  Xiaojun Cao
Department of Computer Science, Georgia State University, Atlanta, GA 30309, USA.
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China.
Keywords:
multi-view clustering, fuzzy clustering, High-Speed Train (HST), condition recognition
Cite this article:
Kong C, Luo G, Tian L, et al. Disseminating Authorized Content via Data Analysis in Opportunistic Social Networks. Big Data Mining and Analytics, 2019, 2(1): 12-24. https://doi.org/10.26599/BDMA.2018.9020028
Download citation
EndNote(RIS)
BibTeX

642

Views

39

Downloads

Citations

11

Crossref

11

WoS

12

Scopus

0

CSCD

Abstract Full text About this article

Authorized content is a type of content that can be generated only by a certain Content Provider (CP). The content copies delivered to a user may bring rewards to the CP if the content is adopted by the user. The overall reward obtained by the CP depends on the user’s degree of interest in the content and the user’s role in disseminating the content copies. Thus, to maximize the reward, the content provider is motivated to disseminate the authorized content to the most interested users. In this paper, we study how to effectively disseminate the authorized content in Interest-centric Opportunistic Social Networks (IOSNs) such that the reward is maximized. We first derive Social Connection Pattern (SCP) data to handle the challenging opportunistic connections in IOSNs and statistically analyze the interest distribution of the users contacted or connected. The SCP is used to predict the interests of possible contactors and connectors. Then, we propose our SCP-based Dissemination (SCPD) algorithm to calculate the optimum number of content copies to disseminate when two users meet. Our dataset based simulation shows that our SCPD algorithm is effective and efficient to disseminate the authorized content in IOSNs.


menu
Abstract
Full text
Outline
About this article

Disseminating Authorized Content via Data Analysis in Opportunistic Social Networks

Show Author's information Chenguang Kong( ), Guangchun Luo, Ling Tian, Xiaojun Cao
Department of Computer Science, Georgia State University, Atlanta, GA 30309, USA.
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China.

Abstract

Authorized content is a type of content that can be generated only by a certain Content Provider (CP). The content copies delivered to a user may bring rewards to the CP if the content is adopted by the user. The overall reward obtained by the CP depends on the user’s degree of interest in the content and the user’s role in disseminating the content copies. Thus, to maximize the reward, the content provider is motivated to disseminate the authorized content to the most interested users. In this paper, we study how to effectively disseminate the authorized content in Interest-centric Opportunistic Social Networks (IOSNs) such that the reward is maximized. We first derive Social Connection Pattern (SCP) data to handle the challenging opportunistic connections in IOSNs and statistically analyze the interest distribution of the users contacted or connected. The SCP is used to predict the interests of possible contactors and connectors. Then, we propose our SCP-based Dissemination (SCPD) algorithm to calculate the optimum number of content copies to disseminate when two users meet. Our dataset based simulation shows that our SCPD algorithm is effective and efficient to disseminate the authorized content in IOSNs.

Keywords: multi-view clustering, fuzzy clustering, High-Speed Train (HST), condition recognition

References(28)

[1]
Wi-Fi Alliance, Official industry association, http://www.wi-fi.org/, 2011.
[2]
NFC, NFC forum, http://nfc-forum.org/, 2016.
[3]
Z. Su and Q. C. Xu, Content distribution over content centric mobile social networks in 5G, IEEE Commun. Mag., vol. 53, no. 6, pp. 66-72, 2015.
DOI Google Scholar
[4]
C. G. Kong and X. J. Cao, Semi-controlled authorized information dissemination in content-based social networks, in Proc. 23rd Int. Conf. Computer Communication and Networks, Shanghai, China, 2014.
DOI
[5]
C. G. Kong and X. J. Cao, Disseminating authorized content in interest-centric opportunistic social networks, in Proc. 24th Int. Conf. Computer Communication and Networks, Las Vegas, NV, USA, 2015.
DOI
[6]
K. Lin, C. Chen, and C. Chou, Preference-aware content dissemination in opportunistic mobile social networks, in Proc. 2012 IEEE INFOCOM, Orlando, FL, USA, 2012.
[7]
R. I. Ciobanu, R. C. Marin, C. Dobre, V. Cristea, and C. X. Mavromoustakis, ONSIDE: Sociallyaware and interestbased dissemination in opportunistic networks, in Proc. 2014 IEEE Network Operations and Management Symp. (NOMS), Krakow, Poland, 2014.
DOI
[8]
T. Ning, Z. P. Yang, H. Y. Wu, and Z. Han, Self-interest-driven incentives for ad dissemination in autonomous mobile social networks, in Proc. 2013 IEEE INFOCOM, Turin, Italy, 2013.
DOI
[9]
Y. M. Zhao, W. Song, and Z. Han, Social-aware data dissemination via device-to-device communications: Fusing social and mobile networks with incentive constraints, IEEE Trans. Serv. Comput., .
DOI Google Scholar
[10]
B. Jedari and F. Xia, A survey on routing and data dissemination in opportunistic mobile social networks, arXiv preprint arXiv: 1311.0347, 2013.
Google Scholar
[11]
M. J. Xiao, J. Wu, and L. S. Huang, Community-aware opportunistic routing in mobile social networks, IEEE Trans. Comput., vol. 63, no. 7, pp. 1682-1695, 2014.
DOI Google Scholar
[12]
A. K. Pietilänen and C. Diot, Dissemination in opportunistic social networks: The role of temporal communities, in Proc. 13th ACM Int. Symp. Mobile Ad Hoc Networking and Computing, Hilton Head, SC, USA, 2012.
DOI
[13]
K. Thilakarathna, A. C. Viana, A. Seneviratne, and H. Petander, Mobile social networking through friendto-friend opportunistic content dissemination, in Proc. 14th ACM Int. Symp. Mobile Ad Hoc Networking and Computing, Bangalore, India, 2013.
DOI
[14]
C. Boldrini, M. Conti, and A. Passarella, Contentplace: Social-aware data dissemination in opportunistic networks, in Proc. 11th Int. Symp. Modeling Analysis and Simulation of Wireless and Mobile Systems, Vancouver, Canada, 2008.
DOI
[15]
J. L. Fan, Y. Du, W. Gao, J. M. Chen, and Y. X. Sun, Geographyaware active data dissemination in mobile social networks, in Proc. 7th IEEE Int. Conf. on Mobile Adhoc and Sensor Systems, San Francisco, CA, USA, 2010.
DOI
[16]
J. L. Fan, J. M. Chen, Y. Du, W. Gao, J. Wu, and Y. X. Sun, Geocommunity-based broadcasting for data dissemination in mobile social networks, IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 4, pp. 734-743, 2013.
DOI Google Scholar
[17]
X. F. Wang, Z. G. Sheng, S. S. Yang, and V. C. M. Leung, Tagassisted social-aware opportunistic device-to-device sharing for traffic offloading in mobile social networks, IEEE Wirel. Commun., vol. 23, no. 4, pp. 60-67, 2016.
DOI Google Scholar
[18]
X. Zhang, Z. H. Zhang, J. Xing, R. Yu, P. W. Zhang, and W. B. Wang, Exact outage analysis in cognitive two-way relay networks with opportunistic relay selection under primary user’s interference, IEEE Trans. Veh. Technol., vol. 64, no. 6, pp. 2502-2511, 2015
DOI Google Scholar
[19]
J. T. Li, Q. F. Qi, Q. C. Xu, and Z. Su, Graph based content delivery in mobile social networks, in Proc. 12th Int. Conf. Mobile Ad-Hoc and Sensor Networks (MSN), Hefei, China, 2016, pp. 348-352.
DOI
[20]
Q. C. Xu, Z. Su, and S. Guo, A game theoretical incentive scheme for relay selection services in mobile social networks, IEEE Trans. Veh. Technol., vol. 65, no. 8, pp. 6692-6702, 2016.
DOI Google Scholar
[21]
U. Shevade, H. H. Song, L. L. Qiu, and Y. Zhang, Incentiveaware routing in DTNs, in Proc. 2008 IEEE Int. Conf. Network Protocols, Orlando, FL, USA, 2008.
DOI
[22]
J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, Crawdad trace cambridge/haggle/imote/ infocom2006, http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom, 2006.
[23]
A. K. Pietilainen and C Diot , The thlab/sigcomm2009 (  v20120715  ),        http://crawdadorg/thlab/sigcomm2009/, 2012.
[24]
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, in Proc. 7th ACM SIGCOMM Conf. Internet Measurement, San Diego, CA, USA, 2007.
DOI
[25]
C. O. Rolim, V. R. Q. Leithardt, A. G. Rossetto, T. F. M. dos Santos, A. M. Souza, and C. F. R. Geyer, Six degrees of separation to improve routing in opportunistic networks, Int. J. UbiComp., vol. 4, no. 3, pp. 11-22, 2013.
DOI Google Scholar
[26]
T. Hossmann, T. Spyropoulos, and F. Legendre, A complex network analysis of human mobility, in Proc. 2011 IEEE Conf. Computer Communications Workshops, Shanghai, China, 2011.
DOI
[27]
A. H. Land and A. G. Doig, An automatic method of solving discrete programming problems, Econometrica, vol. 28, no. 3, pp. 497-520, 1960.
DOI Google Scholar
[28]
Y. S. Wang and J. Wu, Social-tie-based information dissemination in mobile opportunistic social networks, in Proc. 14th IEEE Int. Symp. "A World of Wireless Mobile and Multimedia Networks" (WoWMoM), Madrid, Spain, 2013.
Publication history
Copyright
Rights and permissions

Publication history

Received: 18 April 2018
Accepted: 03 May 2018
Published: 15 October 2018
Issue date: March 2019

Copyright

© The author(s) 2019

Rights and permissions

Return