Skip to main content

The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View

  • Conference paper
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6681))

  • 746 Accesses

Abstract

Power assignment in wireless ad hoc networks can be seen as a family of problems in which the task is to find in a given power requirement network a minimum power communication subnetwork that satisfies a given connectivity constraint. These problems have been extensively studied from the viewpoint of approximation, heuristic, linear programming, etc. In this paper, we add a new facet by initiating a systematic parameterized complexity study of three types of power assignment problems related to multicast: Min-power Single-source h-Multicast, Min-power Strongly Connected h-Multicast and Min-power Multi-source h-Multicast. We investigate their parameterized complexities with respect to the number of terminals and the number of senders. We show that Min-power Single-source h-Multicast is fixed-parameter tractable with respect to the number of terminals and achieve several parameterized hardness results.

This work is supported by the National Natural Science Foundation of China under Grant (61073036,60873265), the Doctoral Discipline Foundation of Higher Education Institution of China under Grant (20090162110056), and the DFG Excellence Cluster “Multimodal Computing and Interaction (MMCI)”.

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. Ambühl, C., Clementi, A.E.F., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 418–427. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Calinescu, G., Frieder, O., Wan, P.J.: A Survey of Algorithms for Power Assignment in Wireless Ad Hoc Networks. CRC Press, Boca Raton (2006)

    Google Scholar 

  3. Cagalj, M., Hubaux, J.P., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proc. 8th Annual International Conference on Mobile Computing and Networking (MobiCom 2002), pp. 172–182 (2002)

    Google Scholar 

  4. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad-hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Clementi, A.E.F., Penna, P., Silvestri, R.: The power range assignment problem in radio networks on the plane. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 2832, pp. 651–660. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  7. Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1, 195–207 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Computer Sci. 410, 53–61 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Funke, S., Laue, S.: Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 2832, pp. 272–283. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Funke, S., Laue, S., Naujoks, R.: Minimum-energy broadcast with few senders. In: Aspnes, J., Scheideler, C., Arora, A., Madden, S. (eds.) DCOSS 2007. LNCS, vol. 4549, pp. 404–416. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Liang, W.: Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Transactions on Mobile Computing 5, 377–387 (2006)

    Article  Google Scholar 

  12. Liang, W., Brent, R., Xu, Y., Wang, Q.: Minimum-energy all-to-all multicasting in wireless ad hoc networks. IEEE Transactions on Mobile Computing 8, 5490–5499 (2009)

    Google Scholar 

  13. Yang, W., Wang, L.: The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks. Int. J. Ad Hoc and Ubiquious Computing 4, 237–250 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, W., Wang, J., Feng, Q., Guo, J. (2011). The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View. In: Atallah, M., Li, XY., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 6681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21204-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21204-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21203-1

  • Online ISBN: 978-3-642-21204-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics