Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Power consumption in packet radio networks
Theoretical Computer Science
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
Approximation and collusion in multicast cost sharing
Proceedings of the 4th ACM conference on Electronic commerce
Hardness results for multicast cost sharing
Theoretical Computer Science
The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
More powerful and simpler cost-sharing methods
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Free-riders in steiner tree cost-sharing games
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
In this paper we consider the problem of sharing the costs of multicast transmissions in ad hoc wireless networks. Assuming that the receiving users are selfish, we provide strategy- proof mechanisms that are either optimally budget balanced or efficient for the case in which the distance-power gradient α =1 or the stations belong to a ne-dimensional Euclidean space.Then, by extending to multicasting previous results on wireless broadcasting,we show the existence of efficiently computable 2(3 d.1)-approximate budget balance mechanisms in any d -dimensional space for every α ≥ d.