Skip to main content

Advertisement

Springer Nature Link
Log in

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In wireless mesh networks, the number of gateway nodes are limited, when the nodes access to the internet by fixed gateway node, different requirements of nodes lead to the dataflow shows heterogeneity. Many new routing metrics and algorithms existing in traditional wired networks and the Ad Hoc network, can not be directly applied to wireless mesh networks, so how to design a routing metric and algorithm which can dynamically adapt to current networks topology and dataflow changes, avoid bottleneck node, and select the most stable and least congestion link to establish a route is very important. In this paper, we presented a new dynamic adaptive channel load-aware metric (LAM) to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase Network Throughput.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Youssef, M., et al. (2014). Routing metrics of cognitive radio networks A survey. IEEE Communications Surveys and Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  2. Li, P., et al. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. INFOCOM 2012, pp. 100–108.

  3. Yen, Yun-Sheng, et al. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11–12), 2238–2250.

    Article  Google Scholar 

  4. Zhou, Liang, et al. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. IEEE Journal on Selected Areas in Communications, 29(7), 1358–1367.

    Article  Google Scholar 

  5. Vasilakos, A., et al. (2012). Delay tolerant networks: Protocols and applications. Baco Raton: CRC Press.

    Google Scholar 

  6. Vasilakos, Athanasios V., et al. (2003). Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 33(3), 297–312.

    Article  Google Scholar 

  7. Cianfrani, Antonio, et al. (2012). An OSPF-integrated routing strategy for QoS-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management, 9(3), 254–267.

    Article  Google Scholar 

  8. Spyropoulos, Thrasyvoulos, et al. (2010). Routing for disruption tolerant networks: taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  9. Vasilakos, A., et al. (1998). Evolutionary-fuzzy prediction for strategic QoS routing in broadband networks. The 1998 IEEE international conference on fuzzy systems proceedings (Vol, 2, pp. 1488–1493).

  10. Busch, Costas, et al. (2012). Approximating congestion + dilation in networks via “quality of routing” games. IEEE Transactions on Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  11. Zeng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  12. Hao, Z. (2012a). Forest topology generation algorithm based a metric in wireless mesh networks. In: Communications and information processing: International conference, ICCIP 2012, (pp. 163–170). Springer, Tiergartenstrasse 17, Heidelberg, 69121, Germany.

  13. Hao, Z. (2012b). Forest topology generation algorithm based a metric in wireless mesh networks. In: Communications and information processing–international conference, ICCIP 2012, (pp. 163–170). Springer, Tiergartenstrasse 17, Heidelberg, 69121, Germany.

  14. Cheng, Hongju, et al. (2012). Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760–773.

    Article  Google Scholar 

  15. Hao, Z. et al. (2011). Multi channel assignment based on channel separation for wireless Mesh network. In: 2011 IEEE 3rd International conference on communication software and networks (pp. 344–348). IEEE Computer Society, 445 Hoes Lane, P.O.Box 1331, Piscataway, NJ 08855-1331, United States (2011).

Download references

Author information

Authors and Affiliations

  1. Hubei Urban Construction Vocational and Technical College, Hubei, 430075, China

    Zimian Hao & Yingxia Li

Authors
  1. Zimian Hao
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yingxia Li
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zimian Hao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hao, Z., Li, Y. An adaptive load-aware routing algorithm for multi-interface wireless mesh networks. Wireless Netw 21, 557–564 (2015). https://doi.org/10.1007/s11276-014-0804-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0804-0

Keywords