Social-Aware Data Dissemination via Device-to-Device Communications: Fusing Social and Mobile Networks with Incentive Constraints

Nowadays, pervasive mobile devices not only pose new challenges for existing wireless networks to accommodate the surging demands, but also offer new opportunities to support various services. For example, device-to-device (D2D) communications provide a promising paradigm for data dissemination with low resource cost and high energy efficiency. In this paper, we propose a three-phase approach for D2D data dissemination, which exploits social-awareness and opportunistic contacts with user mobility. The proposed approach includes one phase of seed selection and two subsequent phases of data forwarding. In Phase I, we build a social-physical graph model, which combines the social network and the mobile network with opportunistic transmissions. Then we partition the social-physical graph into communities using the Girvan-Newman algorithm based on edge-betweenness, and select seeds for the communities according to vertex-closeness. In Phase II, data forwarding only takes place among socially connected users. In Phase III, the base station intervenes to enable data forwarding among cooperative users. For Phases II and III, we propose the new mechanisms for message selection and cooperation pairing, which take into account both altruistic and selfish behaviors of users. The theoretical analysis for the message selection mechanism proves its truthfulness and approximation ratio in the worst case. Extensive simulation results further demonstrate the effectiveness of the proposed three-phase approach with various synthetic and real tracing datasets.

[1]  Xu Chen,et al.  Social trust and social reciprocity based cooperative D2D communications , 2013, MobiHoc.

[2]  Zhu Han,et al.  Dynamic Popular Content Distribution in Vehicular Networks using Coalition Formation Games , 2012, IEEE Journal on Selected Areas in Communications.

[3]  Peijian Ju,et al.  Repeated Game Analysis for Cooperative MAC With Incentive Design for Wireless Networks , 2016, IEEE Transactions on Vehicular Technology.

[4]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[5]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[6]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[7]  Zhu Han,et al.  Self-Interest-Driven incentives for ad dissemination in autonomous mobile social networks , 2013, 2013 Proceedings IEEE INFOCOM.

[8]  Bo Li,et al.  Rado: A Randomized Auction Approach for Data Offloading via D2D Communication , 2015, 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems.

[9]  Kate Ching-Ju Lin,et al.  Preference-aware content dissemination in opportunistic mobile social networks , 2012, 2012 Proceedings IEEE INFOCOM.

[10]  Junshan Zhang,et al.  Information diffusion in overlaying social-physical networks , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[11]  Zhu Han,et al.  Social-Aware Peer Discovery for D2D Communications Underlaying Cellular Networks , 2015, IEEE Transactions on Wireless Communications.

[12]  Kate Ching-Ju Lin,et al.  Source Selection and Content Dissemination for Preference-Aware Traffic Offloading , 2015, IEEE Transactions on Parallel and Distributed Systems.

[13]  Shouling Ji,et al.  Strengthen nodal cooperation for data dissemination in mobile social networks , 2014, Personal and Ubiquitous Computing.

[14]  Shaddin Dughmi,et al.  Truthful assignment without money , 2010, EC '10.

[15]  Yannick Rochat,et al.  Closeness Centrality Extended to Unconnected Graphs: the Harmonic Centrality Index , 2009 .

[16]  Kate Ching-Ju Lin,et al.  Cellular traffic offloading through community-based opportunistic dissemination , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[17]  George Varghese,et al.  MobiClique: middleware for mobile social networking , 2009, WOSN '09.

[18]  Alvin E. Roth,et al.  The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..

[19]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[20]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[21]  Martin Bichler,et al.  Truthful Combinatorial Assignment without Money , 2015 .

[22]  Zhu Han,et al.  Efficient resource allocation for mobile social networks in D2D communication underlaying cellular networks , 2014, 2014 IEEE International Conference on Communications (ICC).

[23]  T. Govier Social trust and human communities , 1997 .

[24]  Alexis Papadimitriou,et al.  Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks , 2012, J. Netw. Comput. Appl..

[25]  Jacob D. Leshno,et al.  Unbalanced Random Matching Markets: The Stark Effect of Competition , 2017, Journal of Political Economy.

[26]  L. B. Wilson,et al.  Stable marriage assignment for unequal sets , 1970 .

[27]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[28]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[29]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

[30]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.