Skip to main content

New Results for Energy-Efficient Broadcasting in Wireless Networks

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

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

Included in the following conference series:

Abstract

Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted Connected Dominating Set. We also show that an important special instance of the problem can be solved in polynomial time, solving an open problem of Clementi et al. [2].

This work was partially supported by the European Union under IST FET Project ALCOM-FT, IST FET Project CRESCCO, and RTN Project ARACNE.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. G. Călinescu, I. Măndoiu, A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proc. of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, to appear.

    Google Scholar 

  2. A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS’ 01), LNCS 2010, Springer, pp. 121–131, 2001.

    Google Scholar 

  3. A. E. F. Clementi, M. Di Ianni, R. Silvestri. The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science, to appear.

    Google Scholar 

  4. A. E. F. Clementi, P. Penna, R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM/APPROX’ 99), LNCS 1671, Springer, pp. 197–208, 1999.

    Google Scholar 

  5. S. Guha, S. Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, Vol. 150(1), pp. 57–74, 1999.

    Article  MathSciNet  Google Scholar 

  6. L. M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, Vol. 243(1–2), pp. 289–305, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  7. P.-J. Wan, G. Călinescu, X.-Y. Li, O. Frieder. Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In Proc. of IEEE INFOCOM 2001, pp. 1162–1171.

    Google Scholar 

  8. J. E. Wieselthier, G. D. Nguyen, A. Ephremides. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In Proc. of IEEE INFOCOM 2000, pp. 585–594.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caragiannis, I., Kaklamanis, C., Kanellopoulos, P. (2002). New Results for Energy-Efficient Broadcasting in Wireless Networks. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics