学术
摘 要:
如何激励属于不同利益最大化实体的自私节点合作是当前Adhoe网络研究中的一个热点问题．现有的自私节点检测和激励机制主要针对数据传输阶段，不能适应寻路阶段的特点．文中基于邻居节点中继和生成的路由请求包之间的统计关系，提出了一种适用于按需路由协议寻路阶段的自私行为检测和惩罚机制，并利用博弈论工具将其建模为噪声环境下的重复囚徒困境博弈，对算法激励合作的有效性进行分析．理论分析和仿真结果显示，该算法能够有效地惩罚寻路中的自私行为，促进节点合作。[著者文摘]
文章出处:
《计算机学报》-2008年31卷2期 -262-269页
栏目信息:
分 类 号:
Study on Cooperation Stimulation Mechanism in Route Discovery of Ad hoc Networks
HUANG Lei LIU Li-Xiang （National Key Laboratory of Integrated Information System Technology, Institute of Software, ChineseAcademy of Sciences, Beijing 100080）
Abstract:
How to stimulate selfish nodes which belong to different utility-maximizing entities to cooperate is a hot topic in Ad hoc network research community. Current mechanisms proposed so far focus mainly on detecting selfish behavior and stimulating cooperation in data forwarding stage. They are not applicable in route discovery stage. Based on statistics relationship of route request packets relayed and generated by a neighbor node, this paper proposed an algorithm to detect and punish the selfishness in route discovery stage for on-demand routing protocols. The algorithm was modeled with the tool of game theory as the repeated prisoner dilemma in noisy environment, and its effectiveness to stimulate cooperation was analyzed with the model. Theoretic analysis and simulation results showed that our scheme could punish the selfishness in route discovery effectively and thus stimulate nodes to cooperate.[著者文摘]
Key words:
Ad hoc network routing selfishness detection cooperation stimulation game theory
更多>>免费文章
cqvip.com