Quantitative social relations based on trust routing algorithm in opportunistic social network

被引:0
|
作者
Genghua Yu
Zhi Gang Chen
Jia Wu
Jian Wu
机构
[1] Central South University,School of Computer Science and Engineering
关键词
Opportunistic social network; Malicious nodes; Information flooding; Cooperative node; Feature attributes; Social relationship;
D O I
暂无
中图分类号
学科分类号
摘要
The trust model is widely used in the opportunistic social network to solve the problem of malicious nodes and information flooding. The previous method judges whether the node is a cooperative node through the identity authentication, forwarding capability, or common social attribute of the destination node. In real applications, this information does not have integrity and does not take into account the characteristics and dynamic adaptability of nodes, network structures, and the transitivity of social relationships between nodes. Therefore, it may not be effective in solving node non-cooperation problems and improving transmission success rate. To address this problem, the proposed node social features relationship evaluation algorithm (NSFRE) establishes a fuzzy similarity matrix based on various features of nodes. Each node continuously and iteratively deletes the filtered feature attributes to form a multidimensional similarity matrix according to the confidence level and determines the weights under different feature attributes. Then, the social relations of nodes are further quantified. The experimental results show that, compared with the traditional routing algorithm, NSFRE algorithm can effectively improve the transmission success rate, reduce transmission delay, ensure the safe and reliable transmission of information in the network, and require low buffer space and computing capacity.
引用
收藏
相关论文
共 50 条
  • [41] PNGP : A social relationship based routing algorithm for pocket switched network
    Barua, Rupa
    Shadman, Shauvik
    Chakrabarty, Amitabha
    PROCEEDINGS OF THE 2016 19TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2016, : 25 - 30
  • [42] Gossip : A Social Interest Based Routing Algorithm for Pocket Switched Network
    Tasfe, Mahrin
    Chakrabarty, Amitabha
    2017 20TH INTERNATIONAL CONFERENCE OF COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2017,
  • [43] Routing Algorithm Based on Ant Colony Optimization for Mobile Social Network
    Wu, Yanfei
    Zhu, Yanqin
    Yang, Zhe
    2017 18TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNDP 2017), 2017, : 297 - 302
  • [44] Social context-aware macroscopic routing scheme for opportunistic network
    Sreenivasa, B. R.
    Lahza, Husam
    Nandini, G.
    Shawly, Tawfeeq
    Alsheikhy, Ahmed A.
    Kumar, K. R. Naveen
    Lahza, M. Hassan Fareed
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2023, 34 (12)
  • [45] GIR: An Opportunistic Network Routing Algorithm Based on Game Theory
    Li, Limiao
    Wang, Haotian
    Liu, Zhixiong
    Ye, Hui
    IEEE ACCESS, 2020, 8 : 201158 - 201172
  • [46] NCRA: An Opportunistic Networks Routing Algorithm based on Network Coding
    Wang, Hongfeng
    Zhou, Dingding
    Dongi, Shi
    INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2015, 8 (03): : 137 - 145
  • [47] An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in Mobile Opportunistic Networks
    Zeng, Feng
    Peng, Jie
    Li, WenJia
    10TH EAI INTERNATIONAL CONFERENCE ON MOBILE MULTIMEDIA COMMUNICATIONS (MOBIMEDIA 2017), 2017, : 47 - 52
  • [48] An Efficient Routing Algorithm for Opportunistic Networks based on Network Coding
    Yao, Yukun
    Liu, Zhihu
    Ren, Zhi
    Wen, Yadi
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 197 - 200
  • [49] Efficient routing algorithm for opportunistic networks based on network coding
    Ren, Zhi
    Liu, Zhi-Hu
    Yao, Yu-Kun
    Chen, Qian-Bin
    Tongxin Xuebao/Journal on Communications, 2013, 34 (09): : 16 - 23
  • [50] A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks
    Dong, Yihan
    Chang, Liu
    Luo, Jingwen
    Wu, Jia
    ELECTRONICS, 2021, 10 (13)