###
DOI:
Journal of Software:2009.20(9):2542-2557

无线Ad Hoc 网络最大生命周期路由算法的诚实机制
谢志鹏,张卿
(复旦大学 计算机科学技术学院,上海 200433;Samsung Electronics Co., Ltd., Hwasung-City 445-701, South Korea)
Truthful Mechanisms for Maximum Lifetime Routing in Wireless Ad Hoc Networks
XIE Zhi-Peng,ZHANG Qing
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3225   Download 3414
Received:April 29, 2008    Revised:August 21, 2008
> 中文摘要: 将已有的生命周期路由算法分成两类:普通Max-Min(GMM)算法和条件Max-Min(CMM)算法,然后为这两类算法分别提出它们的诚实机制.通过给予中继节点适当的报酬,这些诚实机制可以确保已有的算法在面对自私节点的时候也可以实现它们的设计目标.说明生命周期路由算法的本质可以使这种报酬率相对较低且比较稳定,实验结果也进一步证明了这一点.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60503025 (国家自然科学基金) Supported by the National Natural Science Foundation of China under Grant No.60503025 (国家自然科学基金)
Foundation items:
Reference text:

谢志鹏,张卿.无线Ad Hoc 网络最大生命周期路由算法的诚实机制.软件学报,2009,20(9):2542-2557

XIE Zhi-Peng,ZHANG Qing.Truthful Mechanisms for Maximum Lifetime Routing in Wireless Ad Hoc Networks.Journal of Software,2009,20(9):2542-2557