基于演化博弈论的p-坚持CSMA网络接入控制研究

Evolutionary Game Theory-based Access Control Study for P-persistent CSMA Networks

考虑到存在无线信道差错,针对p-坚持CSMA网络的非合作系统行为,建立了p-坚持CSMA演化博弈模型,推导了唯一的演化稳定策略,以饱和吞吐量最大、平均能耗最小为目标求解了最优演化稳定策略。然后,进一步研究了收益时延、成功收益以及比特差错概率对最优演化稳定过程的影响。数值仿真结果表明,当比特差错概率一定、收益时延较小时,选择合适的成本和收益,使多路访问博弈在最优传输概率处演化稳定,可获得一个稳定且性能最优的p-坚持CSMA网络。

Considering the noncooperation system behavior of p-persistent CSMA network where the wireless channel error may occur, this paper established a p-persistent CSMA evolutionary game model （EGP-CSMA）. In this model, the unique evolutionary stable strategy （ESS） is derived and the optimal ESS to maximize saturation throughput and mini- mize average energy consumption are calculated respectively. Then, the effect of payoff delay, success payoff and bit er- ror rate are studied on the convergence of evolutionary dynamics to the optimal ESS. Numerical simulation results show that,as the bit error rate is constant and the payoff delay is short,a proper cost and payoff can make the multiple access game reach an evolutionary stable status at the optimal transmission probability. Thus, the p-persistent CSMA network can be stable and perform optimally.