期刊文献+

Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究 被引量:6

Study on Cooperation Incentive Mechanism Based on Vickrey Auction in Ad Hoc Networks
下载PDF
导出
摘要 为了在Adhoc路由策略中提供节点协作的动机并促使节点真实地显示参与Adhoc网络的费用,提出了基于目的地驱动的Vickrey拍卖方式来激励Adhoc网络中节点之间的协作.基于此思想设计的机制利用了经济学中Vickrey拍卖的特点,并显式地考虑了中间节点转发分组的费用.通过从目的地到源路径上中间节点举行的一系列Vickrey拍卖,确定费用最优的路径.理论分析表明,这种机制能激励分组以真实意图竞标,并且在路由选择时实现了全局期望的能量有效的目标. 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 for the 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 this mechanism can motivate nodes reveal forwarding cost truthfully, and can achieve the objective of cost efficiency in routing selection.
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2005年第4期50-53,共4页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(9020400360472067) 国家"973"项目(2003CB314806)
关键词 AD hoe网络 激励机制 Vickrey拍卖 能量有效 Ad hoc network incentive mechanism Vickrey auction energy efficiency
  • 相关文献

参考文献13

  • 1Obreiter P, Nimis J. A taxonomy of incentive patternsthe design space of incentives for cooperation [A]. Proceeding of the Second International Workshop on AP2PC[C]. 2003.
  • 2Marti S, Giuli T J, Lai K, et al. Mitigating routing misbehavior in mobile ad hoc network [ A ]. Proceeding of the Sixth IEEE/ACM Conference on Mobile Computing and Networking[C]. 2000.
  • 3Buchegger S, Boudec J Y L. Performance analysis of the CONFIDANT protocol: cooperation of nodes-fairness in distributed Ad-hoc networks [A]. Proc of IEEE/ACM Workshop on MobiHOC [C]. 2002.
  • 4Hubaux J, Gross T, Boudec J, et al. Toward self-organized mobile Ad hoe networks: the terrninodes project[J ]. IEEE Communication Magazine, 2001, 39 (1) :118-124.
  • 5Buttyan L, Hubaux J. Stimulating cooperation in self-organizing mobile acl hoc network [J]. ACM/Kluwer Mobile Networks and Applications (MONET), 2003, 8(5) : 579-592.
  • 6Sheng Zhong, Jiang Chen, Yang Richard Yang. Sprite:a simple, cheat-proof, credit-based system for mobile Adhoc networks [A]. Proceeding of IEEE INFOCOM [C].2003.
  • 7刘元安,唐碧华,胡月梅.Ad hoc网络中的路由算法[J].北京邮电大学学报,2004,27(2):1-7. 被引量:35
  • 8程胜,张勖,冯美玉,丁炜.Ad hoc虚拟骨干网中一种费率优先分布式CDS算法[J].北京邮电大学学报,2004,27(3):88-92. 被引量:2
  • 9ZHANGXu CHENGSheng FENGMei-yu DINGWei.Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks[J].The Journal of China Universities of Posts and Telecommunications,2004,11(4):1-6. 被引量:3
  • 10Anderegg L, Eidenbenz S. Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile Ad hoc networks with selfish agents [A]. Proceeding of ACM MobiCom [C]. 2003.

二级参考文献25

  • 1[1]CORSON S, MACKER J. Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations[S]. Internet RFC 2501.1999.
  • 2[2]JOHNSON D, MALTZ D. Dynamic Source Routing in Ad Hoc Wireless Networks[A]. Imielinski E, Korth H, Eds.Mobile Computing[C]. Norwell(MA): Kluwer, 1996.
  • 3[3]CORSON M S, EPHREMIDES A. A distributed routing algorithm for mobile wireless networks [J ]. Wireless Networks, 1995, 1(1):61-81.
  • 4[4]PARK V D, CORSON M. S. A highly adaptive distributed routing algorithm for mobile wireless network[A]. in Proc.IEEE INFOCOM'97, Vol 3[C]. Kobe(Japan): 1997. 1405- 1413.
  • 5[5]TOH C K. Associativity-based routing for ad-hoc mobile networks[J]. Wireless Personal Commun, 1997, 4(2): 103-139.
  • 6[7]PERKINS C E, ROYER E.M. Ad-hoc On Demand Distance Vector Routing [ A ]. Proceedings of IEEE WMCSA'99[C]. Piscataway(NJ): IEEE, 1999.90 - 100.
  • 7[8]CLAUSEN T, JACQUET P. Optimized Link State Routing Protocol [S]. Internet Draft draft-ietf-manet- olsr-11,2003.
  • 8[9]ZADEH L A. Fuzzy Sets [ J ]. Information and Control,1965, 8(3) :338 - 353.
  • 9[10]Lee SUNG-Ju, Gerla M, Toh Chai-Keong. A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Neworks[J]. IEEE Network, 1999, 13(4):48-54.
  • 10[11]BROCH J, JOHNSON D B, MALTZ D A. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks[ S].Internet Draft draft-ieff-manet-dsr-07, 2002.

共引文献37

同被引文献53

  • 1李莉,董树松,温向明.基于博弈理论建立无线自组网中激励合作机制的研究[J].电子与信息学报,2007,29(6):1299-1303. 被引量:8
  • 2徐心和,郑新颖.棋牌游戏与事件对策[J].控制与决策,2007,22(7):787-790. 被引量:15
  • 3Maille P, Tuffin B. Muhi-bid auctions for bandwidth allocation in communication networks[ C ] // IEEE INFOCOM 2004. Hong Kong: [s.n. ], 2004: 7-11.
  • 4Maille P, Tuffin B. Pricing the Internet with muhibid auctions [ J]. IEEE/ACM Trans on Networking, 2006, 14(5) : 992-1004.
  • 5Jain R, Walrand J. An efficient mechanism for network bandwidth auction [ C ]//IEEE NOMS Workshops 2008. Salvador da Bahia: [ s. n. ] , 2008 : 227-234.
  • 6Zhu Ji, Wei Yu, Ray Liu K J. A game theoretical frame- work for dynamic pricing-based routing in self-organized MANETs [ J]. IEEE J on Selected Areas in Comm, 2008, 26(7) : 1204-1217.
  • 7Su Xueyuan, Chan S, Peng Gang. Auction in multi-path muhi-hop routing [ J ]. IEEE Communications Letters, 2009, 13(2): 154-156.
  • 8Wu Fan, Zhong Sheng, Liu Jiqiang. Cost-effective traffic assignment for multipath routing in selfish networks [ C ]// GLOBECOM 2007. Washington : [ s. n. ] , 2007 : 453-457.
  • 9Boyd S, Vandenberghe L. Convex optimization [ M]. Cambridge: Cambridge University Press, 2004: 1074- 1079.
  • 10Cornelli F,Damiani E,Vimercati D C,et al.Choosing reputable servents in a P2P network[C]∥2002 International Conference on World Wide Web(WWW2002).Hawaii:ACM Press,2002:441-449.

引证文献6

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部