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

Yean-Fu WEN; Yeong-Sung (Frank) LIN

doi:10.1093/ietcom/e90-b.5.1042

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

Yean-Fu WEN, Yeong-Sung (Frank) LIN

Full Text Views

0

Cite this

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%.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.5 pp.1042-1051

Publication Date: 2007/05/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.5.1042

Type of Manuscript: Special Section PAPER (Special Section on Advanced Transfer Technologies for the Next Generation Network)

Category

Cite this

Copy

Yean-Fu WEN, Yeong-Sung (Frank) LIN, "Fair Bandwidth Allocation and End-to-End Delay Routing Algorithms for Wireless Mesh Networks" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 5, pp. 1042-1051, May 2007, doi: 10.1093/ietcom/e90-b.5.1042.
Abstract: 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%.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.5.1042/_p

Copy

@ARTICLE{e90-b_5_1042,
author={Yean-Fu WEN, Yeong-Sung (Frank) LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair Bandwidth Allocation and End-to-End Delay Routing Algorithms for Wireless Mesh Networks},
year={2007},
volume={E90-B},
number={5},
pages={1042-1051},
abstract={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%.},
keywords={},
doi={10.1093/ietcom/e90-b.5.1042},
ISSN={1745-1345},
month={May},}

Copy

TY - JOUR
TI - Fair Bandwidth Allocation and End-to-End Delay Routing Algorithms for Wireless Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1042
EP - 1051
AU - Yean-Fu WEN
AU - Yeong-Sung (Frank) LIN
PY - 2007
DO - 10.1093/ietcom/e90-b.5.1042
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2007
AB - 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%.
ER -