Skip to main content
SpringerLink
Log in

Sharing the Cost of Multicast Transmissions in Wireless Networks

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3104))

Abstract

We investigate the problem of sharing the cost of a multicast transmission in a wireless network where each node (radio station) of the network corresponds to (a set of) user(s) potentially interested in receiving the transmission. As in the model considered by Feigenbaum et al [2001], users may act selfishly and report a false ”level of interest” in receiving the transmission trying to be charged less by the system. We consider the issue of designing a so called truthful mechanisms for the problem of maximizing the net worth (i.e., the overall ”happiness” of the users minus the cost of the transmission) for the case of wireless networks. Intuitively, truthful mechanism guarantee that no user has an incentive in reporting a false valuation of the transmission. Unlike the ”wired” network case, here the cost of a set of connections implementing a multicast tree is not the sum of the single edge costs, thus introducing a complicating factor in the problem. We provide both positive and negative results on the existence of optimal algorithms for the problem and their use to obtain VCG truthful mechanisms achieving the same performances.

Work supported by the European Project IST-2001-33135, Critical Resource Sharing for Cooperation in Complex Systems (CRESCCO).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambuehl, C., Clementi, A., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient algorithms for low-energy bounded-hop broadcast in adhoc wireless networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 418–427. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Ambuehl, C., Clementi, A., Penna, P., Rossi, G., Silvestri, R.: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. In: Proc. of SIROCCO, pp. 1–16 (2003)

    Google Scholar 

  3. Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. In: Proc. of ACM MOBICOM, pp. 245–259 (2003)

    Google Scholar 

  4. Biló, V., Di Francescomarino, C., Flammini, M., Melideo, G.: Sharing the Cost of Multicast Transmissions in Wireless Networks. In: Proc. of SPAA (June 2004)

    Google Scholar 

  5. Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: Proc. of IFIP-TCS, vol. 223, pp. 71–82. Kluwer, Dordrecht (2002)

    Google Scholar 

  6. Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proc. of IFIP-TCS, vol. 223, pp. 119–130. Kluwer, Dordrecht (2002)

    Google Scholar 

  7. Chawla, S., Kitchin, D., Rajan, U., Ravi, R., Sinha, A.: Profit maximization mechanisms for the extended multicast game. Technical report, School of Computer Science, Carnegie Mellon University (2002)

    Google Scholar 

  8. Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17–33 (1971)

    Google Scholar 

  9. Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. of Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23–38 (2001)

    Google Scholar 

  11. Clementi, A., Di Ianni, M., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science 299(1-3), 751–761 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Clementi, A., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999)

    Google Scholar 

  13. Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Effficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of INFOCOM, pp. 585–594 (2000)

    Google Scholar 

  14. Feigenbaum, J., Krishnamurthy, K., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoretical Computer Science 304, 215–236 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences 63(1), 21–41 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. of ACM DIALM, pp. 1–13 (2002)

    Google Scholar 

  17. Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Econmics 6, 375–394 (1976)

    Article  Google Scholar 

  18. Groves, T.: Incentive in Teams. Econometrica 41, 617–631 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  19. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: Proc. of STOC (2001)

    Google Scholar 

  21. Jain, K., Vazirani, V.V.: Equitable cost allocations via primal-dual-type algorithms. In: Proc. of STOC (2002)

    Google Scholar 

  22. Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning trees and shortest-path trees. Algorithmica 14(4), 305–321 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: Budget balance versus efficiency. Economic Theory (1997)

    Google Scholar 

  25. Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior 35, 166–196 (2001); Extended abstract in STOC1999 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  26. Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proc. of STOC (2001)

    Google Scholar 

  27. Penna, P., Ventre, C.: Sharing the Cost of Multicast Transmissions in Wireless Networks. Technical report, CRESCCO (2003), www.ceid.upatras.gr/crescco/

  28. Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321–348 (1979)

    Google Scholar 

  29. Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)

    Google Scholar 

  30. Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. In: Proc. of INFOCOM (2001); Journal version in Wireless Networks 8(6), 607–617 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica ed Applicazioni ”R.M. Capocelli”, Università di Salerno, via S. Allende 2, I-84081, Baronissi (SA), Italy

    Paolo Penna & Carmine Ventre

Authors
  1. Paolo Penna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carmine Ventre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV, 0433-06, Bratislava, Slovakia

    Ratislav Královic̆

  2. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Penna, P., Ventre, C. (2004). Sharing the Cost of Multicast Transmissions in Wireless Networks. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27796-5_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22230-9

  • Online ISBN: 978-3-540-27796-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation