Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 2764–2774Cite as

Optimization in Ad Hoc Networks

  • Reference work entry

  • 167 Accesses

Article Outline

Introduction

Applications

  Multiconstrained Quality-of-Service Multipath Routing

  Maximum Flow Problem in Wireless Ad Hoc Networks with Directional Antennas

  Joint Mobility Control and Power-Efficient Routing in Sparse Wireless Sensor Networks

References

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   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.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

References

  1. Armstrong RD, Chen W, Goldfarb D, Jin Z (1998) Strongly polynomial dual simplex methods for the maximum flow problem. Math Programm 1:14–33

    MathSciNet  Google Scholar 

  2. Bhatia R, Kodialam M (2004) On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control. IEEE INFOCOM, HongKong, pp 1457–1466

    Google Scholar 

  3. Cruz RL, Santhanam AV (2003) Optimal routing, link scheduling and power control in multi-hop wireless networks. IEEE INFOCOM, San Francisco, pp 702–711

    Google Scholar 

  4. Fernández-Baca D, Martel CU (1989): On the efficiency of maximum-flow algorithms on networks with small integer capacities. Algorithmica 1:173–189

    Google Scholar 

  5. Ghosh S, Gupta A, Pemmaraju SV (1997) A self-stabilizing algorithm for the maximum flow problem. Distribut Comput 4:167–180

    Google Scholar 

  6. Goldberg AV, Grigoriadis MD, Tarjan RE (1991) Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math Programm 1–3:277–290

    MathSciNet  Google Scholar 

  7. Goldfarb D, Hao J (1990) A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time. Math Programm 1–3:353–365

    MathSciNet  Google Scholar 

  8. Gomez J, Campbell AT (2004) A case for variable-range transmission power control in wireless multihop networks. IEEE INFOCOM, HongKong, pp 1425–1436

    Google Scholar 

  9. Gupta R, Kumar PR (2000) The capacity of wireless networks. IEEE Trans Inform Theory 2:388–404

    MathSciNet  Google Scholar 

  10. Huang X, Fang Y Multiconstrained QoS multipath routing in wireless sensor networks. ACM Wireless Networks, available online on Jan. 2007

    Google Scholar 

  11. Huang X, Li P, Fang Y (2008) Joint mobility control and power efficient routing in sparse wireless sensor networks. submitted to INFOCOM

    Google Scholar 

  12. Huang X, Wang J, Fang Y (2007) Achieving maximum flow in interference-aware wireless sensor networks with smart antennas. Elsevier Ad Hoc Networks 6:885–896

    Google Scholar 

  13. Jaffe JM (1984) Algorithms for finding paths with multiple constraints. Networks 14:95–116

    MathSciNet  MATH  Google Scholar 

  14. Jain K, Padhye J, Padmanabhan VN, Qiu L (2003) Impact of interference on multi-hop wireless network performance. Proc. of ACM MOBICOM (2003), San Diego, pp 66–80

    Google Scholar 

  15. Jung E-S, Vaidya NH (2005) Power aware routing using power control in ad hoc networks. Mobile Comput Commun Rev 3:7–18

    Google Scholar 

  16. Kim D, Pardalos PM (2000) A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J Global Optim 1–4:225–234

    MathSciNet  Google Scholar 

  17. Kodialam M, Nandagopal T (2003) Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. Proc. of ACM MOBICOM (2003), San Diego, CA, pp 42–54

    Google Scholar 

  18. Korkmaz T, Krunz M (2003) Bandwidth-delay constrained path selection under inaccurate state information. IEEE/ACM Trans Networking 3:384–398

    Google Scholar 

  19. Kuipers FA, Mieghem PV (2003) On the complexity of QoS routing. Comput Commun 4:376–387

    Google Scholar 

  20. Kumar S, Gupta P (2003) An incremental algorithm for the maximum flow problem. J Math Modell Algorithms 1:1–16

    MathSciNet  Google Scholar 

  21. Li Q, Aslam J, Rus D (2001) Online power-aware routing in wireless ad-hoc networks. Proc. of Annual Int'l Conf. On Mobile Computing And Networking, Rome, pp 97–107

    Google Scholar 

  22. Li Y, Ephremides A (2005) Joint scheduling, power control, and routing algorithm for ad-hoc wireless networks. Proc. of Hawaii Int'l Conf. on System Science, Big Island

    Google Scholar 

  23. Lin X, Shroff NB, Srikant R (2006) A tutorial on cross-layer optimization in wireless networks. IEEE J Selected Areas Commun 8:1452–1463

    Google Scholar 

  24. Liu W, Zhang Y, Lu K, Fang Y (2006) Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks. J Comb Optim 1:7–20

    MathSciNet  Google Scholar 

  25. Lu G, Krishnamachari B (2005) Energy efficient joint scheduling and power control for wireless sensor networks. Proc. of IEEE Conf. on Sensor and Ad Hoc Commu. and Networks, Santa Clara, pp 362–373

    Google Scholar 

  26. Mieghem PV, Kuipers FA (2004) Concepts of exact QoS routing algorithms. IEEE/ACM Trans Networking 5:851–864

    Google Scholar 

  27. Neve HD, Mieghem PV (1998): A multiple quality of service routing algorithm for PNNI. Proc. ATM Workshop, Fairfax, pp 324–328

    Google Scholar 

  28. Ota N, Hooks D, Wright P, Ausiander D, Peffer T (2003) Poster abstract: wireless sensor networks characterization-application to demand response energy pricing. Proc. ACM Int'l Conf. on Embedded Networked Sensor Systems, Los Angeles, pp 334–335

    Google Scholar 

  29. Palomar DP, Chiang M (2006) A tutorial on decomposition methods for network utility maximization. IEEE J Selected Areas Commun 8:1439–1451

    Google Scholar 

  30. Peraki C, Servetto SD (2003) On the maximum stable throughput problem in random networks with directional antennas. Proc. of the 4th ACM Int'l Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), Annapolis, pp 76–87

    Google Scholar 

  31. Ramanathan R, Hain RR (2000) Topology control of multihop wireless networks using transmit power adjustment. IEEE INFOCOM, pp 404–413

    Google Scholar 

  32. Rappaport TS (1996) Wireless communications principles and practice. Prentice Hall, Upper Saddle River

    Google Scholar 

  33. Resende MGC, Pardalos PM (2006) Handbook of optimization in telecommunications. Springer, Berlin

    MATH  Google Scholar 

  34. Shah RC, Roy S, Jain S, Brunette W (2003) Data mules: modeling a three-tier architecture for sparse sensor networks. Proc. of IEEE Int'l Workshop on Sensor Network Protocols and Applications, Anchorage, pp 30–41

    Google Scholar 

  35. Somasundara AA, Kanasai A, Jea DD, Estrin D, Srivastava MB (2006) Controllably mobile infrastructure for low energy embedded network. IEEE Trans Mobile Comput 6:958–973

    Google Scholar 

  36. Tardos E, Wayne KD (1998) Simple generalized maximum flow algorithms. Lecture Notes in Computer Science, pp 310–324

    Google Scholar 

  37. Tariq MMB, Ammar M, Zegura E (2006) Message ferry route design for sparse ad hoc networks with mobile nodes. Proc. of ACM int'l Symposium on Mobile Ad Hoc Networking and Computing, Florence, pp 37–48

    Google Scholar 

  38. Tsirigos A, Hass ZJ (2004) Analysis of multipath routing, part 2: mitigation of the effects of frequently changing network topologies. IEEE Trans Wireless Commun 2:500–511

    Google Scholar 

  39. Tuncel L (1994) On the complexity of preflow-push algorithms for maximum-flow problems. Algorithmica 4:353–359

    MathSciNet  Google Scholar 

  40. Yi S, Pei Y, Kalyanaraman S (2003) On the capacity improvement of ad hoc wireless networks using directional antennas. Proc. of the 4th ACM Int'l Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), Annapolis, pp 108–116

    Google Scholar 

  41. Xing G, Lu C, Zhang Y, Huang Q, Pless R (2005) Minimum power configuration in wireless sensor networks. Proc. of ACM int'l Symposium on Mobile Ad Hoc Networking and Computing, Urbana-Champaign, pp 390–401

    Google Scholar 

  42. Yuan X (2002) Heuristic algorithms for multiconstrained quality-of-service routing. IEEE/ACM Trans Networking 2:244–256

    Google Scholar 

  43. Znati TF, Melhem R (2004): Node delay assignment strategies to support end-to-end requirement in heterogeneous networks. IEEE/ACM Trans Networking 5:879–892

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical & Computer Engineering, University of Florida, Gainesville, USA

    Xiaoxia Huang & Yuguang Fang

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

    Panos M. Pardalos

Authors
  1. Xiaoxia Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuguang Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Huang, X., Fang, Y., Pardalos, P.M. (2008). Optimization in Ad Hoc Networks . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_476

Download citation

Publish with us

Policies and ethics

Search

Navigation