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. © 2007 IEEE.