TY - GEN
T1 - A cross-layer link adaptation algorithm for IEEE 802.11 WLAN with multiple nodes
AU - Wang, Chiapin
AU - Lin, Tsungnan
PY - 2008
Y1 - 2008
N2 - IEEE 802.11 Wireless Local Area Network (WLAN) PHYsical Layer (PHY) offers multiple data rates. In multi-rate WLANs, 802.11 Distributed Coordination Function (DCF) presents the phenomenon so called "performance anomaly": when some hosts transmit at lower data rates, throughput of others at high rates will be restricted within the lowest rate, leading to the degradation of overall performance. Therefore, the link adaptation scheme for 802.11 WLAN should consider not only throughput of the observed host but also system throughput in order to optimize the overall performance. In this paper we propose a cross-layer link adaptation algorithm which improves system throughput by regarding the situation of PHY rate degradation more thoughtfully and critically, and meanwhile compensates the throughput of hosts with bad link qualities by applying differentiated channel access parameters. Simulation results demonstrate the effectiveness of the propose algorithm.
AB - IEEE 802.11 Wireless Local Area Network (WLAN) PHYsical Layer (PHY) offers multiple data rates. In multi-rate WLANs, 802.11 Distributed Coordination Function (DCF) presents the phenomenon so called "performance anomaly": when some hosts transmit at lower data rates, throughput of others at high rates will be restricted within the lowest rate, leading to the degradation of overall performance. Therefore, the link adaptation scheme for 802.11 WLAN should consider not only throughput of the observed host but also system throughput in order to optimize the overall performance. In this paper we propose a cross-layer link adaptation algorithm which improves system throughput by regarding the situation of PHY rate degradation more thoughtfully and critically, and meanwhile compensates the throughput of hosts with bad link qualities by applying differentiated channel access parameters. Simulation results demonstrate the effectiveness of the propose algorithm.
UR - http://www.scopus.com/inward/record.url?scp=67049114251&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67049114251&partnerID=8YFLogxK
U2 - 10.1109/APSCC.2008.136
DO - 10.1109/APSCC.2008.136
M3 - Conference contribution
AN - SCOPUS:67049114251
SN - 9780769534732
T3 - Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
SP - 1162
EP - 1167
BT - Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
PB - IEEE Computer Society
T2 - 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
Y2 - 9 December 2008 through 12 December 2008
ER -