Routing Protocols Based on Double Auction for Ad Hoc Networks

We introduce a game-theoretic setting for routing in mobile ad hoc networks in this paper. We implement the continuous double auction (CDA), a double auctioning mechanism in ad hoc networks and propose our routing protocols based on it. This mechanism can stimulate nodes to cooperate with each other and the aim to allocate routes in communication would be achieved. It is the first time that double auction methods are shown to offer theoretical guarantees for route allocation in ad hoc networks.

[1]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[2]  Jean-Pierre Hubaux,et al.  Nuglets: a Virtual Currency to Stimulate Cooperation in Self-Organized Mobile Ad Hoc Networks , 2001 .

[3]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[4]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[5]  Timothy X. Brown,et al.  An on-demand minimum energy routing protocol for a wireless ad hoc network , 2002, MOCO.

[6]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[7]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[8]  John Dickhaut,et al.  Price Formation in Double Auctions , 2001, E-Commerce Agents.

[9]  Karl Aberer,et al.  Towards peer-to-peer double auctioning , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.