Research On Multi-strategy Routing Algorithms In Mobile Social Networks

Mobile social networks(MSNs)is a technology that combines social science and wireless communication into a mobile network.It is mainly used to solve the problems of low message delivery rate,frequent link interruption,and high transmission delay due to strong node mobility in the network,so as to promote connectivity among mobile devices and provide users with an efficient mobile computing environment to access,share,and distribute messages.Mobile social networks are considered to be a service system that can provide data delivery to mobile users.In the current mobile social networks,users often use portable mobile devices for message transmission.However,due to the intermittent connectivity and mobility among nodes,routing in mobile social networks scenarios has become a challenging problem.In view of the fact that there is no complete communication path between nodes in the mobile social networks,the thesis proposed to select the relay node through the social attribute and mobility mode of the node,so as to improve the message transmission rate under low delay.The goal of this thesis is to design an efficient routing algorithm for mobile social networks to improve the message delivery rate among nodes and reduce the transmission delay.The main research work of the thesis consists of the following two parts:(1)A Utility-based Probabilistic Routing Algorithm in Mobile Social Networks,UBPR.The algorithm combines the probability of contact between nodes and their social attributes,and uses this as a criterion to evaluate whether a node is suitable as a relay node in a social network scenario.In addition,the community structure is used to divide different forwarding strategies for data transmission and diffusion.(2)An Adaptive Routing Algorithm based on Social Relationship in Mobile Social Networks,ARASR.The algorithm can be used to solve the problem that the communication path in the mobile social networks is unstable and the message cannot be effectively transmitted.In one aspect,the algorithm selects a next hop relay node to deliver a message according to the proposed target area weighted centrality.On the other hand,based on the effective transmission capability,the interaction between nodes is judged,and the message copy is adaptively allocated.In order to verify the effectiveness of the proposed algorithms,simulation experiments were conducted by ONE(Opportunistic Network Environment)simulator.The simulation results show that under the condition of sufficient resources and low network load capacity,the proposed algorithms excellent in both transmission rate and average delay in the corresponding application scenarios.This proves that the proposed algorithms can effectively reduce the delivery delay of routing,promote message transmission,and is more suitable for message transmission in mobile social networks.