Performance evaluation of social relation opportunistic routing in dynamic social networks

Social wireless and mobile networks have received more attentions over the recent years. Previously, we proposed the Social Relation Opportunistic Routing (SROR) algorithm for mobile social networks, and introduced the social relations and profiles among nodes as the key metrics to compute the optimal forwarding node in routing such that the packet delivery probability is maximized. In this paper, we aim to extend the performance evaluation of the algorithm by considering the packet delivery probability and the algorithm efficiency metrics to assess the effectiveness of our proposed SROR protocol. Given the dynamic social environments, the results outperform the existing Social Pressure Method algorithm as well as the benchmark algorithms, namely Prophet, SimBet, and Fresh, targeting a similar scenario. The results further verify the validity of our SROR algorithm under a delay tolerant environment.