DRL: A New Mobility Model in Mobile Social Networks

2015 ◽  
pp. 263-273
Author(s):  
Tao Jing ◽  
Yating Zhang ◽  
Zhen Li ◽  
Qinghe Gao ◽  
Yan Huo ◽  
...  
Keyword(s):  
Social Networks ◽  
Mobility Model ◽  
Mobile Social Networks

DRL: A Multi-factor Mobility Model in Mobile Social Networks

2016 ◽  
Vol 95 (2) ◽  
pp. 1693-1711
Author(s):  
Tao Jing ◽  
Yating Zhang ◽  
Zhen Li ◽  
Yan Huo
Keyword(s):  
Social Networks ◽  
Mobility Model ◽  
Mobile Social Networks ◽  
Factor Mobility

scholarly journals A Study on the Node Centrality Based Multisocial Attributes Weighted in Mobile Social Networks

2018 ◽  
Vol 17 ◽  
pp. 01001
Author(s):  
Yanhong Meng ◽  
Xianxian Liu ◽  
Peirong Zhao ◽  
Yunhui Yi
Keyword(s):  
Social Networks ◽  
Social Relations ◽  
Human Mobility ◽  
Data Communication ◽  
Graph Model ◽  
Real Data ◽  
Mobility Model ◽  
Mobile Social Networks ◽  
Data Set ◽  
Binary Network

Mobile social networks (MSNs) exploit human mobility and consequent device-to-device contact to opportunistically realize data communication. Thus links in MSNs is dynamic changing over time and strongly influenced by people activities, mining influential nodes is one of the important questions for effective information transmission in MSNs. While traditional centrality definitions are based on the static binary network model and not suitable for time-varying topology structure in mobile social network. Furthermore previous centrality metrics often referred to social attributes about neighbor nodes and contact times, and did not take the contact duration time into consideration. Therefore, this paper proposes a centrality measurement method based on multi-social attributes weighted. We first use the temporal evolution graph model which more accurately depicts the dynamic nature of topology in MSNs. Quantifying human social relations and mobility model as weights for the links, and then we redefine degree of centrality and the measurement of shortest path. Finally, the superiority of the concepts we posed are evaluated in the real data set.

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 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
Sign in / Sign up

Export Citation Format

Share Document