Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究

doi:10.13190/jbupt.200504.50.wangyf

北京邮电大学学报 ›› 2005, Vol. 28 ›› Issue (4): 50-53.doi: 10.13190/jbupt.200504.50.wangyf

Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究

王玉峰1,2,王文东1,袁刚1,程时端1

1北京邮电大学网络与交换国家重点实验室, 北京 100876; 2南京邮电学院通信工程系, 南京 210003

出版日期:2005-08-28 发布日期:2005-08-28

Study on Cooperation Incentive Mechanism Based on Vickrey Auction in Ad Hoc Networks

WANG Yufeng1,2,WANG Wendong1,YUAN Gang1,CHENG Shiduan1

1State Key Laboratory of Networking and Switching, Beijing University of Post s and Telecommunications, Beijing 100876, China; 2Department of Telecommunication, Nanjing University of Posts and Telecommuni cations, Nanjing 210003, China

Online:2005-08-28 Published:2005-08-28

摘要/Abstract

摘要：

为了在Ad hoc路由策略中提供节点协作的动机并促使节点真实地显示参与Ad hoc网络的费用，提出了基于目的地驱动的Vickrey拍卖方式来激励Ad hoc网络中节点之间的协作. 基于此思想设计的机制利用了经济学中Vickrey拍卖的特点，并显式地考虑了中间节点转发分组的费用. 通过从目的地到源路径上中间节点举行的一系列Vickrey拍卖，确定费用最优的路径. 理论分析表明,这种机制能激励分组以真实意图竞标，并且在路由选择时实现了全局期望的能量有效的目标.

关键词: Ad hoc网络, 激励机制, Vickrey拍卖, 能量有效

Abstract:

In order to provide incentive to cooperate for nodes in Ad hoc networks, the incentive to cooperate with each other and to motivate those nodes to reveal their cost of participating in network responsibilities, the destinationdriven Vickrey auction was designed forthe motivation of the cooperation among nodes in Ad hoc networks, which would take advantage of the merit of Vickrey auctions. Meanwhile, the incurred cost of nodes for forwarding packets was taken into account explicitly. The costeffective path was determined through the series of auctions carried out by intermediate nodes in path from destination to source. Theoretic analysis proves that thismechanism can motivate nodes reveal forwarding cost truthfully, and can achieve the objective of cost efficiency in routing selection.

Key words: Ad hoc network, incentive mechanism, Vickrey auction;energy efficiency

中图分类号:

TN929.53

王玉峰,王文东,袁刚,程时端. Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究[J]. 北京邮电大学学报, 2005, 28(4): 50-53.

WANG Yufeng1,2,WANG Wendong1,YUAN Gang1,CHENG Shiduan1. Study on Cooperation Incentive Mechanism Based on Vickrey Auction in Ad Hoc Networks[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2005, 28(4): 50-53.

参考文献

[1] P. Obreiter, J. Nimis. A taxonomy of incentive patterns - the design space of incentives for cooperation [A]. In Proc. of the Second International Workshop on AP2PC [C], 2003.
[2] S. Marti, T.J. Giuli, K. Lai, M. Baker. Mitigating routing misbehavior in mobile ad hoc network [J]. ACM Mobile Computing and Networking, 2000: 255-365.
[3] S. Buchegger, J.Y.L. Boudec. Performance analysis of the CONFIDANT protocol: cooperation of nodes-fairness in distributed Ad-hoc networks [A]. In proc. of IEEE/ACM Workshop on MobiHOC [C], 2002: 226-236.
[4] J. Hubaux, T. Gross, J. Boudec, M. Vetterli. Toward self-organized mobile Ad hoc networks: the Terminodes project [J]. IEEE Communication Magazine, Jan. 2001.
[5] L. Buttyan, J. Hubaux. Stimulating cooperation in self-organizing mobile ad hoc network [J]. ACM/Kluwer Mobile Networks and Applications (MONET), 2003(8).
[6] Sheng Zhong, Jiang Chen, Yang Richard Yang. Sprite: A simple, cheat-proof, credit-based system for mobile Ad-Hoc Networks [A]. In Proc. of IEEE INFOCOM [C], 2003.
[7] LIU Yuan-an, TANG Bi-hua, HU Yue-mei, et al., Roution algorithms in mobile Ad hoc Networks [J]. Journal of BUPT, 2004(2).
[8] CHENG Sheng FENG Mei-yu ZHANG Xu ,et al., Research on Virtual Backbone-Based Distributed Ad hoc Routing Protocol in MANET [J]. Journal of BUPT, 2004(5).
[9] ZHANG Xu, CHENG Sheng, FENG Mei-yu, DING Wei. Fuzzy Logic Qos Dynamic Source Routing for Mobile Ad Hoc Networks [J]. Journal of CHUPT, 2004, 11(4).
[10] L. Anderegg, S. Eidenbenz. Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile Ad hoc networks with selfish agents [A]. In Proc. of ACM MobiCom [C], 2003.
[11] N. Nisan, A. Ronen. Algorithmic mechanism design [J]. Games and Economic Behavior, 2001, 35(2): 166-196.
[12] M. Jakobsson, J.-P. Hubaux, L. Butty′an. A micro-payment scheme encouraging collaboration in multi-hop cellular networks [A]. In Proc. of the Seventh International Financial Cryptography Conference [C]. Guadeloupe: January 2003.
[13] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva. Directed diffusion for wireless sensor networking [J]. IEEE/ACM Transactions on Networking, 2003, 11(1).

[1]	鲁蔚锋, 李学晴, 徐佳, 陈思光. 边缘计算架构中P2P的组合多资源任务卸载算法[J]. 北京邮电大学学报, 2022, 45(4): 98-103.
[2]	白媛, 安杰, 张会兵. 预测辅助的Ad hoc网络路由协议[J]. 北京邮电大学学报, 2017, 40(s1): 29-33.
[3]	芮兰兰, 熊颖琳, 黄豪球, 邱雪松. 移动P2P资源共享激励机制[J]. 北京邮电大学学报, 2016, 39(s1): 46-49.
[4]	朱立才, 王汝传, 杨浩, 沙超. 一种能量有效的RPL多路径数据分发机制[J]. 北京邮电大学学报, 2016, 39(6): 82-87.
[5]	姚建盛, 马春光, 袁琪. 基于债务的机会网络“物-物交换”激励机制[J]. 北京邮电大学学报, 2016, 39(4): 103-107.
[6]	温景容武穆清吕博汪东洋. 非均匀多信道Ad Hoc网络信道选择方法[J]. 北京邮电大学学报, 2013, 36(2): 10-14.
[7]	王英赫宋梅陈浩张英海. Ad Hoc网络中采用功率调整的单向链路通告策略[J]. 北京邮电大学学报, 2012, 35(5): 102-106.
[8]	邱涛, 宋涛, 许文俊, 田宝玉. 能量有效性频谱感知和传输方案的联合设计[J]. 北京邮电大学学报, 2012, 35(5): 54-58.
[9]	刘洺辛于倩. Ad Hoc网络中基于传输状态的自适应退避算法[J]. 北京邮电大学学报, 2012, 35(4): 68-71.
[10]	余旺科马文平严亚俊杨元原. 利用信任模型构建安全路由协议[J]. 北京邮电大学学报, 2010, 33(3): 48-51.
[11]	扈鹏;刘元安;马晓雷;高松. Ad Hoc网络中按需路由协议的动态广播算法[J]. 北京邮电大学学报, 2009, 32(6): 53-56.
[12]	杨卫东. 用于Ad Hoc网络的分簇算法[J]. 北京邮电大学学报, 2009, 32(5): 61-65.
[13]	张代远，江丽敏. 新型P2P流媒体系统模型[J]. 北京邮电大学学报, 2009, 32(4): 68-72.
[14]	翟立东，刘元安，马晓雷，高锦春. 发布/订阅通信机制在移动Ad Hoc网络中的应用[J]. 北京邮电大学学报, 2008, 31(2): 30-33.
[15]	关志涛，曹元大，李剑. 混合对等网络中基于激励的可靠搜索算法[J]. 北京邮电大学学报, 2008, 31(2): 42-45.

Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究

Study on Cooperation Incentive Mechanism Based on Vickrey Auction in Ad Hoc Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价