skip to main content
10.1145/1007912.1007940acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article

Sharing the cost of multicast transmissions in wireless networks

Published: 27 June 2004 Publication History

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.

References

[1]
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.]]
[2]
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.]]
[3]
E. Clarke. Multipart pricing of public goods. Public Choice, 8:17--33, 1973.]]
[4]
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.]]
[5]
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.]]
[6]
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.]]
[7]
J. Edmonds. Optimal branchings. Journal of Research of the National Bureau of Standards, B71:233--240, 1967.]]
[8]
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.]]
[9]
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.]]
[10]
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.]]
[11]
M. Flammini, R. Klasing, A. Navarra, and S. Perennes. Improved approximation results for the minimum energy broadcasting problem in wireless networks, manuscript, 2003.]]
[12]
J. Green, E. Kohlberg, and J.J. Laffont. Partial equilibrium approach to the free rider problem. Journal of Public Economics, 6:375--394, 1976.]]
[13]
J. Green and J.J. Laffont. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica, 45(2):727--738, 1977.]]
[14]
T. Groves. Incentives in teams. Econometrica, 41(4):617--631, 1973.]]
[15]
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.]]
[16]
K. Kent and D. Shorin-Kapov. Population monotonic cost allocation on MST's. Operational Research Proceedings KOI, pages 43--48, 1996.]]
[17]
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.]]
[18]
L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15:141--145, 1981.]]
[19]
Megiddo. Cost allocation for Steiner trees. Networks, 8(1--6), 1978.]]
[20]
H. Moulin and S. Shenker.Incremental cost sharing: characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279--320, 1999.]]
[21]
H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory, 18(3):511--533, 2001.]]
[22]
T.S. Rappaport. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.]]
[23]
K. Roberts. The characterization of implementable choice rules. Aggregation and Revealation of preferences, pages 321--348, North-Holland, 1979.]]
[24]
L.S. Shapley. The value of n-person games. Contributions to the theory of games, pages 31--40, Princeton University Press, 1953.]]
[25]
W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 16:8--37, 1961.]]
[26]
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.]]
[27]
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.]]

Cited By

View all
  • (2012)Efficient Allocation of Agent Groups for Complex Tasks in Real Cost EnvironmentsProceedings of the 2012 IEEE International Conference on Software Science, Technology and Engineering10.1109/SWSTE.2012.14(54-62)Online publication date: 12-Jun-2012
  • (2008)On Nash equilibria for multicast transmissions in ad-hoc wireless networksWireless Networks10.1007/s11276-006-8817-y14:2(147-157)Online publication date: 1-Mar-2008
  • (2006)Multicast transmissions in non-cooperative networks with a limited number of selfish movesProceedings of the 31st international conference on Mathematical Foundations of Computer Science10.1007/11821069_32(363-374)Online publication date: 28-Aug-2006
  • Show More Cited By

Index Terms

  1. Sharing the cost of multicast transmissions in wireless networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
      June 2004
      332 pages
      ISBN:1581138407
      DOI:10.1145/1007912
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 27 June 2004

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximate budget balanceness
      2. efficiency
      3. multicast cost sharing
      4. strategy-proof mechanisms
      5. wireless networks

      Qualifiers

      • Article

      Conference

      SPAA04

      Acceptance Rates

      Overall Acceptance Rate 447 of 1,461 submissions, 31%

      Upcoming Conference

      SPAA '25
      37th ACM Symposium on Parallelism in Algorithms and Architectures
      July 28 - August 1, 2025
      Portland , OR , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 19 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2012)Efficient Allocation of Agent Groups for Complex Tasks in Real Cost EnvironmentsProceedings of the 2012 IEEE International Conference on Software Science, Technology and Engineering10.1109/SWSTE.2012.14(54-62)Online publication date: 12-Jun-2012
      • (2008)On Nash equilibria for multicast transmissions in ad-hoc wireless networksWireless Networks10.1007/s11276-006-8817-y14:2(147-157)Online publication date: 1-Mar-2008
      • (2006)Multicast transmissions in non-cooperative networks with a limited number of selfish movesProceedings of the 31st international conference on Mathematical Foundations of Computer Science10.1007/11821069_32(363-374)Online publication date: 28-Aug-2006
      • (2006)The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanismsProceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science10.1007/11672142_27(337-348)Online publication date: 23-Feb-2006
      • (2005)Free-riders in steiner tree cost-sharing gamesProceedings of the 12th international conference on Structural Information and Communication Complexity10.1007/11429647_19(231-245)Online publication date: 24-May-2005
      • (2004)More powerful and simpler cost-sharing methodsProceedings of the Second international conference on Approximation and Online Algorithms10.1007/978-3-540-31833-0_10(97-110)Online publication date: 14-Sep-2004
      • (2004)Sharing the Cost of Multicast Transmissions in Wireless NetworksStructural Information and Communication Complexity10.1007/978-3-540-27796-5_23(255-266)Online publication date: 2004

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media