Hop-Count Based Congestion-Aware Multi-path Routing in Wireless Mesh Network

In recent years, wireless mesh network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, simplicity in installation and robustness in operation. However, existing routing protocols designed for MANET can not work efficiently in WMN because backbone in WMN formed by Mesh Router has very low mobility and are not put under power and memory constraint. In addition, they just concentrate on finding single path from the source to the destination while the characteristics of robustness of WMN require that every intermediate Mesh Router should establish several paths from itself to its desired destination. In our paper, we design a routing protocol that permits each MR to quickly discover multiple paths based on Hop Count metric to the Internet Gateways. Unfortunately, Hop Count does not take packet loss or bandwidth into account. It results in low throughput of a flow that follows the shortest path. A bandwidth estimation technique has been proposed to apply at each Mesh Router to allow it to predict congestion risk over its connected links and to select high available bandwidth link for forwarding packets. A detailed performance evaluation shows that the throughput increases greatly compared to pure AODV and AOMDV in high-loaded traffic scenario.

[1]  Robin Kravets,et al.  Contention-aware admission control for ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[2]  Robin Kravets,et al.  Designing routing metrics for mesh networks , 2005 .

[3]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[4]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[5]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[6]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[7]  Wendi B. Heinzelman,et al.  QoS-aware routing based on bandwidth estimation for mobile ad hoc networks , 2005, IEEE Journal on Selected Areas in Communications.

[8]  Robin Kravets,et al.  Interference-aware Load Balancing for Multihop Wireless Networks , 2005 .

[9]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[10]  Jitendra Padhye,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004, SIGCOMM 2004.

[11]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[12]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[13]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[14]  Hongqiang Zhai,et al.  TCP performance over mobile ad hoc networks , 2004, Canadian Journal of Electrical and Computer Engineering.

[15]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[16]  Kevin C. Almeroth,et al.  Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.