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

Abstract 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