Skip to main content
SpringerLink
Log in
Book cover

Handbook of Combinatorial Optimization pp 1415–1457Cite as

Geometric Optimization in Wireless Networks

  • Reference work entry
  • First Online:

  • 7195 Accesses

Abstract

This chapter focuses on geometric optimization problems including localization, routing, and boundary recognition. These topics are not new in networks. But wireless networks bring a lot of new ingredients and challenges to the problems. For example, because of the lack of central control unit, limited capabilities of sensors, limited transmission range, mobility features, etc., it is desirable to achieve the global tasks by utilizing local information in a distributed way. The focus is put on the main ideas of recent methods.

This is a preview of subscription content, 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   3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   549.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

Learn about institutional subscriptions

Recommended Reading

  1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, O. Fieder, Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 14(5), 408–421 (2003)

    Article  Google Scholar 

  2. P. Angelini, F. Frati, L. Grilli, An algorithm to construct greedy drawings of triangulations, in Proceedings of the 16th International Symposium on Graph Drawing, Heraklion, Crete, Greece, 2008, pp. 26–37

    Google Scholar 

  3. P. Angelini, G.D. Battista, F. Frati, Succinct greedy drawings do not always exist, in Proceedings of the 17th International Symposium on Graph Drawing, Chicago, IL, USA, 2009. Lecture Notes in Computer Science, vol. 5849, 2010, pp. 171–182

    Google Scholar 

  4. J. Aspnes, D. Goldenberg, Y.R. Yang, On the computational complexity of sensor network localization, in The First International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), Turku, Finland, 2004, pp. 32–44

    Google Scholar 

  5. A.R. Berg, T. Jordán, A proof of connelly’s conjecture on 3-connected circuits of the rigidity matroid. J. Comb. Theory B 88(1), 77–97 (2003)

    Article  MATH  Google Scholar 

  6. M. Betke, L. Gurvitis, Mobile robot localization using landmarks, in IEEE International Conference on Robotics and Automation, San Diego, CA, USA, May 1994, vol. 2, pp. 135–142

    Google Scholar 

  7. P. Biswas, Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, in Proceedings of the Third International Symposium on Information Processing in Sensor Networks, Berkeley, CA, USA, 2004, pp. 46–54

    Google Scholar 

  8. L. Blazević, L. Buttyán, S. Capkun, S. Giordano, H. Hubaux, J.L. Boudec, Self-organization in mobile ad hoc networks: the approach of terminodes. IEEE Commun. Mag. 39, 166–175 (2001)

    Article  Google Scholar 

  9. I. Borg, P. Groenen, Modern Multidimensional Scaling, Theory and Applications (Springer, New York, 1997)

    Book  MATH  Google Scholar 

  10. P. Bose, P. Morin, Online routing in triangulations, in Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC’99, London, UK, 1999, pp. 113–122. SIAM J. Comput. 33(4), 937–951 (2004)

    Google Scholar 

  11. P. Bose, P.Morin, I, Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609–616 (2001)

    Article  MATH  Google Scholar 

  12. P. Bose, L. Devroye, W. Evans, D. Kirkpatrick, On the spanning ratio of Gabriel graphs and β-skeletons, in LATIN 2002: Theoretical Informatics. Lecture Notes in Computer Science, vol. 2286/2002 (Springer, Berlin/New York, 2002), pp. 77–97

    Google Scholar 

  13. N. Bulusu, J. Heidemann, D. Estrin, GPS-less low-cost outdoor localization for very small devices. IEEE Pers. Commun. 7(5), 28–34 (2000)

    Article  Google Scholar 

  14. R. Connelly, On generic global rigidity, in Applied Geometry and Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4 (American Mathematical Society, Providence, 1991), pp. 147–155

    Google Scholar 

  15. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications (Springer, Berlin, 1997)

    Book  MATH  Google Scholar 

  16. V. de Silva, R. Ghrist, Coverage in sensor networks via persistent homology. Algebr. Geom. Topol. 7, 339–358 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. V. de Silva, R. Ghrist, Homological sensor networks. Not. Am. Math. Soc. 54(1), 10–17 (2007)

    MATH  Google Scholar 

  18. D.P. Dobkin, S.J. Friedman, K.J. Supowit, Delaunay graphs are almost as good as complete graphs. Discret. Comput. Geom. 5(4), 399–407 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  19. R. Dhandapani, Greedy drawings of triangulations, in SODA’08: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 2008, pp. 102–111

    Google Scholar 

  20. D. Eppstein, Spanning trees and spanners, in Handbook of Computational Geometry, ed. by J.-R. Sack, J. Urrutia (North-Holland, Amsterdam, 2000), pp. 425–461

    Chapter  Google Scholar 

  21. D. Eppstein, M.T. Goodrich, Succinct greedy graph drawing in the hyperbolic plane, in Proceedings of the 16th International Symposium on Graph Drawing, Heraklion, Crete, Greece, 2008, pp. 14–25

    Google Scholar 

  22. T. Eren, D. Goldenberg, W. Whitley, Y. Yang, S. Morse, B. Anderson, P. Belhumeur, Rigidity, computation, and randomization of network localization, in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’04), Hong Kong, China, March 2004, vol. 4, pp. 2673–2684

    Google Scholar 

  23. Q. Fang, J. Gao, L. Guibas, V. de Silva, L. Zhang, GLIDER: gradient landmark-based distributed routing for sensor networks, in Proceedings of the 24th Conference of the IEEE Communication Society (INFOCOM), Miami, FL, USA, March 2005, vol. 1, pp. 339–350

    Google Scholar 

  24. Q. Fang, J. Gao, L. Guibas, Locating and bypassing routing holes in sensor networks. Mob. Netw. Appl. 11, 187–200 (2006)

    Article  Google Scholar 

  25. S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, C. Buschmann, Neighborhood-based topology recognition in sensor networks, in ALGOSENSORS, Turku, Finland. Lecture Notes in Computer Science, vol. 3121 (Springer, 2004), pp. 123–136

    Google Scholar 

  26. S.P. Fekete, M. Kaufmann, A. Kröller, N. Lehmann, A new approach for boundary recognition in geometric sensor networks, in Proceedings 17th Canadian Conference on Computational Geometry, University of Windsor, Ontario, Canada, 2005, pp. 82–85

    Google Scholar 

  27. G.G. Finn, Routing and addressing problems in large metropolitan-scale internetworks. Technical report ISU/RR-87–180, ISI, March 1987

    Google Scholar 

  28. R. Flury, S. Pemmaraju, R. Wattenhofer, Greedy routing with bounded stretch, in Proceedings of the 28th Annual IEEE Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, April 2009

    Google Scholar 

  29. R. Fonseca, S. Ratnasamy, J. Zhao, C.T. Ee, D. Culler, S. Shenker, I. Stoica, Beacon vector routing: scalable point-to-point routing in wireless sensornets, in Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI), Boston, MA, USA, May 2005, pp. 329–342

    Google Scholar 

  30. S. Funke, Topological hole detection in wireless sensor networks and its applications, in DIALM-POMC’05: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, Cologne, Germany, 2005, pp. 44–53

    Google Scholar 

  31. S. Funke, C. Klein, Hole detection or: “how much geometry hides in connectivity?” in SCG’06: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, Sedona, AZ, USA, 2006, pp. 377–385

    Google Scholar 

  32. S. Funke, N. Milosavljević, Guaranteed-delivery geographic routing under uncertain node locations, in Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM’07), Anchorage, AK, USA, May 2007, pp. 1244–1252

    Google Scholar 

  33. S. Funke, N. Milosavljević, Network sketching or: “how much geometry hides in connectivity? – part II”, in SODA’07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 2007, pp. 958–967

    Google Scholar 

  34. J. Gao, L. Zhang, Load balanced short path routing in wireless networks. IEEE Trans. Parallel Distrib. Syst. Special Issue on Localized Communications 17(4), 377–388 (2006)

    Article  Google Scholar 

  35. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, A. Zhu, Discrete mobile centers, in Proceedings of 17-th Annual Symposium on Computational Geometry (SCG), Medford, MA, USA (ACM, 2001), pp. 188–196

    Google Scholar 

  36. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, A. Zhu, Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. Special issue on Wireless Ad Hoc Networks 23(1), 174–185 (2005)

    Google Scholar 

  37. R. Ghrist, A. Muhammad, Coverage and hole-detection in sensor networks via homology, in Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN’05), Los Angeles, CA, USA, 2005, pp. 254–260

    Google Scholar 

  38. D. Goldenberg, A. Krishnamurthy, W. Maness, Y.R. Yang, A. Young, A.S. Morse, A. Savvides, B. Anderson, Network localization in partially localizable networks, in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’05), Miami, FL, USA, March 2005, vol. 1, pp. 313–326

    Google Scholar 

  39. D.K. Goldenberg, P. Bihler, Y.R. Yang, M. Cao, J. Fang, A.S. Morse, B.D.O. Anderson, Localization in sparse networks using sweeps, in MobiCom’06: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (ACM, New York, 2006), pp. 110–121

    Google Scholar 

  40. M.T. Goodrich, D. Strash, Succinct greedy geometric routing in the Euclidean plane, in ISAAC 2009, Honolulu, HI, USA, 2009. Lecture Notes in Computer Science, vol. 5878, pp. 781–791

    Google Scholar 

  41. J.E. Graver, B. Servatius, H. Servatius, Combinatorial Rigidity. Graduate Studies in Mathematics (American Mathematical Society, Providence, 1993)

    MATH  Google Scholar 

  42. X. He, H. Zhang, On succinct convex greedy drawing of 3-connected plane graphs, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, Jan 2011, pp. 1477–1486

    Google Scholar 

  43. B. Hendrickson, Conditions for unique graph realizations. SIAM J. Comput. 21(1), 65–84 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  44. T. Hou, V. Li, Transmission range control in multihop packet radio networks. IEEE Trans. Commun. 34(1), 38–44 (1986)

    Article  MathSciNet  Google Scholar 

  45. B. Jackson, T. Jordán, Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory Ser. B 94(1), 1–29 (2005)

    Article  MATH  Google Scholar 

  46. D.J. Jacobs, B. Hendrickson, An algorithm for two-dimensional rigidity percolation: the pebble game. J. Comput. Phys. 137(2), 346–365 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  47. R. Jain, A. Puri, R. Sengupta, Geographical routing using partial information for wireless ad hoc networks. IEEE Pers. Commun. 8(1), 48–57 (2001)

    Article  Google Scholar 

  48. B. Karp, H. Kung, GPSR: greedy perimeter stateless routing for wireless networks, in Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Boston, MA, USA, 2000, pp. 243–254

    Google Scholar 

  49. J.M. Keil, C.A. Gutwin, The Delaunay triangulation closely approximates the complete Euclidean graph, in Proceedings of the International Workshop Algorithms Data Structures, Ottawa, Canada, 1989. Lecture Notes in Computer Science Series, vol. 382, pp. 47–56

    Google Scholar 

  50. R. Kleinberg, Geographic routing using hyperbolic space, in Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM’07), Anchorage, AK, USA, 2007, pp. 1902–1909

    Google Scholar 

  51. E. Kranakis, H. Singh, J. Urrutia, Compass routing on geometric networks, in Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, BC, Canada, 1999, pp. 51–54

    Google Scholar 

  52. A. Kröller, S.P. Fekete, D. Pfisterer, S. Fischer, Deterministic boundary recognition and topology extraction for large sensor networks, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’06), Miami, FL, USA, 2006, pp. 1000–1009

    Google Scholar 

  53. F. Kuhn, R. Wattenhofer, A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing, in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Atlanta, GA, USA, 2002, pp. 24–33

    Google Scholar 

  54. F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger, Geometric ad-hoc routing: of theory and practice, in Proceedings of the 22nd ACM International Symposium on the Principles of Distributed Computing (PODC), Boston, MA, USA, 2003, pp. 63–72

    Google Scholar 

  55. F. Kuhn, R. Wattenhofer, A. Zollinger, Worst-case optimal and average-case efficient geometric ad-hoc routing, in Proceedings of the 4-th ACM International Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), Annapolis, MD, USA, 2003

    Google Scholar 

  56. G. Laman, On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4(4), 331–340 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  57. S. Lederer, Y. Wang, J. Gao, Connectivity-based localization of large scale sensor networks with complex shape, in Proceedings of the 27th Annual IEEE Conference on Computer Communications (INFOCOM’08), Phoenix, AZ, USA, May 2008, pp. 789–797. ACM Trans. Sens. Netw. 5(4), 31:1–31:32 (2009)

    Google Scholar 

  58. T. Leighton, A. Moitra, Some results on greedy embeddings in metric spaces, in Proceedings of the 49th IEEE Annual Symposium on Foundations of Computer Science, Las Vegas, NV, USA, Oct 2008, pp. 337–346. Discret. Comput. Geom. 44, 686–705 (2010)

    Google Scholar 

  59. M. Li, Y. Liu, Rendered path: range-free localization in anisotropic sensor networks with holes, in Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking, MobiCom07 (ACM, New York, 2007), pp. 51–62

    Google Scholar 

  60. X.-Y. Li, G. Calinescu, P.-J. Wan, Distributed construction of a planar spanner and routing for ad hoc wireless networks, in INFOCOM’02, New York, USA, 2002, pp. 1268–1277

    Google Scholar 

  61. Z. Li, W. Trappe, Y. Zhang, B. Nath, Robust statistical methods for securing wireless localization in sensor networks, in IPSN’05: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IEEE, Piscataway, 2005), pp. 91–98

    Google Scholar 

  62. J. Liebeherr, M. Nahas, W. Si, Application-layer multicasting with delaunay triangulation overlays. IEEE J. Sel. Areas Commun. 20(8), 1472–1488 (2002)

    Article  Google Scholar 

  63. A. Mei, J. Stefa, Routing in outer space: fair traffic load in multi-hop wireless networks, in MobiHoc’08: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM, New York, 2008), pp. 23–32

    Google Scholar 

  64. D. Moore, J. Leonard, D. Rus, S. Teller, Robust distributed network localization with noisy range measurements, in SenSys’04: Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (ACM, New York, 2004), pp. 50–61

    Google Scholar 

  65. A. Nguyen, N. Milosavljevic, Q. Fang, J. Gao, L.J. Guibas, Landmark selection and greedy landmark-descent routing for sensor networks, in Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM’07), Anchorage, AK, USA, May 2007, pp. 661–669

    Google Scholar 

  66. D. Niculescu, B. Nath, Ad hoc positioning system (APS), in IEEE GLOBECOM, San Antonio, TX, USA, 2001, pp. 2926–2931

    Google Scholar 

  67. D. Niculescu, B. Nath, Ad hoc positioning system (APS) using AOA, in IEEE INFOCOM, San Franciso, CA, USA, March 2003, vol. 22, pp. 1734–1743

    Google Scholar 

  68. D. Niculescu, B. Nath, Error characteristics of ad hoc positioning systems (APS), in MobiHoc’04: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Tokyo, Japan, 2004, pp. 20–30

    Google Scholar 

  69. C.H. Papadimitriou, D. Ratajczak, On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3–14 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  70. L. Popa, A. Rostamizadeh, R. Karp, C. Papadimitriou, I. Stoica, Balancing traffic load in wireless networks with curveball routing, in MobiHoc’07: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM, New York, 2007), pp. 170–179

    Google Scholar 

  71. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985)

    Book  Google Scholar 

  72. A. Rao, C. Papadimitriou, S. Shenker, I. Stoica, Geographic routing without location information, in Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, San Diego, CA, USA, 2003, pp. 96–08

    Google Scholar 

  73. R. Sarkar, X. Yin, J. Gao, F. Luo, X.D. Gu, Greedy routing with guaranteed delivery using ricci flows, in Proceedings of the 8th International Symposium on Information Processing in Sensor Networks (IPSN’09), San Francisco, CA, USA, April 2009, pp. 97–108

    Google Scholar 

  74. R. Sarkar, W. Zeng, J. Gao, X.D. Gu, Covering space for in-network sensor data storage, in Proceedings of the 9th International Symposium on Information Processing in Sensor Networks (IPSN’10), Stockholm, Sweden, April 2010, pp. 232–243

    Google Scholar 

  75. O. Saukh, R. Sauter, M. Gauger, P.J. Marrón, On boundary recognition without location information in wireless sensor networks. ACM Trans. Sens. Netw. 6, 20:1–20:35 (2010)

    Google Scholar 

  76. A. Savvides, C.-C. Han, M.B. Strivastava, Dynamic fine-grained localization in ad-hoc networks of sensors, in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (ACM, 2001), pp. 166–1779

    Google Scholar 

  77. A. Savvides, H. Park, M.B. Strivastava. The n-hop multilateration primitive for node localization problems. Mob. Netw. Appl. 8(4), 443–451 (2003)

    Article  Google Scholar 

  78. J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in Proceedings of the 17th Allerton Conference in Communications, Control and Computing, Monticello, IL, 1979, pp. 480–489

    Google Scholar 

  79. Y. Shang, W. Ruml, Improved MDS-based localization, in Proceedings of IEEE NOFOCOM, Hong Kong, China, 2004

    Google Scholar 

  80. Y. Shang, W. Ruml, Y. Zhang, M.P.J. Fromherz, Localization from mere connectivity, in MobiHoc03: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Annapolis, MD, USA, 2003, pp. 201–212

    Google Scholar 

  81. A.M.-C. So, Y. Ye, Theory of semidefinite programming for sensor network localization, in SODA’05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, BC, Canada, 2005, pp. 405–414

    Google Scholar 

  82. I. Stojmenovic, X. Lin, Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst. 12(10), 1023–1032 (2001)

    Article  Google Scholar 

  83. I. Stojmenovic, X. Lin, Power-aware localized routing in wireless networks. IEEE Trans. Parallel Distrib. Syst. 12(11), 1122–1133, (2001)

    Article  Google Scholar 

  84. H. Takagi, L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32(3), 246–257 (1984)

    Article  Google Scholar 

  85. G. Tan, H. Jiang, S.Z. Zhang, A.-M. Kermarrec, Connectivity-based and anchor-free localization in large-scale 2d/3d sensor networks, in Proceedings of the Eleventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc10 (ACM, New York, 2010), pp. 191–200

    Google Scholar 

  86. P.F. Tsuchiya, The landmark hierarchy: a new hierarchy for routing in very large networks, in SIGCOMM’88: Symposium proceedings on Communications Architectures and Protocols, Stanford, CA, USA, 1988, pp. 35–42

    Google Scholar 

  87. Y. Wang, X.-Y. Li, Geometric spanners for wireless ad hoc networks, in Proceedings of the 22-nd International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, 2002

    Google Scholar 

  88. Y. Wang, J. Gao, J.S.B. Mitchell, Boundary recognition in sensor networks by topological methods, in Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Los Angeles, CA, USA, Sept 2006, pp. 122–133

    Google Scholar 

  89. Y. Wang, S. Lederer, J. Gao, Connectivity-based sensor network localization with incremental Delaunay refinement method, in INFOCOM’09, Rio de Janeiro, Brazil, 2009, pp. 2401–2409

    Google Scholar 

  90. X. Yu, X. Ban, R. Sarkar, W. Zeng, X.D. Gu, J. Gao, Spherical representation and polyhedron routing for load balancing in wireless sensor networks, in Proceedings of 30th Annual IEEE Conference on Computer Communications (INFOCOM’11), Shanghai, China, April 2011

    Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation of China (61222201) and Specialized Research Fund for the Doctoral Program of Higher Education (20126501110001). It is also supported by National Science Foundation of the USA under grants 1020 CNS0831579 and CCF0728851.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, 75083, Richardson, TX, USA

    Weili Wu

  2. College of Mathematics and System Sciences, Xinjiang University, 830046, Urumqi, Xinjiang, People’s Republic of China

    Zhao Zhang

Authors
  1. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weili Wu .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Wu, W., Zhang, Z. (2013). Geometric Optimization in Wireless Networks. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_41

Download citation

Publish with us

Policies and ethics

Search

Navigation