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 条
  • [21] A Comprehensive Multi-Scenario Routing Algorithm Based on Fuzzy Control Theory in Opportunistic Social Network
    Yu, Yao
    Yu, Jiong
    Chen, Zhigang
    Wu, Jia
    Yan, Yeqing
    SYMMETRY-BASEL, 2020, 12 (04):
  • [22] Opportunistic mobile network routing protocol based on multiple-level social network
    Peng, Bi-Tao
    Wang, Juan
    Journal of Computers (Taiwan), 2020, 31 (02) : 197 - 211
  • [23] Social-based routing algorithm for energy preservation in mobile opportunistic networks
    Chilipirea, Cristian
    Petre, Andreea-Cristina
    Dobre, Ciprian
    INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2014, 6 (01) : 14 - 27
  • [24] Community Roamer: A Social-Based Routing Algorithm in Opportunistic Mobile Networks
    Zhu, Tieying
    Wang, Cheng
    Liu, Dandan
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2014, PT I, 2014, 8630 : 768 - 780
  • [25] A Social-aware Opportunistic Network Routing Protocol Based on the Node Embeddings
    Xie, Gang
    Chen, Nanxu
    2019 IEEE 89TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-SPRING), 2019,
  • [26] AI-enabled trust-based routing protocol for social opportunistic IoT networks
    Nigam, Ritu
    Sharma, Deepak Kumar
    Jain, Satbir
    Bhardwaj, Kartik Krishna
    Banyal, Siddhant
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2024, 35 (04)
  • [27] Trust-based Collaborative Filtering Algorithm in Social Network
    Chen, Xinxin
    Guo, Yu
    Yang, Yang
    Mi, Zhenqiang
    2016 INTERNATIONAL CONFERENCE ON COMPUTER, INFORMATION AND TELECOMMUNICATION SYSTEMS (CITS), 2016, : 205 - 209
  • [28] Low energy consumption routing algorithm based on message importance in opportunistic social networks
    Yin, Sheng
    Wu, Jia
    Yu, Genghua
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (02) : 948 - 961
  • [29] Low energy consumption routing algorithm based on message importance in opportunistic social networks
    Sheng Yin
    Jia Wu
    Genghua Yu
    Peer-to-Peer Networking and Applications, 2021, 14 : 948 - 961
  • [30] Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks
    Lu, Yu
    Chang, Liu
    Luo, Jingwen
    Wu, Jia
    ELECTRONICS, 2021, 10 (10)