Skip to main content
SpringerLink
Log in

Minimum Energy Cost Broadcasting in Wireless Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 81 Accesses

Years and Authors of Summarized Original Work

  • 2001; Wan, Calinescu, Li, Frieder

Problem Definition

Ad hoc wireless networks have received significant attention in recent years due to their potential applications in battlefield, emergency disaster relief and other applications [11, 15]. Unlike wired networks or cellular networks, no wired backbone infrastructure is installed in ad hoc wireless networks. A communication session is achieved either through a single-hop transmission if the communication parties are close enough, or through relaying by intermediate nodes otherwise. Omni-directional antennas are used by all nodes to transmit and receive signals. They are attractive in their broadcast nature. A single transmission by a node can be received by many nodes within its vicinity. This feature is extremely useful for multicasting/broadcasting communications. For the purpose of energy conservation, each node can dynamically adjust its transmitting power based on the distance to the...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Ambühl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32th international colloquium on automata, languages and programming (ICALP). LNCS, vol 3580, pp 1139–1150

    Google Scholar 

  2. Cheng X, Huang X, Li D, Du D-Z (2003) Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42:202–208

    Article  MathSciNet  MATH  Google Scholar 

  3. Chvátal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233–235

    Article  MathSciNet  MATH  Google Scholar 

  4. Clementi A, Crescenzi P, Penna P, Rossi G, Vocca P (2001) On the complexity of computing minimum energy consumption broadcast subgraphs. In: 18th annual symposium on theoretical aspects of computer science. LNCS, vol 2010, pp 121–131

    Google Scholar 

  5. Cormen TJ, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT/McGraw-Hill, Columbus

    MATH  Google Scholar 

  6. Flammini M, Navarra A, Klasing R, Pérennes A (2004) Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC. ACM, New York, pp 85–91

    MATH  Google Scholar 

  7. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York

    MATH  Google Scholar 

  8. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20:347–387

    Article  MathSciNet  MATH  Google Scholar 

  9. Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, New York

    Book  MATH  Google Scholar 

  10. Rappaport TS (1996) Wireless communications: principles and practices. Prentice Hall/IEEE, Piscataway

    Google Scholar 

  11. Singh S, Raghavendra CS, Stepanek J (1999) Power-aware broadcasting in mobile ad hoc networks. In: Proceedings of IEEE PIMRC’99, Osaka

    Google Scholar 

  12. Takahashi H, Matsuyama A (1980) An approximate solution for Steiner problem in graphs. Math Jpn 24(6):573–577

    MathSciNet  MATH  Google Scholar 

  13. Wan P-J, Calinescu G, Li X-Y, Frieder O (2002) Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wirel Netw 8(6):607–617, Preliminary version appeared in IEEE INFOCOM (2000)

    Article  MATH  Google Scholar 

  14. Wan P-J, Calinescu G, Yi C-W (2004) Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans Netw 12:507–514

    Article  Google Scholar 

  15. Wieselthier JE, Nguyen GD, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. IEEE Infocom 2:585–594

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Peng-Jun Wan, Xiang-Yang Li & Ophir Frieder

Authors
  1. Peng-Jun Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiang-Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ophir Frieder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Wan, PJ., Li, XY., Frieder, O. (2016). Minimum Energy Cost Broadcasting in Wireless Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_234

Download citation

Publish with us

Policies and ethics

Search

Navigation