Routing with Load-Balancing in Multi-Radio Wireless Mesh Networks

Ngoc, Le Anh; Kum, Dong-Won; Cho, You-Ze; Toh, C.-K.

doi:10.1587/transcom.e92.b.700

Cited by 18 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among the path-based scheme LARM [16] performs much better than TeXCP [15]. The parameters throughput, packet delivery ratio are high in LARM.…”

Section: Discussionmentioning

confidence: 99%

“…In node scheduling [1,12,10,16], also known as broadcast scheduling, the entities scheduled are the nodes itself. The transmission of a node must be received by all of the neighbouring nodes collision free.…”

Section: Scheduling 31 Overviewmentioning

confidence: 99%

“…A distributed approach relies on the assumption that all the mesh routers in the network will co-operate [4,6,12,16]. Each MR itself decides whether to send or hold off the packets and to give opportunity to send to other MR.…”

Section: Scheduling Mechanismsmentioning

confidence: 99%

“…LARM [16], routing metric is proposed for multi radio mesh networks. This metric is incorporated into load balancing routing protocol, called LBM.…”

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

See 3 more Smart Citations

Analysis on Scheduling and Load Balancing Techniques in Wireless Mesh Networks

Joseph¹,

Princy²

2012

IJCA

View full text Add to dashboard Cite

The Wireless Mesh Network (WMN) has become the focus of much research since they allow increased network coverage, low cost and easy deployment. WMN includes the Internet Gateways (IGW), mesh routers and mesh clients forming a three layer architecture. Throughput and fairness are major issues in WMN as the network needs to satisfy increasing network demands and must be fair to all the clients requesting the demand. The gateway may become a bottleneck as all the traffic in WMN is routed to and from the gateway. All these above factors affect the performance of network. Thus the scheduling and load-balancing have become main challenges in WMN. Several scheduling and load balancing schemes have been discussed in this paper. Two scheduling models explored are interference-based and tree-based. Four load balancing schemes discussed are path-based, gateway-based and mesh-router-based. General TermsWireless mesh networks (WMN), throughput, fairness.

show abstract

“…Among the path-based scheme LARM [16] performs much better than TeXCP [15]. The parameters throughput, packet delivery ratio are high in LARM.…”

Section: Discussionmentioning

confidence: 99%

Section: Scheduling 31 Overviewmentioning

confidence: 99%

Section: Scheduling Mechanismsmentioning

confidence: 99%

“…LARM [16], routing metric is proposed for multi radio mesh networks. This metric is incorporated into load balancing routing protocol, called LBM.…”

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

See 2 more Smart Citations

Analysis on Scheduling and Load Balancing Techniques in Wireless Mesh Networks

Joseph¹,

Princy²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…일반적으로 무선 메쉬 네트워크는 그림 1과 방식이 유리하다 [7] . Wireless Mesh Networks) [9] , WCETT-LB (WCETT Load Balancing) [10] …”

unclassified

An Enhanced-WCETT Routing Metric based on Available Bandwidth and Traffic Load in Wireless Mesh Networks

Lee¹,

Hwang²,

Yoo³

2012

The Journal of Korea Information and Communications Society

View full text Add to dashboard Cite

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

show abstract