An effective data transmission algorithm based on social relationships in opportunistic mobile social networks (Q2331652)

This paper studies an effective data transmission algorithm in opportunistic mobile social networks. This algorithm divides the social network into different communities, which make information transfer faster as well as safer. To maintain the cohesion of the community structure, an approach is proposed to reduce the community using the information of the features of nodes. By using the information needing to be transmitted multiple times and distributing the numbers of copies to multiple communities, the routing overhead is reduced. The performance of the opportunistic social network algorithm is evaluated via numerical simulations.