摘要
针对移动自组网中自私节点拒绝转发数据包的服务请求,影响整体网络性能的问题进行研究,基于经济学中提出的博弈理论,描述了节点检测记录相邻节点的协作率而识别自私节点的方法,提出了基于统计信息的节点协作重复博弈策略LTFT和LEpTFT,并提出节点根据不同协作目标进行策略选择的方法,分析表明该策略和方法能够有效激励协作并孤立自私节点,能有效的解决网络性能与节点收益的权衡问题,在一定程度上解决节点的协作问题。
With the aim at solving the problem of a selfish node refusing forward service requests of a mobile Ad hoc network,based on a Game theory in economics,this paper describes the method of identifying selfish nodes through detecting the cooperation rates of neighboring nodes and proposes statistics based on repeated Game strategies LTFT and LEpTFT.Also,the paper proposes a rule of adopting different strategies according to different aims of cooperation.Analysis shows that the strategies and rule can effectively encourage cooperation and punish selfishness to solve network problem and nodes to benefit from tradeoffs.
出处
《计算机系统应用》
2010年第10期182-186,共5页
Computer Systems & Applications
基金
广东商学院自然科学基金(08YB52004)
关键词
博弈
移动自组网
协作意愿
自私节点
LEpTFT策略
game theory
mobile Ad hoc networks
cooperation intention
selfish node
LEpTFT strategies
