As intermittent and uncertain network connectivity in mobile social networks

data forwarding becomes an important problem. Based on the friendship of nodes

first constructs groups of nodes and then utilizing the intimacy of groups with nodes and communications

propose a data forwarding algorithm based on intimacy of group（ DFAIG）. The idea of DFAIG is that data packet carrier only forward data to encounter node its communication AP or the encounter node whose intimacy of group which takes destination node as center meets a certain requirement. Simulation results show that the algorithm has obvious superiority on reducing network overhead and also can significantly increase delivery ratio compared with Epidemic algorithm

Label and SGBR algorithm.