Skip to main content
placeholder image

Routing protocols based on double auction for ad hoc networks

Conference Paper


Abstract


  • 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.

Publication Date


  • 2007

Citation


  • Wu, Z., Chen, Z., Xu, L., & Guo, F. (2007). Routing protocols based on double auction for ad hoc networks. In International Conference on Networking, Architecture, and Storage, NAS 2007 (pp. 55-61). doi:10.1109/NAS.2007.46

Scopus Eid


  • 2-s2.0-47749128843

Web Of Science Accession Number


Start Page


  • 55

End Page


  • 61

Abstract


  • 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.

Publication Date


  • 2007

Citation


  • Wu, Z., Chen, Z., Xu, L., & Guo, F. (2007). Routing protocols based on double auction for ad hoc networks. In International Conference on Networking, Architecture, and Storage, NAS 2007 (pp. 55-61). doi:10.1109/NAS.2007.46

Scopus Eid


  • 2-s2.0-47749128843

Web Of Science Accession Number


Start Page


  • 55

End Page


  • 61