Abstract
In this paper, we study how rumors in Online Social Networks (OSNs) may impact the performance of device-to-device (D2D) communication. As D2D is a new technology, people may choose not to use it when believed in rumors of its negative impacts. Thus, the cellular network with underlaying D2D is vulnerable to OSNs as rumors in OSNs may decrement the throughput of the cellular network in popular content delivery scenarios. To analyze the vulnerability, we introduce the problem of finding the most critical nodes in the OSN such that the throughput of a content delivery scenario is minimized when a rumor starts from those nodes. We then propose an efficient solution to the critical nodes detection problem. The severity of such vulnerability is supported by extensive experiments in various simulation settings, from which we observe up to \(40\%\) reduction in network throughput.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cisco Visual Networking Index Cisco. Global mobile data traffic forecast update, 2015–2020. White paper (2016)
Klaus, D., Rinne, M., Wijting, C., Ribeiro, C.B., Hugl, K.: Device-to-device communication as an underlay to LTE-advanced networks. IEEE Commun. Mag. 47(12), 42–49 (2009)
Yu, C.-H., Doppler, K., Ribeiro, C.B., Tirkkonen, O.: Resource sharing optimization for device-to-device communication underlaying cellular networks. IEEE Trans. Wirel. Commun. 10(8), 2752–2763 (2011)
Lei, L., Zhong, Z., Lin, C., Shen, X.: Operator controlled device-to-device communications in LTE-advanced networks. IEEE Wirel. Commun. 19(3), 96 (2012)
Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: Proceedings of the 4th Annual ACM Web Science Conference, pp. 213–222. ACM (2012)
Chen, X., Proulx, B., Gong, X., Zhang, J.: Exploiting social ties for cooperative D2D communications: a mobile social networking case. IEEE/ACM Trans. Netw. 23(5), 1471–1484 (2015)
Zhang, Y., Pan, E., Song, L., Saad, W., Dawy, Z., Han, Z.: Social network aware device-to-device communication in wireless networks. IEEE Trans. Wirel. Commun. 14(1), 177–190 (2015)
Li, Y., Jin, D., Hui, P., Han, Z.: Optimal base station scheduling for device-to-device communication underlaying cellular networks. IEEE J. Sel. Areas Commun. 34(1), 27–40 (2016)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM (2007)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208. ACM (2009)
Borgs, C., Brautbar, M., Chayes, C., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. SIAM (2014)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539–1554. ACM (2015)
Nguyen, H.T., Thai, M.T., Dinh, T.N.: Cost-aware targeted viral marketing in billion-scale networks. In: 2016 IEEE Conference on Computer Communications (INFOCOM). IEEE (2016)
Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, Heidelberg (2013)
Pan, T., Alim, M.A., Li, X., Thai, M.T.: Vulnerability of D2D communications from interconnected social networks. arxiv preprint arXiv:1702.02040 (2017)
McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, vol. 2012, pp. 548–56 (2012)
Acknowledgement
This work is partially supported by NSF CNS-1443905 and NSF EFRI-1441231.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Pan, T., Alim, M.A., Li, X., Thai, M.T. (2017). Breakdown by Rumors: Vulnerability of D2D Communications from Online Social Networks. In: Ma, L., Khreishah, A., Zhang, Y., Yan, M. (eds) Wireless Algorithms, Systems, and Applications. WASA 2017. Lecture Notes in Computer Science(), vol 10251. Springer, Cham. https://doi.org/10.1007/978-3-319-60033-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-319-60033-8_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60032-1
Online ISBN: 978-3-319-60033-8
eBook Packages: Computer ScienceComputer Science (R0)