F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-compatible opportunistic routing for wireless networks”, Pro?ceedings of the 14th ACM international conference on Mobile computing and net-working, MobiCom ’08, 2008, pp. 303–314.

has been cited by the following article:

• TITLE: Reliable Multi-path Routing in Selfish Networks with Hidden Information and Actions

  AUTHORS: Gang Peng, Mingrui Zou, Sammy Chan

  KEYWORDS: Wireless ad hoc network, non-cooperative networks, hidden information, hidden action, mechanism design, GSP auction.

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.5 No.12B, January 18, 2013

  ABSTRACT: In this paper, we propose a novel game-theoretical solution to the multi-path routing problem in wireless ad hoc networks comprising selfish nodes with hidden information and actions. By incorporating a suitable traffic allocation policy, the proposed mechanism results in Nash equilibria where each node honestly reveals its true cost, and forwarding subgame perfect equilibrium in which each node does provide forwarding service with its declared service reliability. Based on the generalised second price auction, this mechanism effectively alleviates the over-payment of the well-known VCG mechanism. The effectiveness of this mechanism will be shown through simulations.