无线Ad Hoc网络最大生命周期路由算法的诚实机制(英文)  

Truthful Mechanisms for Maximum Lifetime Routing in Wireless Ad Hoc Networks

作　　者：谢志鹏[1] 张卿 

机构地区：[1]复旦大学计算机科学技术学院,上海200433 [2]Samsung Electronics Co.,Ltd.

出　　处：《软件学报》2009年第9期2542-2557,共16页Journal of Software

基　　金：Supported by the National Natural Science Foundation of China under Grant No.60503025~~

摘　　要：将已有的生命周期路由算法分成两类:普通Max-Min(GMM)算法和条件Max-Min(CMM)算法,然后为这两类算法分别提出它们的诚实机制.通过给予中继节点适当的报酬,这些诚实机制可以确保已有的算法在面对自私节点的时候也可以实现它们的设计目标.说明生命周期路由算法的本质可以使这种报酬率相对较低且比较稳定,实验结果也进一步证明了这一点.In this paper, existing lifetime-aware routing algorithms are divided into two categories： General Max-Min （GMM） algorithm and Conditional Max-Min （CMM） algorithm. Motivated by algorithmic mechanism design, two truthful mechanisms for these two types of algorithms are proposed： SMM for GMM algorithm and SMM-VCG for CMM algorithm. By giving appropriate payments to the relay nodes, the proposed mechanisms gurantee that existing algorithms achieve their design objectives even in the presence of selfish nodes. It is shown that the payment ratio is relatively small and stable due to the nature of lifetime-aware routing algorithms, which is also confirmed by experiments.

关 键 词：无线AD HOC网络 最大化生命周期 诚实机制 

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