Message Transmission Scheme Based on the Detection of Interest Community in Mobile Social Networks

2018 ◽  
pp. 70-83
Author(s):  
Ying Cai ◽  
Linqing Hou ◽  
Yanfang Fan ◽  
Ruoyu Chen
Keyword(s):  
Social Networks ◽  
Mobile Social Networks ◽  
Transmission Scheme ◽  
Message Transmission

Community-based message transmission scheme in opportunistic social networks

2013 ◽  
Vol 33 (5) ◽  
pp. 1212-1216 ◽  
Author(s):  
Yahong LIU ◽  
Yuan GAO ◽  
Jinlong QIAO ◽  
Chunhua TAN
Keyword(s):  
Social Networks ◽  
Transmission Scheme ◽  
Community Based ◽  
Message Transmission

Cooperative Contents Distribution in Mobile Social Networks

2014 ◽  
Vol 36 (3) ◽  
pp. 613-625 ◽  
Author(s):  
Hai-Yang HU ◽  
Zhong-Jin LI ◽  
Hua HU ◽  
Ge-Hua ZHAO
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

A Framework for Protecting Privacy on Mobile Social Networks

2021 ◽  
Author(s):  
Seyyed Mohammad Safi ◽  
Ali Movaghar ◽  
Komeil Safikhani Mahmoodzadeh
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

scholarly journals Privacy-Enhancing k-Nearest Neighbors Search over Mobile Social Networks

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3994
Author(s):  
Yuxi Li ◽  
Fucai Zhou ◽  
Yue Ge ◽  
Zifeng Xu
Keyword(s):  
Social Networks ◽  
Access Control ◽  
Location Privacy ◽  
Nearest Neighbors ◽  
Search Pattern ◽  
Broadcast Encryption ◽  
Mobile Social Networks ◽  
K Nearest Neighbors ◽  
Fine Grained ◽  
Server Architecture

Focusing on the diversified demands of location privacy in mobile social networks (MSNs), we propose a privacy-enhancing k-nearest neighbors search scheme over MSNs. First, we construct a dual-server architecture that incorporates location privacy and fine-grained access control. Under the above architecture, we design a lightweight location encryption algorithm to achieve a minimal cost to the user. We also propose a location re-encryption protocol and an encrypted location search protocol based on secure multi-party computation and homomorphic encryption mechanism, which achieve accurate and secure k-nearest friends retrieval. Moreover, to satisfy fine-grained access control requirements, we propose a dynamic friends management mechanism based on public-key broadcast encryption. It enables users to grant/revoke others’ search right without updating their friends’ keys, realizing constant-time authentication. Security analysis shows that the proposed scheme satisfies adaptive L-semantic security and revocation security under a random oracle model. In terms of performance, compared with the related works with single server architecture, the proposed scheme reduces the leakage of the location information, search pattern and the user–server communication cost. Our results show that a decentralized and end-to-end encrypted k-nearest neighbors search over MSNs is not only possible in theory, but also feasible in real-world MSNs collaboration deployment with resource-constrained mobile devices and highly iterative location update demands.

scholarly journals Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Relay Node ◽  
Network Routing ◽  
Transmission Factor ◽  
Transmission Scheme ◽  
Network Delay ◽  
Significant Burden

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.

scholarly journals Preserving Secrecy in Mobile Social Networks

2020 ◽  
Vol 5 (1) ◽  
pp. 1-29 ◽  
Author(s):  
Gabriela Suntaxi ◽  
Aboubakr Achraf El Ghazi ◽  
Klemens Böhm
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

Morality-Driven Data Forwarding With Privacy Preservation in Mobile Social Networks

2012 ◽  
Vol 61 (7) ◽  
pp. 3209-3222 ◽  
Author(s):  
Xiaohui Liang ◽  
Xu Li ◽  
Tom H. Luan ◽  
Rongxing Lu ◽  
Xiaodong Lin ◽  
...  
Keyword(s):  
Social Networks ◽  
Privacy Preservation ◽  
Mobile Social Networks ◽  
Data Forwarding

A Dynamic Trust Framework for Opportunistic Mobile Social Networks

2018 ◽  
Vol 15 (1) ◽  
pp. 319-329 ◽  
Author(s):  
Eric Ke Wang ◽  
Yueping Li ◽  
Yunming Ye ◽  
S. M. Yiu ◽  
Lucas C. K. Hui
Keyword(s):  
Social Networks ◽  
Mobile Social Networks ◽  
Dynamic Trust ◽  
Opportunistic Mobile Social Networks
Sign in / Sign up

Export Citation Format

Share Document