An Adaptive Routing Algorithm Based on Social Relationships in Mobile Social Networks
HUANG Jialing
LI Jianbo
LI Ying
Abstract：Aiming at the lack of complete communication paths between nodes in Mobile Social Networks(MSNs),a new routing algorithm——An Adaptive Routing Algorithm based on Social Relationships,which is an adaptive routing algorithm based on social relations,it is proposed to solve the problem that the connectivity path in MSNs is unstable and the message cannot be transmitted efficiently. On the one hand,the algorithm selects the next hop relay node to deliver the message according to the weight?ed centrality of target area. On the other hand,based on the effective transmission capability,the interaction between nodes is judged and the message copy is allocated adaptively. To verify the effectiveness of the algorithm ARASR,the design simulation ex?periments are compared with the classic algorithms Prophet,Epidemic and First Contact,the delivery rate of ARASR is increased by about 30% of the Epidemic algorithm,and the average delay is decreased by approximately 10% of the Prophet algorithm,which can effectively reduce the routing delivery delay and facilitated message transmission.
Keywords：Mobile Social Networksrouting algorithmeffective transmission capabilityforwarding willingness
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 748-755 )