Effective path prediction and data transmission in opportunistic social networks

Abstract

With the development of social media, social networks have become an important platform for people to share and communicate. In social network communication, when people carry mobile devices for data transmission, they need to find a definite transmission destination to ensure the normal conduct of information exchange activities. This is manifested in the process of data transmission by nodes, which requires analysis and judgment of surrounding areas, and finds suitable nodes for effective data classification and transmission. However, the node cache space in social networks is limited, and the process of waiting for the target node will cause end-to-end transmission delay. In order to improve such a transmission environment, this paper proposes a node trajectory prediction method named EDPPM algorithm. The EDPPM algorithm guarantees that nodes with high probability are given priority to obtain data information, which realized an effective data transmission mechanism. Through experiments and comparison of opportunistic transmission algorithms in social networks, such as Epidemic algorithm, Spray and Wait algorithm, and PRoPHET algorithm, the proposed scheme outperforms ProPhet by 47% in terms of cache utilization of nodes, 55% in terms of data transmission delay, and 32% in terms of network efficiency; compared with Epidemic by 53% in terms of cache utilization of nodes, 62% in terms of data transmission delay, and 47% in terms of network efficiency; same thing with regard to the Spray and wait by 27% in terms of cache utilization of nodes, 31% in terms of data transmission delay, and 17% in terms of network efficiency.