Effective Data Transmission Based on Cluster User Communications in Opportunistic Complexity Social Networks

被引:4
作者
Xiong, Wangping [1 ]
Zhou, Xian [1 ]
Wu, Jia [2 ]
机构
[1] Jiangxi Univ Tradit Chinese Med, Sch Comp, Nanchang, Jiangxi, Peoples R China
[2] Cent South Univ, Sch Comp Sci & Engn, Changsha 410083, Peoples R China
基金
中国国家自然科学基金;
关键词
Social networking (online); Routing; Data communication; Heuristic algorithms; Delays; Complexity theory; Relays; Data transmission; interest characteristic; opportunistic social complexity networks; historical behavior; user; ALGORITHM;
D O I
10.1109/ACCESS.2020.3034468
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Social networks are very important information dissemination platforms. Messages in social networks are forwarded through encounters formed by moving nodes in opportunistic complexity network. However, with the gradual expansion of the network scale, the amount of data to be transmitted has increased dramatically, which has brought greater load to the entire network. In order to improve this transmission environment, this paper proposes a transmission mechanism that selects cooperative nodes based on the user's interest. In communication, the degree of matching of node preferences is calculated, and highly matched nodes are selected for priority transmission. This method reduces the occupation of cache resources by redundant information in the network by filtering the message transmission mode of the cooperative nodes, and improves the space utilization of the message cache. Through the comparison of experiments and social network algorithms, this method improves the node's cache utilization, reduces the data transmission delay, and improves the overall network efficiency.
引用
收藏
页码:196472 / 196481
页数:10
相关论文
共 25 条
[1]  
Batabyal S, 2014, 2014 APPLICATIONS AND INNOVATIONS IN MOBILE COMPUTING (AIMOC), P9, DOI 10.1109/AIMOC.2014.6785512
[2]   Applying a sensor energy supply communication scheme to big data opportunistic networks [J].
Chen, Zhigang ;
Wu, Jia .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2016, 10 (05) :2029-2046
[3]  
De Rango F, 2013, INT WIREL COMMUN, P731, DOI 10.1109/IWCMC.2013.6583647
[4]   Effective Data Communication Based on Social Community in Social Opportunistic Networks [J].
Guan, Peiyuan ;
Wu, Jia .
IEEE ACCESS, 2019, 7 :12405-12414
[5]   An Analytical Model Based on Population Processes to Characterize Data Dissemination in 5G Opportunistic Networks [J].
Hernandez-Orallo, Enrique ;
Murillo-Arcila, Marina ;
Cano, Juan-Carlos ;
Calafate, Carlos T. ;
Conejero, J. Alberto ;
Manzoni, Pietro .
IEEE ACCESS, 2018, 6 :1603-1615
[6]   BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks [J].
Hui, Pan ;
Crowcroft, Jon ;
Yoneki, Eiko .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (11) :1576-1589
[7]   Node-Oriented Secure Data Transmission Algorithm Based on IoT System in Social Networks [J].
Li, Xiaoli ;
Wu, Jia .
IEEE COMMUNICATIONS LETTERS, 2020, 24 (12) :2898-2902
[8]   Advanced Data Delivery Strategy Based on Multiperceived Community with IoT in Social Complex Networks [J].
Luo, Jingwen ;
Wu, Jia ;
Wu, Yuzhou .
COMPLEXITY, 2020, 2020
[9]  
Socievole A, 2015, INT WIREL COMMUN, P622, DOI 10.1109/IWCMC.2015.7289155
[10]   Transfer Reliability and Congestion Control Strategies in Opportunistic Networks: A Survey [J].
Soelistijanto, Bambang ;
Howarth, Michael P. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2014, 16 (01) :538-555