Fair bandwidth allocation and end-to-end delay routing algorithms for wireless mesh networks

被引:4
作者
Wen, Yean-Fu [1 ]
Lin, Yeong-Sung Frank [1 ]
机构
[1] Natl Taiwan Univ, Dept Informat Management, Taipei, Taiwan
关键词
delay; fairness; mixed-integer nonlinear programming; performance; wireless networks;
D O I
10.1093/ietcom/e90-b.5.1042
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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%.
引用
收藏
页码:1042 / 1051
页数:10
相关论文
共 15 条
[1]  
[Anonymous], 2005, ELSEVIER J COMPUTER, DOI DOI 10.1016/J.COMNET.2004.12.001
[2]  
[Anonymous], 2004, MobiCom'04'- Proceedings of the 10th annual international conference on Mobile computing and networking
[3]   Mesh networks: Commodity multihop ad hoc networks [J].
Bruno, R ;
Conti, M ;
Gregori, E .
IEEE COMMUNICATIONS MAGAZINE, 2005, 43 (03) :123-131
[4]  
Dai H, 2003, GLOB TELECOMM CONF, P548
[5]  
Gambiroza V., 2004, MOBICOM 04, P287, DOI DOI 10.1145/1023720.1023749.ISBN
[6]  
Hsiao PH, 2001, IEEE INFOCOM SER, P986, DOI 10.1109/INFCOM.2001.916291
[7]   A DISTRIBUTED ALGORITHM FOR MINIMUM WEIGHT DIRECTED SPANNING-TREES [J].
HUMBLET, PA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (06) :756-762
[8]  
Jain R., 1984, DEC Research Report TR-301
[9]   The nominal capacity of wireless mesh networks [J].
Jun, JG ;
Sichitiu, ML .
IEEE WIRELESS COMMUNICATIONS, 2003, 10 (05) :8-14
[10]   Enabling large-scale wireless broadband: The case for TAPs [J].
Karrer, R ;
Sabharwal, A ;
Knightly, E .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (01) :27-32