• 中国精品科技期刊
  • 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]Zhang Hengshan, Gao Yukun, Chen Yanping, Wang Zhongmin. Clustering Ensemble Algorithm with Cluster Connection Based on Wisdom of Crowds[J]. Journal of Computer Research and Development, 2018, 55(12): 2611-2619. DOI: 10.7544/issn1000-1239.2018.20180575
    [2]Zhou Jun, Li Huawei, Wang Tiancheng, Li Xiaowei. A Lightweight Fine-Grained Fault-Tolerant Scheme for 3D Networks-on-Chip[J]. Journal of Computer Research and Development, 2016, 53(2): 341-353. DOI: 10.7544/issn1000-1239.2016.20148436
    [3]Yuan Xinpan, Long Jun, Zhang Zuping, Luo Yueyi, Zhang Hao, and Gui Weihua. Connected Bit Minwise Hashing[J]. Journal of Computer Research and Development, 2013, 50(4): 883-890.
    [4]Liu Xiaozhu, Peng Zhiyong. On-Line Dynamic Index Hybrid Update Scheme Based on Self-Learning of Allocated Space[J]. Journal of Computer Research and Development, 2012, 49(10): 2118-2130.
    [5]Qi Shubo, Li Jinwen, Yue Daheng, Zhao Tianlei, and Zhang Minxuan. Adaptive Buffer Management for Leakage Power Optimization in NoC Routers[J]. Journal of Computer Research and Development, 2011, 48(12): 2400-2409.
    [6]Li Zhi, Zha Xuanyue, Liu Fengyu, and Zhang Hong. Indexing Based Multi-Level Clustering Routing Algorithm in Public Transportation Delay Tolerant Networks[J]. Journal of Computer Research and Development, 2011, 48(3): 407-414.
    [7]Tang Mingdong, Zhang Guoqing, Yang Jing. Graph Embedding-Based Scalable Routing in Large Networks[J]. Journal of Computer Research and Development, 2010, 47(7): 1225-1233.
    [8]Jiang Xuefeng, Heng Xingchen, Qin Zheng, Shao Liping. Efficient Extension Join Algorithm for Querying XML Data Based on Index Techniques[J]. Journal of Computer Research and Development, 2008, 45(6).
    [9]Yu Yaxin, Wang Guoren, Zhang Haining, and Li Jianxin. An Index for Supporting XML Structural Join Efficiently and Effectively—CATI[J]. Journal of Computer Research and Development, 2007, 44(1): 111-118.
    [10]Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.

Catalog

    Article views (403) PDF downloads (220) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return