A Routing Algorithm based on Social Closeness and Spatio-Temporal Interaction Degree

In sparse opportunistic networks with social at-tributes and limited cache space, routing algorithms based on long-term and stable social relations have low message delivery rates in a short period of time, and do not consider the impact of delivered message copies on communication efficiency. To solve the problem of low delivery rates, the paper integrates social attributes and space-time constrained characteristics and proposes social closeness and spatio-temporal interaction degree based on historical information. Then we design a routing algorithm (SC-STID) based on these two metrics. SC-STID takes into account the social closeness and spatio-temporal interaction of nodes to select relay nodes comprehensively and uses the delivered message deletion mechanism to remove the copies of delivered messages from the network. Experimental data shows that SC-STID improves the success rate of message delivery and reduces network resource consumption compared to existing routing algorithms (Prophet, Epidemic, ORRF) in a sparse opportunistic network of nodes with social attributes.