一种基于重复博弈的可容错的ad hoc网络节点合作策略

A fault-tolerant node cooperation strategy of ad hoc network based on repeated game

针对无线ad hoc网络中节点在数据转发阶段可能的自私行为,利用博弈理论从静态进行分析,以相邻节点对为研究对象,在重复博弈的情况下分析了针锋相对策略的脆弱性,提出了一种改进的针锋相对策略,在理论上证明了改进策略的激励性。改进策略可以容忍一定程度的网络故障,并在故障发生后使节点重新回到合作状态。仿真结果证明,改进策略对网络故障的容忍度较好,有效地促使节点合作,得到较高的网络收益,同时也降低了自私节点的收益。

According to possible selfish behaviors of wireless ad hoc network nodes showed during the process of data trans forming and analyzing from static state based on game theory, this paper regards neighboring nodes as the researched object, and analyzes the fragility of Tit-for-Tat strategy in the repeated game. This paper proposes an improved Tit-for-Tat strategy, and proves incentive of improved strategy theoretically. This improved strategy can tolerate a certain degree of network failure, and can restart nodes into cooperation status again after failure happened. The simulation results show that the improved strategyhas a better network fault tolerance compared with several other strategies, prompts node cooperation more effectively, gets higher node payoffs, reduces the interests of selfish nodes.