首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于演化博弈的MANET路由算法
引用本文:韩露,魏蛟龙,周曼丽,叶俊.基于演化博弈的MANET路由算法[J].华中科技大学学报(自然科学版),2006,34(12):30-32.
作者姓名:韩露  魏蛟龙  周曼丽  叶俊
作者单位:1. 华中科技大学电子与信息工程系,湖北,武汉,430074
2. 华中科技大学光电子工程学院,湖北,武汉,430074
摘    要:提出用演化博弈理论建模移动自组网非协作路由问题,在证明了博弈的Nash均衡和无环的有效路径之间一一对应之后,给出了基于演化博弈的路由算法.该算法采用模仿者动态机制调整策略使博弈逐步收敛于Nash均衡点.仿真结果显示在能保证节点密度的情况下,新的路由算法的报文发送率接近于节点间无条件合作假设下的路由算法性能.

关 键 词:移动自组网  非协作路由  演化博弈
文章编号:1671-4512(2006)12-0030-03
收稿时间:2005-12-31
修稿时间:2005年12月31

Evolutionary game-based routing algorithm for mobile Ad Hoc network
Han Lu,Wei Jiaolong,Zhou Manli,Ye Jun.Evolutionary game-based routing algorithm for mobile Ad Hoc network[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2006,34(12):30-32.
Authors:Han Lu  Wei Jiaolong  Zhou Manli  Ye Jun
Abstract: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.
Keywords:mobile Ad Hoc network  non-cooperative routing  evolutionary game
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号