• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Linlan, Tan Zhenyang, Shu Jian. Node Importance Estimation Method for Opportunistic Network Based on Graph Neural Networks[J]. Journal of Computer Research and Development, 2022, 59(4): 834-851. DOI: 10.7544/issn1000-1239.20200673
Citation: Liu Linlan, Tan Zhenyang, Shu Jian. Node Importance Estimation Method for Opportunistic Network Based on Graph Neural Networks[J]. Journal of Computer Research and Development, 2022, 59(4): 834-851. DOI: 10.7544/issn1000-1239.20200673

Node Importance Estimation Method for Opportunistic Network Based on Graph Neural Networks

Funds: This work was supported by the National Natural Science Foundation of China (62062050, 61962037) and the Natural Science Foundation of Jiangxi Province (20202BABL202039).
More Information
  • Published Date: March 31, 2022
  • Opportunistic network is a type of self-organized networks which uses the opportunity of a node moving to realize communication.Because of opportunistic communication mode, opportunistic network has observable time-varying and dynamic characteristics.The estimation of node importance is the key to study the information dissemination of opportunistic network.A novel node importance estimation method based on graph neural network (GNN-NIE) framework is proposed.Opportunistic network is sliced into opportunistic network units which is modeled by aggregate graph to present network information.The dynamic network embedding model is employed to extract the temporal and structural information among the opportunistic network units, so as to obtain the dynamic attribute features of each node in the network.Taking advantage of the GNN’s ability of extracting the features of graph data, the relationship between node dynamic attribute features and the node importance is achieved, so that the node importance of opportunistic network is estimated.The results on three real opportunistic network datasets MIT reality, Haggle project and Asturias-er show that compared with the temporal degree, temporal betweenness, temporal PageRank, and kshell-CN, the proposed method has faster propagation rate, larger message coverage and better SIR and NDCG@10 values.
  • Related Articles

    [1]Li Ping, Song Shuhan, Zhang Yuan, Cao Huawei, Ye Xiaochun, Tang Zhimin. HSEGRL: A Hierarchical Self-Explainable Graph Representation Learning Model[J]. Journal of Computer Research and Development, 2024, 61(8): 1993-2007. DOI: 10.7544/issn1000-1239.202440142
    [2]Wang Lei, Xiong Yuning, Li Yunpeng, Liu Yuanyuan. A Collaborative Recommendation Model Based on Enhanced Graph Convolutional Neural Network[J]. Journal of Computer Research and Development, 2021, 58(9): 1987-1996. DOI: 10.7544/issn1000-1239.2021.20200617
    [3]Chen Jinyin, Huang Guohan, Zhang Dunjie, Zhang Xuhong, Ji Shouling. GRD-GNN: Graph Reconstruction Defense for Graph Neural Network[J]. Journal of Computer Research and Development, 2021, 58(5): 1075-1091. DOI: 10.7544/issn1000-1239.2021.20200935
    [4]Liu Zitu, Quan Ziwei, Mao Rubai, Liu Yong, Zhu Jinghua. NT-EP: A Non-Topology Method for Predicting the Scope of Social Message Propogation[J]. Journal of Computer Research and Development, 2020, 57(6): 1312-1322. DOI: 10.7544/issn1000-1239.2020.20190584
    [5]Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419
    [6]Liu Linlan, Zhang Jiang, Shu Jian, Guo Kai, Meng Lingchong. Multiple Attribute Decision Making-Based Prediction Approach of Critical Node for Opportunistic Sensor Networks[J]. Journal of Computer Research and Development, 2017, 54(9): 2021-2031. DOI: 10.7544/issn1000-1239.2017.20160645
    [7]Tian Jianwei, Tian Zheng, Qi Wenhui, Hao Hanyong, Li Renfa, Li Xi, Qiao Hong, Xue Haiwei. Threat Propagation Based Security Situation Quantitative Assessment in Multi-Node Network[J]. Journal of Computer Research and Development, 2017, 54(4): 731-741. DOI: 10.7544/issn1000-1239.2017.20161015
    [8]Zhang Yushu, Wang Huiqiang, Feng Guangsheng, Lü Hongwu. Message Dissemination Based on Interest Matching for Opportunistic Social Networks[J]. Journal of Computer Research and Development, 2016, 53(6): 1365-1375. DOI: 10.7544/issn1000-1239.2016.20148412
    [9]Cai Qingsong, Niu Jianwei, Liu Yan. Message Delivery Properties in Opportunistic Networks[J]. Journal of Computer Research and Development, 2011, 48(5): 793-801.
    [10]Niu Jianwei, Zhou Xing, Liu Yan, Sun Limin, Ma Jian. A Message Transmission Scheme for Community-Based Opportunistic Network[J]. Journal of Computer Research and Development, 2009, 46(12): 2068-2075.
  • Cited by

    Periodical cited type(5)

    1. 丁强龙,叶惠珠,袁弘强,李志新. 大规模时空轨迹数据连接查询效率优化实践. 计算机系统应用. 2024(05): 1-14 .
    2. 于平. 融合改进DBSCAN聚类和多种进化策略的改进蝗虫优化算法. 仪表技术与传感器. 2024(05): 98-105+112 .
    3. 王赟. 通信大数据安全监管平台的设计与实践. 湖南邮电职业技术学院学报. 2024(03): 8-13+19 .
    4. 李杰,李蓝青,曹帅,戴上. 基于改进灰狼算法优化和极限学习机的电网电力负荷预测. 微型电脑应用. 2024(11): 75-77+82 .
    5. 武晓朦,袁榕泽,李英量,朱琦. 基于新冠病毒群体免疫算法的有源配电网优化调度. 系统仿真学报. 2023(12): 2692-2702 .

    Other cited types(8)

Catalog

    Article views (393) PDF downloads (219) Cited by(13)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return