重庆邮电大学学报（自然科学版）Issue(1)：120-124,142,6.DOI:10.3979/j.issn.1673-825X.2016.01.018
基于节点信任度和博弈论的 Ad hoc 网络路由算法
Trust and game theory based routing algorithm for Ad hoc networks
刘欣 1李校林 2夏小霞1
作者信息
- 1. 重庆邮电大学 通信与信息工程学院，重庆 400065
- 2. 重庆邮电大学 通信新技术应用研究中心，重庆 400065
- 折叠
摘要
Abstract
Energy consumption and path reliability are the key issues in mobile Ad hoc networks.In order to improve ener-gy efficiency and maximize networks payoff,a repeated-game theoretic model is proposed for selecting forwarding nodes un-der the conditions of selfish and rational nodes,a trust evaluation function is designed,and punishment mechanism is used to deter the selfish nodes and force them to take cooperation strategy.Simulation indicates that the proposed routing algo-rithm can keep the balance of energy consumption and improve the packet delivery ratio and prolong network lifetime.关键词
Ad hoc 网络/重复博弈/信任度评价/惩戒机制/路由Key words
Ad hoc network/repeated game/trust evaluation/punishment mechanism/routing分类
信息技术与安全科学引用本文复制引用
刘欣,李校林,夏小霞..基于节点信任度和博弈论的 Ad hoc 网络路由算法[J].重庆邮电大学学报（自然科学版）,2016,(1):120-124,142,6.
