MSN下基于亲缘关系的分族分层机会路由算法

Group Stratification Opportunistic Routing Algorithm Based on Kinship in MSN

移动社会网络(Mobile Social Network,MSN)具有社会网络特征,移动智能终端设备由于自身资源限制,往往表现出节点自私性。现有研究主要集中于解决节点个体自私性,而忽视了对节点社会自私性的甄别与利用。因此,文中提出了一种基于亲缘关系的分族分层路由算法。首先,在依据亲缘关系指数分族分层的社区和集群中,自荐的节点通过比较综合举荐值产生族节点和中继节点。然后,以亲缘关系预测的转移概率为转发依据,借助族节点和中继节点优化盲目转发,在有效地控制副本数的同时预测关联可靠路径链路,实现基于节点亲缘关系的相遇投递策略。仿真实验结果表明,该算法可以在保护与利用社会自私性的基础上,有效地提高消息投递率,降低网络时延,提高网络的通信流量等。

Mobile Social Network(MSN)has the characteristics of social network.Mobile intelligent terminal devices often exhi-bit node selfishness due to their own resource limitations.The existing researches mainly focus on solving the selfishness of node individuals,and thus neglecte the discrimination and utilization of node social selfishness.Therefore,this paper proposed a group stratification opportunistic routing algorithm based on kinship.First,in the communities and clusters based on the kinship index,the self-recommended nodes generate family nodes and relay nodes by comparing the recommended values.Then,the transition probability predicted by the kinship relationship is used as the forwarding basis,the family node and the relay node are used to optimize the blind forwarding.The effective reliable path link is predicted while the number of replicas is effectively controlled,and then encounter-based delivery strategy based on the node affinity is realized.Simulation results show that the proposed mecha-nism can effectively improve the message delivery rate,reduce the network delay,and improve the communication traffic of the network on the basis of protecting and utilizing social selfishness.