In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.

在机会主义的移动社交网络中，节点根据他们的兴趣或爱好聚集在一起，定期参加不同的活动。我们深入研究了网络节点的时空移动特性，提出了一种基于活动的消息机会转发算法。该算法的主要思想是我们根据节点参与活动的情况选择不同的消息转发方式。如果源节点和目的节点都参加相同的活动，我们选择传递概率最大的最佳中继节点。当源节点和目的节点不同时处于同一活动中时，我们需要找到具有最高间接传递概率的最优路径，消息将通过最优路径进行传输。