Breakdown by Rumors: Vulnerability of D2D Communications from Online Social Networks

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.

[1]  Xuemin Shen,et al.  Operator controlled device-to-device communications in LTE-advanced networks , 2012, IEEE Wireless Communications.

[2]  Xu Chen,et al.  Exploiting Social Ties for Cooperative D2D Communications: A Mobile Social Networking Case , 2015, IEEE/ACM Transactions on Networking.

[3]  Nam P. Nguyen,et al.  Containment of misinformation spread in online social networks , 2012, WebSci '12.

[4]  Zaher Dawy,et al.  Social Network Aware Device-to-Device Communication in Wireless Networks , 2015, IEEE Transactions on Wireless Communications.

[5]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[6]  Thang N. Dinh,et al.  Cost-aware Targeted Viral Marketing in billion-scale networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[7]  Carl Wijting,et al.  Device-to-device communication as an underlay to LTE-advanced networks , 2009, IEEE Communications Magazine.

[8]  Olav Tirkkonen,et al.  Resource Sharing Optimization for Device-to-Device Communication Underlaying Cellular Networks , 2011, IEEE Transactions on Wireless Communications.

[9]  Ashwin Gumaste,et al.  On the state and guiding principles of broadband in India , 2009, IEEE Communications Magazine.

[10]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[11]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[12]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[13]  Zhu Han,et al.  Optimal Base Station Scheduling for Device-to-Device Communication Underlaying Cellular Networks , 2016, IEEE Journal on Selected Areas in Communications.

[14]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[15]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.