Article thumbnail
Location of Repository

On achieving groupstrategyproof information dissemination in wireless networks

By Ajay Gopinathan, Zongpeng Li and Baochun Li


Abstract—We study the dissemination of common information from a source to multiple peers within a multihop wireless network, where peers are equipped with uniform omni-directional antennas and have a fixed cost per packet transmission. While many peers may be interested in the dissemination service, their valuation or utility for such a service is usually private information. A desirable routing and charging mechanism encourages truthful utility reports from the peers. We provide both negative and positive results towards such mechanism design. We show that in order to achieve the group strategyproof property, a compromise in routing optimality or budget-balance is inevitable. In particular, the fraction of optimal routing cost that can be recovered through peer charges cannot be significantly higher than 1. To answer the question whether constant-ratio cost 2 recovery is possible, we further apply a primal-dual schema to simultaneously build a routing solution and a cost sharing scheme, and prove that the resulting mechanism is group strategyproof and guarantees 1-approximate cost recovery against an optimal 8 routing scheme. I

Year: 2009
DOI identifier: 10.1109/gamenets.2009.5137406
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.