Vittorio Bilè
ABSTRACT
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.
- G. Calinescu, I. Mandoiu, and A. Zelikovsky. Symmetric connectivity with minimum power consumption in radio networls. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pages 119--130, 2002.]] Google Scholar
Digital Library
- I. Caragiannis, E. Kaklamanis,and P. Kanellopoulos. A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraphproblem. Information Processing Letters, 86:149--154, 2003.]] Google ScholarDigital Library
- E. Clarke. Multipart pricing of public goods. Public Choice, 8:17--33, 1973.]]Google Scholar
- A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the complexity of computing minimum energy consumption broadcast subgraph. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2010 of Lecture Notes in Computer Science, pages 121--131.Springer-Verlag, 2001.]] Google ScholarDigital Library
- A.E.F. Clementi, H. Huiban, P. Penna, G. Rossi, and P. Vocca. Some recent theoretical advances and open questions on energy consumption in static ad-hoc wireless networks. In Proceedings of the 3rd International Workshop on Approximation and Randomization (ARACNE), pages 23--38, 2002.]]Google Scholar
- A.E.F. Clementi, P. Penna, and R. Silvestri. Harness results for the power range assignment problem in packet radio networks. In Proceedings of Randomization, Approximation and Combinatorial Optimization (RANDOM/APPROX), volume 1671 of Lecture Notes in Computer Science, pages 197--208. Springer-Verlag, 1999.]] Google ScholarDigital Library
- J. Edmonds. Optimal branchings. Journal of Research of the National Bureau of Standards, B71:233--240, 1967.]]Google ScholarCross Ref
- J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Approximation and collusion in multicast cost sharing. In Proceedings of the 4th ACM Conference on Electronic Commerce (EC. ACM, 2003.]] Google ScholarDigital Library
- J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Hardness results for multicast cost sharing. Journal of Public Economics, 304(1-3):215--236, 2003.]]Google Scholar
- J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. In Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), pages 218--227. ACM, 2000.]] Google ScholarDigital Library
- M. Flammini, R. Klasing, A. Navarra, and S. Perennes. Improved approximation results for the minimum energy broadcasting problem in wireless networks, manuscript, 2003.]]Google Scholar
- J. Green, E. Kohlberg, and J.J. Laffont. Partial equilibrium approach to the free rider problem. Journal of Public Economics, 6:375--394, 1976.]]Google ScholarCross Ref
- J. Green and J.J. Laffont. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica, 45(2):727--738, 1977.]]Google ScholarCross Ref
- T. Groves. Incentives in teams. Econometrica, 41(4):617--631, 1973.]]Google ScholarCross Ref
- K. Jain and V.V. Vazirani. Applications of approximation algorithms to coperative games. In Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pages 364--372. ACM, 2001.]] Google ScholarDigital Library
- K. Kent and D. Shorin-Kapov. Population monotonic cost allocation on MST's. Operational Research Proceedings KOI, pages 43--48, 1996.]]Google Scholar
- L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243(1-2):289--305, 2000.]] Google ScholarDigital Library
- L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15:141--145, 1981.]]Google ScholarDigital Library
- Megiddo. Cost allocation for Steiner trees. Networks, 8(1--6), 1978.]]Google Scholar
- H. Moulin and S. Shenker.Incremental cost sharing: characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279--320, 1999.]]Google ScholarCross Ref
- H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory, 18(3):511--533, 2001.]]Google ScholarCross Ref
- T.S. Rappaport. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.]] Google ScholarDigital Library
- K. Roberts. The characterization of implementable choice rules. Aggregation and Revealation of preferences, pages 321--348, North-Holland, 1979.]]Google Scholar
- L.S. Shapley. The value of n-person games. Contributions to the theory of games, pages 31--40, Princeton University Press, 1953.]]Google Scholar
- W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 16:8--37, 1961.]]Google ScholarCross Ref
- P.J. Wan, G. Calinescu, X. Li,and O. Frieder. Minimum energy broadcast routing in static ad hoc wireless networks. Wireless Networks, 8(6):607--617, 2002.]] Google ScholarDigital Library
- J.E. Wieselthier, G.D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 585--594. IEEE Computer Society, 2000.]]Google ScholarCross Ref
Index Terms
- Sharing the cost of multicast transmissions in wireless networks
Recommendations
Sharing the cost of multicast transmissions in wireless networks
A crucial issue in non-cooperative wireless networks is that of sharing the cost of multicast transmissions to different users residing at the stations of the network. Each station acts as a selfish agent that may misreport its utility (i.e., the ...
An efficient multicast routing protocol in wireless mobile networks
Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, ...
Bid-based cost sharing among multicast receivers
QSHINE '07: The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & WorkshopsIn scenarios where many receivers simultaneously are interested in the same data, multicast transmission is more bandwidth efficient than unicast. The reason is that the receivers of a multicast session share the resources through a common transmission ...
Comments