通信学报 ›› 2013, Vol. 34 ›› Issue (Z1): 44-57.doi: 10.3969/j.issn.1000-436x.2013.z1.007

• 学术论文 • 上一篇    下一篇

基于博弈的协作路由算法

谢鲲1,段申琳1,文吉刚2,何施茗1   

  1. 1 湖南大学 信息科学与工程学院,湖南 长沙 410082
    2 中国科学院 计算技术研究所,北京100080
  • 出版日期:2013-08-25 发布日期:2017-06-23
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;国家重点基础研究发展计划(“973”计划)基金资助项目;湖南省自然科学重点基金资助项目;教育部博士点基金资助项目

Cooperative routing algorithm based on game theory

Kun XIE1,Shen-lin DUAN1,Ji-gang WEN2,Shi-ming HE1   

  1. 1 School of Information Science and Engineering, Hunan University, Changsha 410082, China
    2 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China
  • Online:2013-08-25 Published:2017-06-23
  • Supported by:
    he National Natural Science Foundation of China;he National Natural Science Foundation of China;The National Basic Research Pro-gram of China (973 Program);The Key Project of Hunan Provincial Natural Science Foundation;The Ph. D Programs Foundation of Ministry of Education

摘要:

协作虚拟多输入多输出(VMIMO)传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传V输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的MIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。

关键词: VMIMO, 协作路由, 重复博弈, 信誉度

Abstract:

Cooperative virtual multiple-input multiple-output (VMIMO) transmission is an effective technique to im-prove the transmission performance of wireless network. By taking advantage of diversity gain of VMIMO, the cross-layer VMIMO routing design combining cooperative VMIMO technology of physical layer and routing scheme of network layer can reduce power consumption of wireless transmission significantly. A significant challenge is how to make the VMIMO routing protocol robust to selfish and cheating behavior of users while guaranteeing high delivery ratio and low energy consumption. In order to improve the routing performance of selfish wireless network, a VMIMO coop-erative routing algorithm based on game theory was proposed. The network was divided into groups, and data was trans-mitted through VMIMO between groups. VMIMO routing among groups was modeled as a repeated routing game. To improve the data delivery ratio, a fit function was proposed to evaluate the nodes' credit for participating in packet for-warding. Based on the fit function, a fit value based routing selection algorithm and a fit value based routing forward al-gorithm were proposed. The proposed repeated routing game can approach to pareto optimality. Simulation result shows that this algorithm is capable of promoting cooperation between selfish nodes, which results in high delivery ratio, low transmission delay and energy consumption.

Key words: VMIMO, cooperative routing, repeated game, reputation

No Suggested Reading articles found!