Skip to main content
Log in

Maximum bandwidth routing and maximum flow routing in wireless mesh networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The emergence of nomadic multimedia applications, such as multimedia conferencing, distance learning, video phones, video/movie-on-demand, and education-on-demand, has recently generated much interest in multi-hop wireless mesh networks (WMNs) to support diverse Quality-of-Service (QoS). In the existing WMN QoS routing protocols, the methods of bandwidth calculation and allocation were proposed to determine routes with bandwidth guaranteed for QoS applications. This paper studies two NP-hard problems, the maximum bandwidth routing problem (abbreviated to MBRP) and the maximum flow routing problem (abbreviated to MFRP). Given a source node s and a destination node d in a multi-hop wireless mesh network, the MBRP is to determine an s-to-d path that can carry a maximum amount of traffic from s to d and the MFRP is to determine the maximum flow from s to d, both retaining the network bandwidth-satisfied. In this paper, heuristic algorithms for the two problems are proposed. Upper bounds on their optimal values are derived, and a lower bound is derived on the feasible value obtained for the MBRP. With the upper bound and the lower bound, an approximation ratio for the heuristic algorithm of the MBRP is obtained. The effectiveness of the heuristic algorithms is further verified by experiments. A generalized interference model is also discussed.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Motorola’s meshnetworks enabled architecture (MEA). http://www.meshnetworks.com.

  2. Nortel’s wireless mesh network solution. http://www.nortel.com/solutions/wrlsmesh.

  3. Wireless LAN medium access control (MAC) and physical layer (PHY) specification. IEEE Standard 802.11 (1997).

  4. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall.

    Google Scholar 

  5. Akyildiz, I., & Wang, X. (2005). A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), S23–S30.

    Article  Google Scholar 

  6. Apostolopoulos, G., Guerin, R., Kamat, S., & Tripathi, S. K. (1998). Quality-of-service based routing: a performance perspective. In Proceedings of the SIGCOMM, September 1998 (pp. 17–28).

  7. Balakrishnan, H., Barrett, C. L., Kumar, V. S. A., Marathe, M. V., & Thite, S. (2004). The distance-2 matching problem and its relationship to the mac-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, 22(6), 1069–1079.

    Article  Google Scholar 

  8. Bruno, R., Conti, M., & Gregori, E. (2005). Mesh networks: commodity multihop ad hoc networks. IEEE Communications Magazine, 43(3), 123–131.

    Article  Google Scholar 

  9. Chen, S., & Nahrstedt, K. (1999). Distributed quality-of-service in ad hoc networks. IEEE Journal on Selected Areas in Communications, 17(8), 1488–1505.

    Article  Google Scholar 

  10. Gopalan, K., Chiueh, T. C., & Lin, Y. J. (2004). Load balancing routing with bandwidth-delay guarantees. IEEE Communications Magazine, 42(6), 108–113.

    Article  Google Scholar 

  11. Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.

    Article  Google Scholar 

  12. Guerin, R., Orda, A., & Williams, D. (1997). QoS routing mechanisms and OSPF extensions. In Proceedings of the IEEE GLOBECOM (Vol. 3, pp. 1903–1908), November 1997.

  13. Gibbens, R. J., Kelly, F. P., & Key, P. B. (1988). Dynamic alternative routing—modelling and behaviour. In Proceedings of the 12th international teltraffic congress (pp. 1019–1025), June 1988.

  14. Hendling, K., Franzi, G., Statovci-Halimi, B., & Halimi, A. (2003). Residual network and link capacity weighting for efficient traffic engineering in MPLS networks. In Proceedings of the ITC (pp. 51–60), September–October 2003.

  15. Jain, K., Padhye, J., Padmanabhan, V. N., & Qiu, L. (2003). Impact of interference on multi-hop wireless network performance. In Proceedings of the MobiCom (pp. 66–80), September 2003.

  16. Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In T. Imielinski & H. Korth (Eds.), Mobile computing (pp. 153–181) Dordrecht: Kluwer.

    Chapter  Google Scholar 

  17. Kodialam, M. S., & Lakshman, T. V. (2000). Minimum interference routing with applications to MPLS traffic engineering. In Proceedings of the IEEE INFOCOM (Vol. 2, pp. 884–893), March 2000.

  18. Chiu, C. Y., Kuo, Y. L., Wu, H. K., & Chen, G. H. (2006). Bandwidth constrained routing problem in multi-hop wireless networks. In Proceedings of the ACM/IEEE MSWIM, October 2006.

  19. Ma, Q., Steenkiste, P., & Zhang, H. (1996). Routing high-bandwidth traffic in max-min fair share networks. ACM Computer Communication Review, 26(4), 206–217.

    Article  Google Scholar 

  20. Ma, Q., & Steenkiste, P. (1997). On path selection for traffic with bandwidth guarantees. In Proceedings of the IEEE ICNP (pp. 191–202), October 1997.

  21. Orda, A. (1999). Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Transactions on Networking, 7(3), 365–374.

    Article  Google Scholar 

  22. Park, V. D., & Corson, M. S. (1997). A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of the IEEE INFOCOM (pp. 1405–1413), April 1997.

  23. Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the SIGCOMM (pp. 234–244), August–September 1994.

  24. Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on demand distance vector routing. In Proceedings of the IEEE WMCSA (pp. 90–100), February 1999.

  25. Rappaport, T. S. (2002). Wireless communications: principles and practice. New York: Prentice Hall.

    Google Scholar 

  26. Sobrinho, J. L. (2001). Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. In Proceedings of the IEEE INFOCOM (pp. 727–735), April 2001.

  27. Tang, J., Xue, G., & Zhang, W. (2005). Interference-aware topology control and qos routing in multi-channel wireless mesh networks. In Proceedings of the MobiHoc (pp. 68–77), May 2005.

  28. Wang, B., Su, X., & Chen, C. L. P. (2002). A new bandwidth guaranteed routing algorithm for MPLS traffic engineering. In Proceedings of the IEEE ICC (pp. 1001–1005), April–May 2002.

  29. Wang, Z., & Crowcroft, J. (1996). Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 14(7), 1228–1234.

    Article  Google Scholar 

  30. Xue, Q., & Ganz, A. (2003). Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks. Journal of Parallel and Distributed Computing, 63(2), 154–165.

    Article  Google Scholar 

  31. Shen, S. H., Ding, J. W., & Huang, Y. M. (2008). A cross-layer design for heterogeneous routing in wireless mesh networks. International Journal of Pervasive Computing and Communications, 4, 40–49.

    Article  Google Scholar 

  32. Shen, S. H., Ding, J. W., & Huang, Y. M. (2005). A cross-layer approach to heterogeneous interoperability in wireless mesh networks. In Lecture notes in computer science (Vol. 3824, 651–662). Berlin: Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chia-Cheng Hu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, CC., Kuo, YL., Chiu, CY. et al. Maximum bandwidth routing and maximum flow routing in wireless mesh networks. Telecommun Syst 44, 125–134 (2010). https://doi.org/10.1007/s11235-009-9217-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9217-2

Navigation