Volume 8, Issue 7 pp. 1291-1305
Research Article
Free to Read

ReDD: recommendation-based data dissemination in privacy-preserving mobile social networks

Le Chen

Le Chen

Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240 China

School of Electrical and Electronics Engineering, Nanyang Technological University, 639798 Singapore

Search for more papers by this author
Rongxing Lu

Corresponding Author

Rongxing Lu

School of Electrical and Electronics Engineering, Nanyang Technological University, 639798 Singapore

Correspondence: Rongxing Lu, School of Electrical and Electronics Engineering, Nanyang Technological University, 639798, Singapore.

E-mail: [email protected]

Search for more papers by this author
Khalid AlHarbi

Khalid AlHarbi

Faculty of Business and Information Technology, University of Ontario Institute of Technology, Ontario, L1H 7K4 Canada

Search for more papers by this author
Xiaodong Lin

Xiaodong Lin

Faculty of Business and Information Technology, University of Ontario Institute of Technology, Ontario, L1H 7K4 Canada

Search for more papers by this author
Zhenfu Cao

Zhenfu Cao

Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240 China

Search for more papers by this author
First published: 21 August 2014
Citations: 5

Abstract

Mobile social network (MSN), which is built upon popular smart phone devices and enables mobile users with similar interests to connect with one another, has received considerable attention in recent years. A common phenomenon that makes the MSN vivid today is mobile users often like to share attractive things to their friends in MSN. In this paper, based on this common phenomenon, we propose an efficient recommendation-based data dissemination (ReDD) protocol for MSN, which can efficiently disseminate high-quality messages in a privacy-preserving way. Specifically, in the proposed ReDD protocol, each mobile user, based on both his or her own view and his or her friends' recommendations, will form his or her personal estimation on the quality of a message. Only if the estimation of quality reaches a threshold, the message will be disseminated. In this way, high-quality messages can be widely spread in the network and occupy more network resources than low-quality ones. In order to check the validity of friends' recommendations, ReDD also employs an efficient anonymous authentication technique, which ensures that only the friends of a user can verify recommendations made by the user. Detailed security analysis demonstrates that ReDD can effectively resist various attacks launched by attackers and ensure identity privacy of nodes, confidentiality of shared keys and integrity of data packets. In addition, extensive simulations are also conducted to evaluate the performance of ReDD in terms of the number of active nodes and the average active time, and the simulation results show that high-quality messages can be disseminated widely and efficiently, while low-quality ones will be eliminated shortly to avoid occupying network resources. Copyright © 2014 John Wiley & Sons, Ltd.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.