Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

• Main Authors: Yu Lu, Liu Chang, Jingwen Luo, Jia Wu
• Format: Article
• Language: English
• Published: MDPI AG 2021-05-01
• Series: Electronics
• Subjects: opportunistic social networks; weight distribution; relay node; edge node; information entropy
• Online Access: https://www.mdpi.com/2079-9292/10/10/1138

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.