Truthful Multicast in Selfish Wireless Networks

In wireless networks, it is often assumed that each individual wireless terminal will faithfully follow the prescribed protocols without any deviation– except, perhaps, for a few faulty or malicious ones. Wireless terminals, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act “selfishly”. Therefore, an algorithm or protocol intended for selfish wireless networks must be designed. In this paper, we specifically study how to conduct efficient multicast routing in selfish wireless networks. We assume that each wireless terminal or communication link will incur a cost when it transits some data. Traditionally, the VCG mechanism has been the only method to design protocols so that each selfish agent will follow the protocols for its own interest to maximize its benefit. The main contributions of this paper are two-folds. First, for each of the widely used multicast structures, we show that the VCG based mechanism does not guarantee that the selfish terminals will follow the protocol. Second, we design the first multicast protocols without using VCG mechanism such that each agent maximizes its profit when it truthfully reports its cost. Extensive simulations are conducted to study the practical performances of the proposed protocols regarding the actual network cost and total payment.

[1]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[2]  ShenkerScott,et al.  Sharing the Cost of Multicast Transmissions , 2001 .

[3]  Jean-Jacques Laffont,et al.  On the revelation of preferences for public goods , 1977 .

[4]  Xiang-Yang Li,et al.  Truthful low-cost unicast in selfish wireless networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[5]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[6]  Markus Jakobsson,et al.  A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks , 2003, Financial Cryptography.

[7]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[8]  Carla-Fabiana Chiasserini,et al.  Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users , 2002 .

[9]  Srdjan Capkun,et al.  Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..

[10]  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.

[11]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[12]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[13]  Xiang-Yang Li,et al.  Design multicast protocols for non-cooperative networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[15]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[16]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[18]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[19]  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).

[20]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[21]  Theodore Groves,et al.  Incentives in Teams , 1973 .

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

[23]  Éva Tardos,et al.  Frugal path mechanisms , 2002, SODA '02.

[24]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, FSTTCS.