TY - GEN
T1 - Practical and efficient open-loop rate/link adaptation algorithm for high-speed IEEE 802.11n WLANs
AU - Xia, Qiuyan
AU - Pu, Jian
AU - Hamdi, Mounir
AU - Letaief, Khaled Ben
PY - 2009
Y1 - 2009
N2 - In this paper, we propose a new open-loop rate/link adaptation algorithm (ARFHT) for the emerging high-speed IEEE 802.11n WLANs. ARFHT extends the legacy rate adaptation algorithms for SISO WLANs to make it applicable in the context of MIMO-based 802.11n WLANs. It adapts the MIMO mode in terms of spatial multiplexing and spatial diversity, the two fundamental characteristics of the 802.11n MIMO PHY. It also modifies the link estimation and probing behavior of legacy SISO algorithms. The combined adaptation to the appropriate MIMO mode as well as the appropriate modulation coding scheme selection achieves high channel utilization. In this paper, we provide the intuition and the design details of the ARFHT algorithm. A comprehensive simulation study using ns-2 will demonstrate that ARFHT achieves excellent throughput performance in most scenarios and is highly responsive to varying link conditions, with minimum overhead.
AB - In this paper, we propose a new open-loop rate/link adaptation algorithm (ARFHT) for the emerging high-speed IEEE 802.11n WLANs. ARFHT extends the legacy rate adaptation algorithms for SISO WLANs to make it applicable in the context of MIMO-based 802.11n WLANs. It adapts the MIMO mode in terms of spatial multiplexing and spatial diversity, the two fundamental characteristics of the 802.11n MIMO PHY. It also modifies the link estimation and probing behavior of legacy SISO algorithms. The combined adaptation to the appropriate MIMO mode as well as the appropriate modulation coding scheme selection achieves high channel utilization. In this paper, we provide the intuition and the design details of the ARFHT algorithm. A comprehensive simulation study using ns-2 will demonstrate that ARFHT achieves excellent throughput performance in most scenarios and is highly responsive to varying link conditions, with minimum overhead.
UR - http://www.scopus.com/inward/record.url?scp=70449511952&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2009.5202283
DO - 10.1109/ISCC.2009.5202283
M3 - Conference contribution
AN - SCOPUS:70449511952
SN - 9781424446711
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 661
EP - 666
BT - IEEE Symposium on Computers and Communications 2009, ISCC 2009
T2 - IEEE Symposium on Computers and Communications 2009, ISCC 2009
Y2 - 5 July 2009 through 8 July 2009
ER -