环境感知的移动P2P社交网络组播路由算法  

Context-aware Mobile P2P Social Network Multicast Routing Algorithm

作　　者：曹怀虎[1] 张艳梅[1] 朱建明[1] 郭树行[1] 

机构地区：[1]中央财经大学信息学院,北京100081

出　　处：《计算机科学》2014年第9期141-145,共5页Computer Science

基　　金：国家自然科学基金(61272398);教育部科学技术重点项目(109016);北京市自然科学基金(4112053);教育部人文社会科学研究青年基金项目(11YJCZH006)资助

摘　　要：移动社交网络节点间的组播通信是近年来研究者关注的热点问题之一。由于节点的动态变化及社会性,使得传统组播路由算法不能直接应用于移动社交网络。根据移动社交网络的环境特征,建立了移动社交网络的组播模型;利用环境感知信息,并结合最小生成树、格网组播路由算法,提出了环境感知的移动P2P社交网络组播路由算法。最后对该算法进行了理论分析及仿真实验测试,结果表明所提出的组播路由算法改善了数据传输的性能,具有较高的扩展性、鲁棒性。Mobile social network multicast communication is one of hot issues that researchers focus on in recent years. Due to the dynamic change and social features of nodes, the traditional multicast routing algorithms can not be directly applied to mobile social network. According to the environmental characteristics of the mobile social network, a multicast model of mobile social network was established. Using environmental awareness information, context-aware mobile P2P social network multicast routing algorithm was proposed by combining minimum spanning tree and grid multicast algorithm. The theoretical analysis and simulation tests of the algorithm were conducted, showing that the CMR algorithm improves the performance of data transmission, and has high scalability, robustness.

关 键 词：移动社交网络 组播 P2P 路由算法 环境感知 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]