Skip to main content
SpringerLink
Log in

A Role of Minimum Spanning Tree

  • Chapter
  • First Online:
Nonlinear Combinatorial Optimization

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 147))

Abstract

In a wireless sensor network, a topology control problem aims to adjust power of sensors so that the topology supported by the power has some desirable property and the total power is as small as possible. In this chapter, we shall present studies on the topology control problem with the properties of containing a spanning tree, a strongly connected spanning digraph, and a broadcast tree. Minimum spanning tree plays an important role in all these studies, serving as a linearization method for these nonlinear problems.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 69.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

References

  1. Althaus, E., Calinescu, G., M.andoiu, I.I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment in ad-hoc wireless networks. In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889–1894. IEEE, New Orleans (2003)

    Google Scholar 

  2. Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. Lect. Notes Comput. Sci. 3580, 1139–1150 (2005)

    Article  MathSciNet  Google Scholar 

  3. Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: Proc. of the IFIP 17th World Computer Congress TC1 Stream/2nd IFIP International Conference on Theoretical Computer Science (TCS), pp. 71–82 (2002)

    Chapter  Google Scholar 

  4. Borchers, A., Du, D.-Z.: The k-Steiner ratio in graphs. SIAM J. Comput. 26, 857–869 (1997)

    Article  MathSciNet  Google Scholar 

  5. Byrka, J., Grandoni, F., Rothvoss, T., Sanitá, L.: An improved LP-based approximation for Steiner tree. In: STOC 2010, pp. 583–592 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Cagalj, M., Hubaux, J., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MobiCom’02), pp. 172–182. ACM Press, New York (2002)

    Google Scholar 

  7. Cai, H., Zhao, Y.: On approximation ratios of minimum-energy multicast routing in wireless networks. J. Comb. Optim. 3, 243–262 (2005)

    Article  MathSciNet  Google Scholar 

  8. Calinescu, G.: Minimum-power strong connectivity. Lect. Notes Comput. Sci. 6302, 67–80 (2010)

    Article  MathSciNet  Google Scholar 

  9. Calinescu, G.: Approximate min-power strong connectivity. SIAM J. Discret. Math. 27(3), 1527–1543 (2013)

    Article  MathSciNet  Google Scholar 

  10. Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 119–130. Kluwer Academic Publishers, Dordrecht (2002)

    Chapter  Google Scholar 

  11. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad-hoc wireless networks. Lect. Notes Comput. Sci. 2832, 114–126 (2003)

    Article  MathSciNet  Google Scholar 

  12. Caragiannis, I., Kaklamanis, C., Kanellopulos, P.: New results for energy-efficient broadcasting in wireless networks. Lect. Notes Comput. Sci. 2518, 332–343 (2002)

    Article  MathSciNet  Google Scholar 

  13. Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement on the mst heuristic for minimum energy broadcasting in ad hoc wireless networks. In: ICALP 2007, pp. 447–458 (2007)

    MathSciNet  MATH  Google Scholar 

  14. Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. IEEE/ACM Trans. Netw. 21(4), 1322–1331 (2013)

    Article  Google Scholar 

  15. Carmi, P., Katz, M.J.: Power assignment in radio networks with two power levels. Algorithmica 47, 183–201 (2007)

    Article  MathSciNet  Google Scholar 

  16. Chen, W.T., Huang, N.F.: The strongly connection problem on multihop packet radio networks. IEEE Trans. Commun. 37(3), 293–295 (1989)

    Article  Google Scholar 

  17. Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. Lect. Notes Comput. Sci. 1671, 197–208 (1999)

    Article  Google Scholar 

  18. Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. Lect. Notes Comput. Sci. 2010, 121–131 (2001)

    Article  MathSciNet  Google Scholar 

  19. Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Netw. Appl. 9(2), 125–140 (2004)

    Article  Google Scholar 

  20. Conway, J.H., Sloane, N.J.A.: “The kissing number probe” and “bounds on kissing numbers”. In: Sphere Packings, Lattices, and Groups, 3rd edn. Springer, New York (1998)

    Google Scholar 

  21. Du, D.-Z., Zhang, Y.-J.: On better heuristic for Steiner minimum trees. Math. Program. Ser. B 57, 193–202 (1992)

    Article  MathSciNet  Google Scholar 

  22. Du, D.-Z., Ko, K.-I., Hu, X.: Design and Analysis of Approximation Algorithms. Springer, New York (2011)

    Google Scholar 

  23. Hajiadhayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. Math. Program 110, 195–208 (2007)

    Article  MathSciNet  Google Scholar 

  24. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packer radio networks. Theor. Comput. Sci. 243, 289–305 (2000)

    Article  Google Scholar 

  25. Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. Lect. Notes Comput. Sci. 3042, 866–877 (2004)

    Article  Google Scholar 

  26. Kortsarz, G., Mirrokni, V.S., Nutov, Z., Tsanko, E.: Approximating minimum-power degree and connectivity problems. Lect. Notes Comput. Sci. 4957, 423–435 (2008)

    Article  MathSciNet  Google Scholar 

  27. Li, M., Huang, S.L., Sun, X., Huang, X.: Performance evaluation for energy efficient topologic control in ad hoc wireless networks. Theor. Comput. Sci. 326(1-3), 399–408 (2004)

    Article  MathSciNet  Google Scholar 

  28. Navarra, A.: Tighter bounds for the minimum energy broadcasting problem. In: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WIOPT ’05 ), pp. 313–322 (2005)

    Google Scholar 

  29. Navarra, A.: 3-D minimum energy broadcasting. Lect. Notes Comput. Sci. 4056, 240–252 (2006)

    Article  Google Scholar 

  30. Navarra, A., Flammini, M., Klasing, R., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. Algorithmica 49, 318–336 (2007)

    Article  MathSciNet  Google Scholar 

  31. Nguyen, G.D., Wieselthier, J.E., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: IEEE INFOCOM 2000 (2000)

    Google Scholar 

  32. Prömel, H.J., Steger, A.: A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. J. Algorithms 36, 89–101 (2000)

    Article  MathSciNet  Google Scholar 

  33. Rappaport, T.: Wireless Communications: Principles and Practice. Prentice-Hall, Englewood Cliff

    Google Scholar 

  34. Robin, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA 2000, pp. 770–779 (2000)

    MathSciNet  MATH  Google Scholar 

  35. Sun, J., Cheng, X., Wang, L., Xu, Y., Cheng, M.X., Cardei, M., Du, D.-Z.: Topology control of ad hoc wireless networks for energy efficiency. IEEE Trans. Comput. 53(12), 1629–1635 (2004)

    Article  Google Scholar 

  36. Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast routing in static ad-hoc wireless networks. In: IEEE INFOCOM 2001, pp. 1162–1171 (2001)

    Google Scholar 

  37. Yuan, D., Bauer, J., Haugland, D.: New results on the time complexity and approximation ratio of the broadcast incremental power algorithm. Inf. Process. Lett. 109, 615–619 (2009)

    Article  MathSciNet  Google Scholar 

  38. Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Department of Computer Science, University of Virginia (1996)

    Google Scholar 

  39. Zelikovsky, A.: An 11/6-approximation algorithm for the network Steiner tree problem. Algorithmica 9, 463–470 (1993)

    Article  MathSciNet  Google Scholar 

  40. Zhong, C.: Sphere Packing. Springer, New York (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang & Xiaohui Huang

Authors
  1. Zhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaohui Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhao Zhang .

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. Department of Industrial & Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  3. Department of Computer Science, Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zhang, Z., Huang, X. (2019). A Role of Minimum Spanning Tree. In: Du, DZ., Pardalos, P., Zhang, Z. (eds) Nonlinear Combinatorial Optimization. Springer Optimization and Its Applications, vol 147. Springer, Cham. https://doi.org/10.1007/978-3-030-16194-1_1

Download citation

Publish with us

Policies and ethics

Search

Navigation