基于机制设计理论的自组网节点合作协议  

A Cooperation Protocol for Ad Hoc Networks with Selfish Nodes Based on Mechanism Design

作　　者：郭建立[1] 吴智博[1] 董剑[1] 杨孝宗[1] 刘宏伟[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机学报》2009年第3期483-492,共10页Chinese Journal of Computers

基　　金：国家"八六三"高技术研究发展计划项目基金(2006AA01A103);国家自然科学基金(60503015)资助~~

摘　　要：在移动自组网中,如何激励自私节点,使之参与网络合作,是当前研究的热点问题.文中提出了LMOCP协议,采用VCG机制计算转发节点的支付.通过引入邻居发现机制,并改进路由发现过程,使网络中控制消息的数量从O(n3)减少到O(n2).对协议的正确性进行了分析,并证明了LMOCP协议是事后纳什可实施的,在所有节点都是理性的这一共同知识的假定下,每个节点的最优策略是诚实地报告自己的转发价格.通过ns-2对协议进行了验证,仿真结果显示,与现有的几种重要协议相比,LMOCP协议具有更低的消息负载和网络延迟.In mobile ad hoc networks, how to stimulate selfish nodes to participate in the net work cooperation is currently a hot research field. This paper proposes the LMOCP protocol, which applied VCG mechanism to calculate payments for relay nodes. The introduction of a neighbor discovery process and the improvement on routing discovery process can together decrease the overhead of control message from O（n^3） to O（n^2）. By encrypting the RREQ, relay nodes can not discard RREQ any more. The validity of the protocol is analyzed, and the LMOCP protocol is proven to be Ex Post Nash implementable under the assumption that node rational is the common knowledge, and the optimal strategy of each node is to honestly report their prices. Ns-2 was used for simulation and the result shows that LMOCP had lower message overhead and shorter network delay compared with several important protocol.

关 键 词：移动自组网 自私节点 合作 VCG机制 邻居发现 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]