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