Skip to main content
SpringerLink
Log in

Topology Control in Wireless Multihop Networks

  • Chapter
Combinatorial Optimization in Communication Networks

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

  • 886 Accesses

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. E. Jones, K. M. Sivalingam, P. Agrawal, and J. C. Chen, A survey of energy efficient network protocols for wireless networks, Wireless Networks, vol. 7, no. 4, pp. 343–358, Aug. 2001.

    Article  MATH  Google Scholar 

  2. P. Gupta and P. R. Kumar, The capacity of wireless networks, IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388–404, Mar. 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol, in Proc. European Wireless 2002, Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, Florence, Italy, Feb. 2002, pp. 156–162.

    Google Scholar 

  4. P. Santi, D. M. Blough, and F. Vainstein, A probabilistic analysis for the range assignment problem in ad hoc networks, in Proc. 1st ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Long Beach, CA, USA, Aug. 2000, pp. 212–220.

    Google Scholar 

  5. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in Proc. IEEE INFOCOM 2000, vol. 2, Tel Aviv, Israel, Mar. 2000, pp. 404–413.

    Google Scholar 

  6. S. A. Borbash and E. H. Jennings, Distributed topology control algorithm for multihop wireless networks, in Proc. International Joint Conference on Neural Networks, (IJCNN’ 02), Honolulu, HI, USA, May 2002, pp. 355–360.

    Google Scholar 

  7. X.-Y. Li, G. Calinescu, and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc networks, in Proc. IEEE INFOCOM 2002, vol. 3, New York, NY, USA, June 2002, pp. 1268–1277.

    Google Scholar 

  8. X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi, Fault tolerant deployment and topology control in wireless networks, in Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Annapolis, MD, USA, June 2003, pp. 117–128.

    Google Scholar 

  9. N. Li, J. C. Hou, and L. Sha, Design and analysis of an MST-based topology control algorithm, in Proc. IEEE INFOCOM 2003, vol. 3, San Francisco, CA, USA, Apr. 2003, pp. 1702–1712.

    Google Scholar 

  10. N. Li and J. C. Hou, Topology control in heterogeneous wireless networks: Problems and solutions, in Proc. of IEEE INFOCOM, Hong Kong, China, Mar. 2004. Also available as a technical report in the Department of Computer Science, University of Illinois at Urbana Champaign, no. UIUCDCS-R-2004-2412, March 2004.

    Google Scholar 

  11. N. Li and J. C. Hou, FLSS: A fault-tolerant topology control algorithm for wireless networks, in Proc. ACM International Conference on Mobile Computing and Networking (MOBICOM), Philadelphia, PA, USA, Sept. 2004.

    Google Scholar 

  12. C. Savarese, J. M. Rabaey, and J. Beutel, Location in distributed adhoc wireless sensor networks, in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 4, Salt Lake City, UT, USA, May 2001, pp. 2037–2040.

    Google Scholar 

  13. T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher, Range-free localization schemes for large scale sensor networks, in Proc. ACM International Conference on Mobile Computing and Networking (MOBICOM), San Diego, CA, USA, Sept. 2003, pp. 81–95.

    Google Scholar 

  14. H. Lim and J. C. Hou, Localization for anisotropic sensor networks, in Proc. IEEE INFOCOM, Miami, FL, USA, Mar. 2005.

    Google Scholar 

  15. V. Rodoplu and T. H. Meng, Minimum energy mobile wireless networks, IEEE J. Select. Areas Commun., vol. 17, no. 8, pp. 1333–1344, Aug. 1999.

    Article  Google Scholar 

  16. R. Prim, Shortest connection networks and some generalizations, The Bell System Technical Journal, vol. 36, pp. 1389–1957, 1957.

    Google Scholar 

  17. S. Pettie and V. Ramachandran, An optimal minimum spanning tree algorithm, Journal of the ACM, vol. 49, no. 1, pp. 16–34, Jan. 2002.

    Article  MathSciNet  Google Scholar 

  18. C. Monma and S. Suri, Transitions in geometric minimum spanning trees, in Proc. ACM Symposium on Computational Geometry, North Conway, NH, USA, 1991, pp. 239–249.

    Google Scholar 

  19. G. Toussaint, The relative neighborhood graph of a finite planar set, Pattern Recognition, vol. 12, pp. 261–268, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  20. K. J. Supowit, The relative neighborhood graph, with an application to minimum spanning trees, Journal of the ACM, vol. 30, no. 3, pp. 428–448, July 1983.

    Article  MATH  MathSciNet  Google Scholar 

  21. L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks, in Proc. ACM Symposium on Principles of Distributed Computing (PODC), Newport, RI, USA, Aug. 2001, pp. 264–273.

    Google Scholar 

  22. Y. J. Chu and T. H. Liu, On the shortest arborescence of a directed graph, Science Sinica, vol. 14, pp. 1396–1400, 1965.

    MATH  Google Scholar 

  23. J. Edmonds, Optimum branchings, Journal of Research of the National Bureau of Standards, vol. 71B, pp. 233–240, 1967.

    MathSciNet  Google Scholar 

  24. F. Bock, An algorithm to construct a minimum spanning tree in a directed network, in Developments in Operations Research. New York, NY: Gordon and Breach Science Publishers, 1971, pp. 29–44.

    Google Scholar 

  25. J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, vol. 7, pp. 48–50, 1956.

    Article  MATH  MathSciNet  Google Scholar 

  26. S. Even and R. E. Tarjan, Network flow and testing graph connectivity, SIAM Journal on Computing, vol. 4, pp. 507–518, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  27. G. D. Battista, R. Tamassia, and L. Vismara, Output-sensitive reporting of disjoint paths, Algorithmica, vol. 23, no. 4, pp. 302–340, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  28. M. Bahramgiri, M. Hajiaghayi, and V. S. Mirrokni, Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multihop networks, in Proc. Eleventh International Conference on Computer Communications and Networks (ICCCN), Oct. 2002, pp. 392–397.

    Google Scholar 

  29. H.-Y. Tyan, Design, realization and evaluation of a component-based software architecture for network simulation, Ph.D. dissertation, The Ohio State University, Columbus, OH, USA, 2001, http://www.j-sim.org.

    Google Scholar 

  30. S. McCanne and S. Floyd, ns Network Simulator, http://www.isi.edu/nsnam/ns/.

    Google Scholar 

  31. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Mathematics, 86:165–177, 1990.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 61801

    Ning Li & Jennifer C. Hou

Authors
  1. Ning Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jennifer C. Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Li, N., Hou, J.C. (2006). Topology Control in Wireless Multihop Networks. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_2

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation