| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] |
¡@
JENG-FARN LEE AND YUAN-NENG HSU
Department of Computer Science and Information Engineering
National Chung Cheng University
Chiayi, 621 Taiwan
E-mail: jflee@cs.ccu.edu.tw
In this paper, we consider the fairness problem for Transit Access Points (TAP) in
multi-hop wireless backhaul networks. Existing approaches have implementation issues,
such as the requirement for modifications to the MAC layer or queuing operations of
TAPs, limitations on the network topology, high packet loss rates and overheads, and difficulty
in measuring the effective link capacities between TAPs. To address these issues,
we propose an effective and practical approach that enforces fairness in wireless backhaul
networks by estimating the target sending rates for TAPs dynamically. We also extend our
approach to multi-rate, multi-weight, non-saturated and split wireless backhaul networks.
Moreover, to speed up the convergence time, we provide a good estimation for our approach¡¦s
initial sending rate based on the network topology and the transport layer protocol.
We evaluate the performance of proposed approach via ns-2 simulations. The results
demonstrate that the approach works well in various network topologies and
achieves a rapid convergence time.
Received November 10, 2009; revised February 12 & May 25, 2010; accepted July 6, 2010.
Communicated by Rong-Hong Jan.
* The primiary version of this work was published at ICST Qshine, Hong Kong, Jul. 2008 by Jeng-Farn Lee and
YuanNeng Hsu, ¡§Fairness in Multi-hop Wireless Backhaul Networks: A Dynamic Estimation Approach¡¨.