Triad link prediction method based on the evolutionary analysis with IoT in opportunistic social networks

被引:68
作者
Gou, Fangfang [1 ]
Wu, Jia [1 ]
机构
[1] Cent South Univ, Sch Comp Sci & Engn, Changsha 410075, Peoples R China
关键词
Opportunistic social network; Triad; Evolutionary analysis; Link prediction; Delivery rate; ALGORITHM; TIME;
D O I
10.1016/j.comcom.2021.10.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The data volume of various smart devices has exploded with the advent of the 5G communication era and the rapid development of Internet of Things technology. A large amount of data has higher requirements on the transmission protocol in the network. Most of the existing research focuses on studying a single node as the basic information transmission unit. However, social networks have complex topological structures, and such methods are difficult to grasp the evolutionary rules of the network. It usually leads to higher resource waste and problem complexity. A triad (a network subgraph containing three nodes) can not only provide accurate local topology information, but also its conversion rules are easy to describe, which can reduce the complexity of the problem. The mutual conversion between triads constitutes the evolution of the entire network. Based on this, this article first proposes a triad-based social network evolution analysis method (SNEA). SNEA includes a prediction algorithm (TPMPA) that learns the evolution of the triad transition probability matrix through time series and a quantization algorithm (TTHQA) that quantifies the impact of triad transformations on the network-based on random walks. SNEA integrates the advantages of the two algorithms to dynamically grasp the evolutionary rules of the network. Then this paper proposes a triad link prediction algorithm (TLPA) to quantitatively evaluate the results of the evolution analysis of the SNEA method. The TLPA algorithm reduces the blindness of message forwarding and unnecessary waste of resources by predicting the probability of a connection between nodes in the network. Experimental results show that compared with Epidemic, SECM, CRDNT, ICMT algorithms, our method has a prominent advantage in improving message delivery rate and reducing resource consumption.
引用
收藏
页码:143 / 155
页数:13
相关论文
共 41 条
  • [1] Simultaneous Detection of Multiple Change Points and Community Structures in Time Series of Networks
    Cheung, Rex C. Y.
    Aue, Alexander
    Hwang, Seungyong
    Lee, Thomas C. M.
    [J]. IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2020, 6 (06): : 580 - 591
  • [2] Choudhari, 2021, ADAPTIVE APPROXIMATE, DOI [10.1007/978-981-15-5341-7_65, DOI 10.1007/978-981-15-5341-7_65]
  • [3] Generating global network structures by triad types
    Cugmas, Marjan
    Ferligoj, Anuska
    Ziberna, Ales
    [J]. PLOS ONE, 2018, 13 (05):
  • [4] DAT D, IEEE ACCESS 2021 1, DOI DOI 10.1109/ACCESS.2021.3079443
  • [5] Hybrid data transmission scheme based on source node centrality and community reconstruction in opportunistic social networks
    Deng, Yepeng
    Gou, Fangfang
    Wu, Jia
    [J]. PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (06) : 3460 - 3472
  • [6] A Data Transmission Algorithm Based on Triangle Link Structure Prediction in Opportunistic Social Networks
    Fang, Zhiyuan
    Chang, Liu
    Luo, Jingwen
    Wu, Jia
    [J]. ELECTRONICS, 2021, 10 (09)
  • [7] A Novel Routing Scheme for Creating Opportunistic Context-Virtual Networks in IoT Scenarios
    Galan-Jimenez, Jaime
    Berrocal, Javier
    Garcia-Alonso, Jose
    Jesus Azabal, Manuel
    [J]. SENSORS, 2019, 19 (08)
  • [8] Guan Jianfeng., 2017, Mobile Information Systems, DOI DOI 10.1155/2017/1819495
  • [9] Hansheng W, 2017, ENCE CHINA, V01, P1
  • [10] OPPNets and Rural Areas: An Opportunistic Solution for Remote Communications
    Jesus-Azabal, Manuel
    Herrera, Juan Luis
    Laso, Sergio
    Galan-Jimenez, Jaime
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021