An Efficient Routing Algorithm Based on Interest Similarity and Trust Relationship Between Users in Opportunistic Networks

Abstract

In opportunistic networks, due to the randomness of node moving and the uncertainty of network topology, it’s a challenging issue to establish a complete communication link between the source and the destination node. Fortunately, the “store-carry-forward” strategy can be used to solve this problem. However, such forwarding strategy heavily relies on the cooperation among nodes. Thus, the selection of a proper relay node has a great impact on the performance of the whole network. In this paper, considering the differences between users’ interest and the variability of interest with the change of time, firstly, we propose a dynamic update and calculation method of the value of interests, and then establish a calculation model of interest. Secondly, according to the Ebbinghaus forgetting curve and the ability of users to forward messages, we propose a dynamic calculation method of the trust value of users and establish a model for computing trust relationships. Finally, we propose an efficient routing algorithm based on interest similarity and trust relationship (BIST) between users. The simulation results show that our proposed algorithm has better routing performance, and it validates the correctness and validity of our proposed models and algorithm.