Skip to main content
SpringerLink
Log in

Maximum flow problem in wireless ad hoc networks with directional antennas

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Directional antenna offers a variety of benefits for wireless networks, one of which is the increased spatial reuse ratio. This feature gives rise to the improved throughput in resource limited wireless ad hoc networks. In this paper, we formulate the maximum flow problem as an optimization problem in wireless ad hoc networks with switched beam directional antennas constrained by interference. We demonstrate how to solve this optimization problem. It turns out that the proposed method works for both single beam antenna and multi-beam antenna, with minor variation of the constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L.: Orlin, J.B. Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)

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

    Article  MathSciNet  Google Scholar 

  3. Burkhart, M., Rickenbach, P.V., Watternhofer, R., Zollinger, A. Does topology control reduce interference?. In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2004), pp. 9–19. Roppongi, Japan (2004)

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  6. Goldberg, A.V. Recent developments in maximum flow algorithms (Invited Lecture). Letcture Notes in Computer Science (1998)

  7. Goldberg A.V., Grigoriadis M.D., Tarjan R.E. Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50(1–3): 277–290

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

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L. Impact of interference on multi-hop wireless network performance. In: Proceedings of ACM MOBICOM, pp. 66–80, San Diego (2003)

  11. Kim D., Pardalos P.M. (2000) A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J. Global Optimization 17(1–4): 225–234

    Article  MATH  MathSciNet  Google Scholar 

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

  13. Kumar S., Gupta P. (2003) An incremental algorithm for the maximum flow problem. J. Mathe. Model. Algorithms 2(1): 1–16

    Article  MathSciNet  Google Scholar 

  14. Li Y, Man, H. Analysis of multipath routing for ad hoc networks using directional antennas. IEEE Vehicular Technol Conference 2004. 4, 2759–2763 (2004)

    Google Scholar 

  15. Peraki, C., Servetto, S.D. On the maximum stable throughput problem in random networks with directional antennas. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 76–87, Annapolis (2003)

  16. Tang, J., Xue, G., Chandler, C., Zhang, W. Interference-aware routing in multihop wireless networks using directional antennas. Proceedings of IEEE INFOCOM 2005

  17. Tardos, E., Wayne, K.D. Simple generalized maximum flow algorithms. Letcture Notes in Computer Science (1998)

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Xue, Y., Li, B., Nahrstedt, K. Optimal resource allocation in wireless ad hoc networks: a price-based approach. IEEE Trans. Mobile Comput. (in press)

  20. Yi, S., Pei, Y., Kalyanaraman, S. On the capacity improvement of ad hoc wireless networks using directional antennas. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 108–116, Annapolis (2003)

  21. Matlab version 6.1. http://www.matlab.com/

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, 32611-6130, USA

    Xiaoxia Huang, Jianfeng Wang & Yuguang Fang

Authors
  1. Xiaoxia Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianfeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuguang Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoxia Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X., Wang, J. & Fang, Y. Maximum flow problem in wireless ad hoc networks with directional antennas. Optimization Letters 1, 71–84 (2007). https://doi.org/10.1007/s11590-006-0016-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-006-0016-3

Keywords

Search

Navigation