Routing algorithm based on social relations in opportunistic networks

Abstract

In this paper, we design a social-relations-based routing algorithm (SRBRA). Firstly, by analyzing the real-time data from mobile nodes in the network, we summarize and extract factors that affect social relations between these mobile nodes. Then make inference and evaluation for the complexity and dynamic of these factors from multiple angles, calculate the social-relations values between each sensor node from these factors. Finally, based on the values of social relations, we sort out the network topology information of the neighbours, and select the best next hop relay node for information routing. Simulation experiments show that SRBRA is cost effective and has high delivery ratio.