基于博弈论的移动社交网络数据转发激励算法  

Mobile Social Network Data Forwarding Incentive Algorithm Based on Game Theory

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

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

出　　处：《小型微型计算机系统》2014年第7期1482-1485,共4页Journal of Chinese Computer Systems

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

摘　　要：移动社交网络节点间的数据转发是近年来研究者关注热点问题之一,由于自私节点的存在,阻碍了其进一步发展.本文提出了移动社交网络的数据转发拓扑模型,基于经济学的博弈理论,建立了数据转发博弈模型及博弈优化算法.并且从理论上证明博弈的最终将收敛于纳什均衡,也即全局最优解.通过建立模拟移动社交网络对该算法进行了收敛性、数据转发请求/接受概率的仿真实验测试,结果表明该算法能够在20 ms内收敛,请求/接受概率达到50%以上,表明该算法能够促进节点积极参与数据转发,具有较好的扩展性和鲁棒性.Data forwarding between nodes in the mobile social network is one of hot issues that the researchers focus on in recent years,because of selfish nodes,the further development of data forwarding is hampered in the mobile social network. The data forwarding topology model is presented in this paper,the incentive game model and distributed data forwarding algorithm based on the game theory of economics are put forward,and it is theoretically proved that the game will eventually converge to the Nash equilibrium,namely the global optimal solution. Through the establishment of simulated mobile social network,convergence and data forwarding request /accept probability of the algorithm are tested,the results show that the algorithm can convergence within 20ms,and request /acceptance probability is higher than 50%,can promote node to actively participate in data forwarding,has good scalability and robustness.

关 键 词：移动社交网络 数据转发 博弈论 激励算法 

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