An effective positive transmission routing algorithm based on social relationships in opportunistic social networks

Opportunistic social network enables users to form an instant network for information sharing, which is a type of multi-hop wireless network in nature, thus relies on cooperation between nodes to complete message transmission. At present, most traditional routing algorithms require relay nodes to unconditionally forward received data. However, due to the limited of network resources, not all nodes are willing to forward data for other nodes, which is manifested as refusing to accept or even discarding messages, leading to deterioration of network performance. In this regard, this paper proposes an effective positive transmission routing algorithm (EPTR) based on social relationships in opportunistic social networks. This technology optimizes the method of community division by modularity, which not only considers the tightness of networks, but also discusses the social attributes of nodes. In this scheme, nodes with high relationship strength are selected to participate in data forwarding process, which makes packets are transmitted in the direction of increasing forwarding capability of nodes to the destination community. Simulation results show that the proposed algorithm can discover most abnormal nodes including malicious nodes and selfish nodes. Besides, compared with EIMCT algorithm, ITPCM algorithm and Spray and Wait algorithm, the proposed scheme has the highest transmission success rate and the lowest network load.