Fair Bandwidth Allocation and End-to-End Delay Routing Algorithms for Wireless Mesh Networks

Yean-Fu WEN  Yeong-Sung (Frank) LIN  

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B   No.5   pp.1042-1051
Publication Date: 2007/05/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.5.1042
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Advanced Transfer Technologies for the Next Generation Network)
Category: 
Keyword: 
delay,  fairness,  mixed-integer nonlinear programming,  performance,  wireless networks,  

Full Text: PDF>>
Buy this Article




Summary: 
Quality-of-service (QoS) is essential for multimedia applications, such as video-conferencing and voice over IP (VoIP) services, in wireless mesh networks (WMNs). A consequence of many clients accessing the Internet via the same backhaul is that throughput depends on the number of hops from the backhaul. This spatial bias problem is formulated as a mixed-integer nonlinear programming problem that considers end-to-end delay in terms of gateway selection, least-hop and load-balanced routing, and link capacity constraints. In this paper, we propose a routing algorithm for the network layer and a bandwidth allocation scheme for the medium access control (MAC) layer. The latter achieves fairness in both throughput and end-to-end delay in orthogonal mesh backbone networks with a distributed scheme, thereby minimizing the objective function. Our experiment results show that the proposed algorithm achieves throughput fairness, reduces end-to-end delay, and outperforms other general schemes and algorithms by at least 10.19%.