Community recombination and duplication node traverse algorithm in opportunistic social networks

In social communication, mobile devices can be regarded as socialization nodes in opportunistic social networks. Furthermore, they can carry and store useful information. Mobile devices can select destination nodes and deliver messages through opportunistic social networks because messages can be securely and conveniently stored, carried, and transmitted with nodes. However, many communities in traditional methods, may deliver messages often depending on one or two nodes, such as messages exchange by two nodes in Epidemic algorithm, or messages are sprayed with node in Spray and Wait algorithm. If those nodes are not enough cache and over-flooding, data transmission in communities may wait for a long time. In this study, communities are recombined and then duplication nodes are filtered in our method. According to evaluate contribution by node and restructure community, deliver ratio and overhead can be improved in opportunistic networks. With satisfactory results from simulation and comparison with some existing algorithms, the average delivery ratio of new research method is 0.91, which is 30% higher than that of Epidemic algorithm; the end-to-end delay reduces 75% with Spray and wait algorithm.