Skip to main content

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms

  • Conference paper
Approximation and Online Algorithms (WAOA 2003)

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

Included in the following conference series:

Abstract

We consider the range assignment problem in ad-hoc wireless networks in the context of selfish agents: a network manager aims in assigning transmission ranges to the stations so to achieve a suitable network with a minimal overall energy; stations are not directly controlled by the manager and may refuse to transmit with a certain transmission range because this results in a power consumption proportional to that range.

We investigate the existence of payment schemes which induce the stations to cooperate with a network manager computing a range assignment, that is, truthful mechanisms for the range assignment problem.

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

Access this chapter

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. Ambühl, C., Clementi, A.E.F., Penna, P., Rossi, G., Silvestri, R.: Energy consumption in radio networks: Selfish agents and rewarding mechanisms. In: Proc. of 10th SIROCCO, pp. 1–16 (2003)

    Google Scholar 

  2. Calinescu, G., Zaragoza, F.: Unpublished manuscript (2002)

    Google Scholar 

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

    Google Scholar 

  4. Clementi, A.E.F., 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: Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23–38 (2002), Also available in http://www.mat.uniroma2.it/~rossig/

  5. Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: 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), pp. 585–594 (2000)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. 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 

  8. Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 129–140 (1999)

    Google Scholar 

  9. Ronen, A.: Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem (2000)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambühl, C., Clementi, A.E.F., Penna, P., Rossi, G., Silvestri, R. (2004). Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24592-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21079-5

  • Online ISBN: 978-3-540-24592-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics