TY - GEN
T1 - Transport-level fairness provisioning in wireless local area networks with hidden stations
AU - Nishide, Koichi
AU - Kubo, Hiroyuki
AU - Shinkuma, Ryoichi
AU - Takahashi, Tatsuro
PY - 2009
Y1 - 2009
N2 - In wireless local area networks (WLANs), the demand of the multimedia applications such as voice telephony and peer-to-peer content distribution has followed the necessity of quality-of-service (QoS) control for uplink flows. However, in uplink WLANs, the hidden-station problem causes difficulties in the QoS control because of unfair collision probability. In this paper, we point out this hidden-station problem and clarify the following unfairness between user datagram protocol (UDP) and transmission control protocol (TCP) uplink flows: 1) the effect of collision caused by hidden-station relationship on throughput and 2) the instability of the throughput depending on the number of hidden stations. To solve these problems, we propose a mechanism that first groups stations according to the hidden-station relationship and type of transport protocol they use then assigns a transmission permitted period to each group. Our proposed mechanism eliminates the collisions between hidden stations and provides a flexible control over bandwidth allocation to UDP and TCP. Its performance is shown through simulation.
AB - In wireless local area networks (WLANs), the demand of the multimedia applications such as voice telephony and peer-to-peer content distribution has followed the necessity of quality-of-service (QoS) control for uplink flows. However, in uplink WLANs, the hidden-station problem causes difficulties in the QoS control because of unfair collision probability. In this paper, we point out this hidden-station problem and clarify the following unfairness between user datagram protocol (UDP) and transmission control protocol (TCP) uplink flows: 1) the effect of collision caused by hidden-station relationship on throughput and 2) the instability of the throughput depending on the number of hidden stations. To solve these problems, we propose a mechanism that first groups stations according to the hidden-station relationship and type of transport protocol they use then assigns a transmission permitted period to each group. Our proposed mechanism eliminates the collisions between hidden stations and provides a flexible control over bandwidth allocation to UDP and TCP. Its performance is shown through simulation.
UR - http://www.scopus.com/inward/record.url?scp=77952823453&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952823453&partnerID=8YFLogxK
U2 - 10.1109/PIMRC.2009.5449805
DO - 10.1109/PIMRC.2009.5449805
M3 - Conference contribution
AN - SCOPUS:77952823453
SN - 9781424451234
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
SP - 1158
EP - 1162
BT - 2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
Y2 - 13 September 2009 through 16 September 2009
ER -