scholarly journals Privacy-enhanced social-network routing

2012 ◽  
Vol 35 (1) ◽  
pp. 62-74 ◽  
Author(s):  
Iain Parris ◽  
Tristan Henderson
Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu

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.


2015 ◽  
Vol 19 (1/2) ◽  
pp. 86
Author(s):  
Hung Chin Jang ◽  
Pei Hsuan Lee

2021 ◽  
Author(s):  
Xiaoyi Fang ◽  
Junling Shi ◽  
Yingyou Wen ◽  
Zhaoyu Yang ◽  
Xinran Zhang

2013 ◽  
Vol 44 (2) ◽  
pp. 22
Author(s):  
ALAN ROCKOFF
Keyword(s):  

2015 ◽  
Vol 21 ◽  
pp. 301
Author(s):  
Armand Krikorian ◽  
Lily Peng ◽  
Zubair Ilyas ◽  
Joumana Chaiban

Sign in / Sign up

Export Citation Format

Share Document