A Message Matching Routing Algorithm Based on Node Sociality in Opportunistic Networks

Inspired by the importance of grouping in the communication networks such as Facebook, Twitter, Wechat, we choose appropriate forwarding channels for different types of messages in order to improve the rate of message success forwarding, while reducing network overhead and addressing the problem of network congestion. In this paper, we put forward the concept of circle of friends and an effective classification method to assign the circle of friends that the node belongs according to social attributes of node. A message matching routing algorithm (MMAR) is designed to help messages forward, in which nodes select the corresponding circle of friends based on the type of message. The simulation results show that the proposed routing algorithm based on sociality is superior to other classical routing algorithms in forwarding rate, delay and routing overhead.