摘要
提出用演化博弈理论建模移动自组网非协作路由问题,在证明了博弈的Nash均衡和无环的有效路径之间一一对应之后,给出了基于演化博弈的路由算法.该算法采用模仿者动态机制调整策略使博弈逐步收敛于Nash均衡点.仿真结果显示在能保证节点密度的情况下,新的路由算法的报文发送率接近于节点间无条件合作假设下的路由算法性能.
The evolutionary game theory was employed to model non-cooperative routing in Mobile Ad hoc Network（MANET）. Having proved the corresponding relationship between Nash equilibrium points and MANET effective paths with no-loop, a kind of evolutionary game-based MANET routing algorithm （EGR） is presented. Strategies for EGR were adjusted by means of replicator dynamic mechanism to reach Nash equilibrium. Simulation result shows that the new routing algorithm could achieve approximate packet delivery ratio with traditional co-operation-based routing algorithms when node density is guaranteed.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2006年第12期30-32,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
湖北省自然科学基金资助项目(2004ABA056)
关键词
移动自组网
非协作路由
演化博弈
mobile Ad Hoc network
non-cooperative routing
evolutionary game
