A High-Throughput MAC Strategy for Next-Generation WLANs

Transcription

1 A High-Throughput MAC Strategy for Next-Generation WLANs Seongkwan Kim Youngsoo Kim Sunghyun Choi Multimedia & Wireless Networking Laboratory Seoul National University Kyunghun Jang Jin-Bong Chang Communication & Network Laboratory Samsung Advanced Institute of Technology Abstract Today, IEEE 82. Wireless LAN (WLAN) has emerged as a prevailing technology for the broadband wireless networking. Along with many emerging applications and services over WLANs, the demands for faster and highercapacity WLANs have been growing fast. In this paper, we propose a new medium access control (MAC) scheme for the next-generation high-speed WLANs such as IEEE 82.n. The proposed MAC, called Multi-user polling led Channel Access (MCCA), is composed of two sub-schemes. The first one is multi-user polling in order to achieve higher network utilization. We also introduce a frame aggregation scheme as the another proposed scheme, which performs aggregations at both MAC and physical (PHY) layers, and can achieve even higher throughput gain as a result. From simulations, we confirm that the proposed MCCA scheme enhances the aggregate throughput of non-qualityof-service (non-qos) traffic by an order of magnitude from 7.4 Mbps to 29.9 Mbps, while the aggregate throughput and QoS requirements continue to be satisfied.. Introduction In recent years, IEEE 82. Wireless LAN (WLAN) has gained a prevailing position in the market for the (indoor) broadband wireless access networking. The IEEE 82. standard defines the medium access control (MAC) layer and the physical (PHY) layer specifications []. ue to the contention-based channel access nature of the mandatory channel access function (i.e., distributed coordination function or CF), it supports only the best-effort service without guaranteeing any quality-of-service (QoS). The new MAC protocol of the 82.e is called the Hybrid Coordination Function (HCF), which will provide QoS [3, 8, 9, ]. The standardization of the IEEE 82.e is still on-going at the final stage. The HCF contains a contentionbased channel access mechanism (referred to as Enhanced istributed Channel Access or ECA) and a centralized channel access mechanism, namely, HCF led Channel Access (HCCA). Recently, the needs for real-time services, such as Voice over IP (VoIP) over WLANs have been increasing drastically. ue to such fast-growing demands, the market, where IEEE 82.b has gained its wide deployment base so far, is switching to new IEEE 82.g-based products supporting up to 54 Mbps [4]. This kind of trend, i.e., growing demands for higher-speed WLANs, will be accelerated further along with the evolution of the wired counterparts, e.g., or Gbit Ethernets. IEEE 82. Task Group N (TGn) has been initiated in September 23 for a high-speed WLAN to provide a maximum throughput of at least Mbps measured at the MAC data service access point (SAP) [7]. This group will generate a high-speed WLAN standard called IEEE 82.n in the future. Currently, many different technical solutions covering both PHY and MAC are being proposed for the new protocol architecture within TGn [6]. The 82. is known to have a high overhead for the MAC/PHY operations such as PHY preamble/header, MAC header, acknowledgment, and backoff procedures, thus yielding the throughput performance much worse than the underlying PHY transmission rate. In [], Yang and Jon demonstrate that by simply increasing the PHY rate without reducing the MAC/PHY overhead, the enhanced throughput is bounded under Mbps, even if the PHY rate goes to infinity. It means that we need to enhance the 82. MAC by reducing overheads in order to create the next-generation highspeed WLAN. In this paper, we propose a new MAC scheme, called Multi-user polling led Channel Access (MCCA), which is composed of two schemes including multi-user polling and two-level frame aggregation. The proposed scheme reduces the protocol overheads by eliminating the backoff process via an efficient multi-user polling and reducing the MAC/PHY header overheads via frame aggregation at both MAC and PHY. From simulations, we confirm that the proposed MCCA achieves our design goal by significantly improving throughput performance.

2 2. Related Work Under the 82. PCF or the 82.e HCCA, each station transmits frames upon being polled. Apparently, pollframe transmissions can be another type of overhead. The number of poll-frames can be reduced by using multi-user polling, and it can enhance wireless channel utilization. Shou-Chih Lo et al. proposed a multi-user polling mechanism for WLAN [2]. Their approach is mainly focused on supporting QoS traffic in order to satisfy the QoS requirement under the CF environment. However, if one uses the emerging 82.e ECA, the QoS traffic can be supported more effectively. In high-speed environment, the effect of overheads mentioned Section increases since these overheads are fixed irrespective of the transmission rate. According to [3], high throughput performance can be achieved via frame aggregation, though the aggregation is performed at the device driver level. However, only the frames with the same destination and the same kind of traffic can be aggregated in [3]. It is surely desired to apply the aggregation of frames with different destination addresses, i.e., downlink frames transmitted from access point (AP) to stations. As it will be mentioned in Section 3, the AP s downlink access is very important since its performance could be a bottleneck of the entire network performance. In order to achieve highly efficient aggregate throughput, the aggregation of frames with different destinations should be supported. 3. Baseline MAC Protocols In this section, we briefly describe how 82.e ECA works since the proposed MCCA works on top of ECA. The IEEE 82.e ECA is designed to provide differentiated, distributed channel accesses for frames with 8 different user priorities by enhancing the CF [3]. Each frame from the higher layer arrives at the MAC along with a specific priority value (ranging from to 7). Then, each QoS data frame carries its priority value in the QoS field of the MAC frame header. An 82.e STA shall implement four channel access functions, where a channel access function is an enhanced variant of the CF. Each frame arriving at the MAC with a user priority is mapped into an access category (AC). Basically, a channel access function uses AIFS 2 [AC], CWmin[AC], and CWmax[AC] instead of IFS, CWmin, and CWmax, of the CF, respectively, for the contention process to transmit a frame belong to access category AC. AIFS[AC] is determined by AIF S[AC] = + AIF SN[AC] SlotTime We assume the 82.a PHY in this paper because the target of our scheme is the next-generation high-speed WLAN such as TGn. 2 AIFS : Arbitration Interframe Space [3] where AIFSN[AC] is an integer greater than for STAs and an integer greater than for access points (APs). The backoff counter is selected from [, CW[AC]]. The values of AIFSN[AC], CWmin[AC], and CWmax[AC], which are referred to as the ECA parameter set, are advertised by the AP via Beacons and Probe Response frames. The AP can adapt these parameter dynamically depending on the network condition. Basically, the smaller AIFSN[AC] and CWmin[AC], the shorter the channel access delay for the corresponding priority, and hence the more capacity share for a given traffic condition. However, the collision probability increases when operating with smaller CWmin[AC]. These parameters can be used in order to differentiate the channel access among different priority traffic. IEEE 82.e ECA also provides a new channel access method called Transmission Opportunity (TXOP), which is an interval of time when a particular STA has the right to initiate frame exchange sequences onto the wireless medium. A TXOP is defined by a starting time and a maximum duration. The TXOP is either obtained by the STA by successfully contending or is assigned by the AP. It should be also noted that the AP can use the ECA parameter values different from the announced ones for the same AC. The 82. CF originally is designed to provide a fair channel access to every station including the AP. However, since typically there is more downlink (i.e., AP-to-stations) traffic than uplink (i.e., stations-to- AP), AP s downlink access has been known to be the bottleneck to the entire network performance. Accordingly, ECA, which allows the differentiation between uplink and downlink channel accesses, can be very useful to control the network performance. The traffic identifier (TI) of a frame is a label, which specifies the corresponding QoS requirements. There are 6 possible TI values, where the values from to 7 specify the user priority value of a frame, and the values from 8 to 5 specify the traffic stream which the frame belongs to. The TI value is specified in the QoS field (from bit to bit 3) of the 82.e QoS data frame s MAC header. In Section 5., we use TI value in the proposed MCCA in order to aggregate frames with different TIs. In order to improve the MAC efficiency, a new acknowledgment scheme, called Block Ack (BA), is defined in IEEE 82.e. The scheme basically works as follows: during a TXOP, a STA (or AP) can transmit a number of frames without receiving any Ack. After all the frame transmissions within the TXOP are completed, the STA (or AP) sends a control frame, called Block Ack Request (BAR). The receiving STA (or AP) of the BAR should respond with BA 3. 3 There are two types of Block Ack procedures in 82.e, which are Immediate and elayed Block Ack. The former is explained here.

3 MAC Header MSU F C A:TI S MAC Protocol ata Unit (MPU) MAC Header MSU F C A:TI S MAC Header MSU F C A:TI2 S MAC Header MSU F C A2:TI S Octets: ~ Address 3 Sequence Address 4 Body FCS Aggregate PHY Service ata Unit () Figure 2. Type- compressed header data M ATA MPU M CHATA - MPU M CHATA - 2 MPU M ATA MPU Aggregate PHY Protocol ata Unit (PPU) / P Header rate P basic rate rate 2 Figure. Two-level frame aggregation Octets: ~ Address 3 Sequence Address 4 QoS Body Figure 3. Type-2 compressed header data FCS 4. Underlying PHY Model The purpose of this paper is to enhance aggregate throughput and network channel utilization. As mentioned in Section, the overheads such as PHY preamble/header, MAC header, ACK, and backoff procedure should be reduced in order to achieve the goal. Moreover, we also consider faster PHY technology to achieve more than Mbps throughput gain at the MAC SAP which is one of the goals of the 82. TGn. Accordingly, we assume Multiple Input Multiple Output (MIMO) technology as the underlying PHY model. MIMO is one of the underlying PHY schemes being considered for 82. TGn. However, MIMO is considered as the dominant technology of the next-generation WLAN in the nearest time 4. In this paper, we assume that the PHY model uses 2 2 MIMO, which can provide 2 times faster transmission rate than 82.a PHY. In addition, we assume that our PHY in consideration uses multiple channel bonding scheme. That is, two 82.a channels (of 2 MHz) are combined together, and the bonded channel of 4 MHz is used for the communications. Therefore, we can achieve 2 times faster rate due to this bonding scheme. Accordingly, if we employ both 2 2 MIMO and two channel bonding schemes, the PHY transmission rate, which is 4 times faster than that of 82.a PHY (i.e., up to 26Mbps), can be achieved. 5. Multi-user polling led Channel Access (MCCA) In this paper, we propose two MAC schemes to enhance network utilization and maximize aggregate throughput, namely, two-level frame aggregation and multi-user polling. The name of MCCA, i.e., Multi-user polling Con- 4 At the last 82. TGn meeting on Sep. 24, while there are 36 proposals offered as how 82.n will look eventually, all the proposals use MIMO. trolled Channel Access, is coined from the access manner to the wireless channel of our scheme. 5.. Two-Level Aggregation As part of MCCA, we employ a two-level frame aggregation scheme, which is composed of two types of hierarchical aggregations, namely, aggregate PHY Service ata Unit () and aggregate PHY Protocol ata Unit (PPU) schemes. Proposed aggregation schemes are performed at both MAC and PHY layers, respectively, according to the characteristics of the aggregated frames, such as the destination address and TI. Fig. illustrates how the proposed two-level aggregation works. Multiple MPUs addressed to the same STA are aggregated into an aggregate. Each aggregated MPU follows a MPU elimiter (M), which plays a role to robustly delimit the MPUs within the aggregate. An M is composed of several fields including Unique pattern, CRC, and MPU length. The aggregate is for a single destination. The first case of the aggregate scheme is as follows. If there are buffered data MPUs with the same destined address and the same TI, they can be aggregated into a. The first data MPU has the legacy MAC header, and the subsequent MPUs use the format of CHATA-, i.e., Type- Compressed Header ATA, and the format of this new frame is illustrated in Fig. 2. Because all the MPUs are separated by M, the receiving high throughput STA (HT STA) 5 can recognize the existence of another MPU after the M. The CHATA- header should be rebuilt based on the first MPU s MAC header by the receiver. If there are buffered data MPUs with the same destination address, but different TIs, they can also be aggregated into a, and this type of aggregation is the second case of the aggregate. The rule to make an aggregate is the same as the first case mentioned 5 We refer a STA, which supports the MCCA proposed in this paper, to as an HT STA.

4 above, except for the compressed header format, i.e., Type- 2 Compressed Header ATA (CHATA-2) is used instead of legacy MAC header for the subsequent MPUs. The format of CHATA-2 header is shown in Fig. 3. In this CHATA-2 header, QoS field is needed since MSUs contained in this MPU have different TIs. Similar to the operation for receiver to rebuild the CHATA- header, the CHATA-2 header should be rebuilt on the equivalent way by receiver. For the composite case of the above two cases, i.e., there are buffered data MPUs with the same and different TIs, MPUs which have either CHATA- or CHATA- 2 headers can be aggregated into a. In this case, the first MPU should have the legacy MAC header and it should be referenced for rebuilding the MAC header of CHATA- and CHATA-2 MPUs. Fig. is an example of this case of aggregate. Apparently, with the header compression scheme, we can use channel bandwidth more efficiently and transmit more data during a fixed channel access opportunity. The second-level aggregation, referred to an aggregate PPU, can be applied if there are buffered s with different destination addresses. With the aggregate PPU scheme, the buffered s can be aggregated into a PPU without additional preambles as shown in Fig.. If a number of s are aggregated into a PPU, elimiters (Ps) with own unique patterns precede each aggregate, and this allows to transmit each at a different rate according to the optimal rate of the destined HT STA. A P should be transmitted at the basic rate, i.e., 6 Mbps of the 82.a PHY, in order for all the HT STAs to be able to decode it. There is a limit of aggregate PPU. According to the 82.a, the in a PPU has Length (of 2 bits) and Rate (of 4 bits) fields in the legacy SIGNAL field. The Length and Rate fields are virtually set in order to cover the duration of the PPU. The length of an aggregate PPU is limited so that its duration may not exceed 5.46 milliseconds, because the maximum duration of the PPU in 82.a is 5.46 millisecond, which can be derived from the maximum length (495 bytes) divided by the lowest rate (6 Mbps). In other words, an aggregate PPU can spoof only the duration up to 5.46 milliseconds. Basically, we assume the infrastructure mode of the IEEE 82. because a kind of controlled channel access scheme is proposed in our scheme. Accordingly, there are two different directions of data transmission, i.e., uplink and downlink and the policies, which the proposed two-level aggregation scheme is applied, are different depending on the transmission direction. In an uplink phase (U/L), in which uplink data is transmitted, an HT STA gaining access to the channel can transmit a PPU containing an aggregate destined to HT AP. In this phase, HT STAs octets : 2 2 ur/i 6 BSSI 2 /L U/L Count(n) Count(m) 2 5 * n Figure 4. Format of MP-frame 4 * m /L MAP U/L MAP FCS may transmit more than one aggregate s after if the transmission is finished within a given TXOP limit. However, the aggregate PPU scheme cannot be used for this phase because the destination of a HT STA is always the AP. On the other hand, HT AP can utilize the aggregate PPU scheme as well as the aggregate for the downlink phase (/L) when the controlled access scheme is used, which will be explained in detail in the next subsection Multi-user Polling As the second part of MCCA, we propose a controlled channel access scheme, based on multi-user polling. Our multi-user polling scheme, which we referred to as multipolling, has the advantages of high channel utilization. One of the main features of our multi-user polling is that, unlike PCF and HCCA, it can deal with downlink traffic streams during the controlled access period. Moreover, a modified hybrid coordinator (HC) 6 in our scheme can send multiple polls at the same time. To support these new and intelligent features, the format of the multiple poll frame, namely, MP-frame, should be designed well. Fig. 4 shows the format of MP-frame. The MP-frame provides the control of flows for /L and U/L within a service period. It conveys a number of /L MAPs and the number of U/L MAPs, where the MAPs handle the aggregation exchanges during a service period. The ur/i field is used to set a long NAV value to protect the service period as soon as the receipt of the MPframe at the legacy STAs associated to the HT AP. The /L Count field and U/L Count field, respectively, indicate the number of s in /L to be used by the HT AP and the number of HT STAs to have a transmission opportunity in U/L. They shall be referenced by /L MAP and U/L MAP fields which are successively repeated within the MP-frame. Fig. 5 illustrates how the overall access mechanism of multipolling works. Whenever an HT AP transmits an MPframe, it initiates a service period. The HT AP gains the access to the channel by transmitting an MP-frame after waiting for a PCF Interframe Space () idle time interval, which is shorter than IFS and any AIFS. When the STA receives the MP-frame, it sets the backoff counter to the appropriate value, that is implicitly assigned by AP in the MP- 6 HC is the new notion in the IEEE 82.e specification [3]. 4

5 dynamic TM collision-free CSMA/CA Within TXOP limit Within TXOP limit HT AP HT STA MP Aggregate Aggregate PPU Aggregate Aggregate TXOP Limit CF- EN HT AP MP- CF-EN HT STA HT STA2 2 Aggregate HT STA3 TXOP Limit HT STA2 IFS IFS 4 3 Non-polled (HT) STA4 NAV Service Period 2 ATA Figure 6. Example of MCCA Block Ack IFS IFS AIFS[AC] Figure 5. Multi-user polling operation frame according to the polling order. It is also possible that CF-End frame may be used when there is no more uplink traffic from the polled HT STAs, which this functionality is the same as that of PCF. uring a service period, AIFS is set to IFS irrespective of the AC of the frames being transmitted. For the /L, which starts immediately after the MPframe transmission with a deference, the aggregate PPU scheme is applied, and hence we referred to this /L as dynamic Time ivision Multiplexing (TM), because each HT STA receives a destined to itself at its receiving time. After the end of the /L, uplink transmission opportunity is handed over to the HT STA, whose backoff counter becomes zero. In this U/L, each HT STA follows ECA rule except that its backoff number is assigned from HC in advance with AIFS value set to IFS in all occasions. Within a TXOP of each HT STA scheduled via the U/L MAP, an HT STA can transmit multiple frames including one or more aggregate s consecutively. If an HT STA scheduled via the U/L MAP does not transmit any frame, the next scheduled HT STA can transmit after a backoff slot time according to the ECA channel access rule. An HC shall know the decrease of the backoff counters while the STAs transmit their data according to the U/L Count field in the MP-frame. The backoff counter of the last STA decreases from U/L Count value to zero eventually at the end of the service period. If the uplink transmission finishes and the service period remains enough to transmit the CF-End frame, then the HC sends the CF-End frame to inform both HT STAs and legacy STAs of the end of the multipoll operation before the originally-scheduled end of the service period. In a controlled channel access scheme such as PCF and MCCA, the whole network operation can be collapsed by hidden stations. The hidden station problem has been a inveterate obstacle in order for these centralized access schemes to operate smoothly until now. The emerging IEEE 82.k [5], however, defines hidden node report method using a hidden station detection scheme, which basically works as follows. First of all, if STA i detects a frame, which the AP transmits to STA j via downlink, but STA i cannot detect the corresponding Ack from STA j. If this happens persistently, 7 and STA i never receives any frame transmitted by STA j, STAi can conclude that STA j is hidden from itself. By using this mechanism, AP can manage the STA list, in which the STAs are not hidden each other. Accordingly, if we use 82.k hidden node report scheme described above in our MCCA scheme, our centralized channel scheme is getting more robust against hidden STAs. From now on, we assume that the proposed MCCA use the hidden node report scheme basically Error Recovery via Block Ack There can be transmission errors due to the unreliable channel behavior caused by background noise, fading, and so on. As we take into account an aggregation scheme as a major part of the proposed scheme, an Ack mechanism such as Block Ack, which is defined in IEEE 82.e, is needed. We propose a Block Ack mechanism which is appropriate in our MCCA scheme. We assume that the frame formats of proposed BA and BAR are identical to those defined in 82.e. However, the usage is different from the 82.e s. For example, the proposed BA is a delayed Ack for a number of aggregated transmitted frames, not one for a chain of frames, 82.e Block Ack. Our BA and BAR themselves can also be aggregated into an aggregate PPU frame or an aggregate frame. Therefore, we use the new term of MCCA Block Ack (MBA) and MCCA Block Ack Request (MBAR) to denote them in this paper. Fig. 6 shows an example of error recovery by the proposed MBA. After an MP-frame transmission and time interval, the HT AP transmits aggregated s destined to multiple HT STAs including an MBAR to each HT STA. By uplink transmission rule mentioned above, the first 7 Note that this can happen occasionally due to the channel error.

6 Table. Application Characteristics Application elay Bound Offered Load (msec) (Mbps) VoIP 3 msec.96 Video conferencing msec A/V streaming 2 msec 2 Internet file transfer N/A N/A Local file transfer N/A N/A Throughput (Mbps) ECA Internet streaming (2Mbps) Video conferencing (Mbps) VoIP (.96Mbps). HT STA transmits its own aggregated MPUs to the HT AP including an s for the aggregated MPUs from HT AP and an. As shown an example of Fig. 6, if some of MPUs are not received successfully, the HT STA informs the HT AP of these errors using the Block Ack Bitmap. If there are any error frames as shown in Fig. 6, the HT AP shall retransmit the frame with the corresponding MBAR. There is another example of the transmission error recovery procedure at the right side of Fig. 6. If an HT STA obtaining a channel access opportunity transmits aggregated MPUs and some errors occur, the HT AP shall inform the HT STA of the erroneous MPUs by using Block Ack bitmap like the first case error recovery operation as mentioned above. 6. Performance Evaluations In this section, we comparatively evaluate the performance of the IEEE 82.e ECA and our MCCA using the ns-2 simulator [4]. 6.. Simulation Environments For the simulation scenario, we use one of the models, called an Large Enterprise scenario, defined by TGn [7]. Three different types of traffic are considered for our simulation, namely, voice, video, and data. The voice traffic is modeled by a two-way constant bit rate (CBR) session according to G.7 codec. The video traffic is modeled by three kinds of applications, including video conferencing and the A/V Internet streaming. The data traffic is modeled by a unidirectional FTP/TCP flow to represent a file transfer. These traffic models are described in Table in detail. In the simulation, we use the 82.a parameters except the transmission rate. We assume that all the stations use the transmission rate of 26 Mbps, which can be achieved by MIMO-aware PHY techniques described in Section 4. With the Large Enterprise scenario, we compare the throughput performances of () ECA, (2) ECA with aggregate, and (3) MCCA. When we consider different types of QoS traffic including voice and video, only the packets Flow Number Figure 7. Throughput in Large Enterprise model which satisfy their corresponding delay bound, are counted to the aggregate throughput calculation. Basically, we assume that all the STAs are fully controlled by the HC in service periods, and hence that there is not any collision which can cause the transmission error. As mentioned in Section 5.3, however, other error sources such as RF interference, channel fading, and so on can exist. To take into account these erroneous conditions, we apply strict error model in which a system can suffer from errors per MPU-basis at a randomized and uniformly distributed rate. The ECA parameter set used for each traffic type are the default values defined in [3] Simulation Results and iscussion Fig. 7 presents the throughput performance of the ECA scheme. The first 3 flows are downlink flows and the other 3 flows are uplink flows. Each station has one downlink and one uplink flow, respectively, e.g., flow i and flow 3+i are for station i. A flow with zero throughput represents that there is no active flow. There are three kinds of QoS flows, which are indicated in Fig. 7. The remaining flows are non- QoS flows. In order to show the low throughput values more clearly, e.g., those of VoIP traffic, we use the logarithmic scale for the y-axis. From the simulation results, all of the QoS traffic flows are found to satisfy their QoS requirement with default ECA parameters. Fig. 8 shows the aggregate throughput performance of all three schemes. The proposed MCCA can achieve very high throughput performance. Approximately, 7.5-time larger aggregate throughput gain can be achieved by MCCA compared to ECA. This result is even higher than that of aggregate with 2.2-time gain, approximately.

7 4 2 ECA Aggregate MCCA 29.9 ECA Aggregate MCCA delay bound : delay bound : 2 delay bound : 3 Aggregate Throughput (Mbps) End-to-end elay (msec) QoS traffics non-qos traffics. VoIP Video Conferencing Streaming A/V Figure 8. Aggregate throughput performance Figure. Comparison of end-to-end delay ownlink AC_BE queue size (packet) AC_BE Time (sec) Figure 9. ownlink ECA queue status with aggregate scheme To evaluate the performance of our new MAC scheme, first of all, we compare aggregate scheme to ECA, with the same simulation model as shown in Fig. 7. We apply the aggregate scheme to all stations including AP, and hence it improves the aggregate throughput of non-qos traffic by 3.4 times, approximately, while throughput of all QoS traffic still remain the same as those of the ECA. However, if the characteristic of non-qos traffic, i.e., TCP flows, is considered, the more improvement can be achievable. It is because the TCP flow has the burst characteristics. It means that more TCP Ack packets are received by the TCP sender, and hence more packets will be sent up to the TCP receive window size. Therefore, we check the status of ECA queues at the AP to determine whether these ECA downlink queues are bottleneck or not, in the simulation of the aggregate scheme. Fig. 9 shows the status of the downlink ECA queues corresponding to AC BE. Approximately, 2 packets are buffered at the AC BE queue almost always. We use TCP new Reno with elayed Ack option with TCP receive window size of 6. Since there are 6 downlink and uplink TCP flows, the maximum number of packets, which can be buffered at the AC BE queue, is 26 packets. This means that the downlink AC BE queue is a bottleneck in our simulation scenario when the aggregate MAC scheme is used. Accordingly, if those downlink packets (AC BE) can be served faster, the aggregate throughput will be increased. This is the reason why we could achieve a very high throughput performance with MCCA as shown in Fig. 8. Even though we get higher throughput gain with MCCA than ECA scheme or ECA with aggregate scheme, we lose nothing. In Fig. 8, this can be confirmed by observing the aggregate throughput of QoS traffic. Fig. also shows that the MCCA does not sacrifice the delay performance of QoS traffic either. As shown in Fig., which has a log-scale y-axis, there are still enough margins to each delay bound for all three schemes. Until now, we have simulated in the environments, where the channel errors do not occur, thus not utilizing the proposed error recovery mechanism described in Section 5.3. Fig. shows the effect of the error recovery mechanism when the frame (MPU) error rate varies. In this figure, with a log-scale y-axis, the performance of MCCA non- QoS traffic is observed lower than that in Fig. 8 due to additional frame overheads such as MBA and MBAR frames. For this simulation, we assume that the sender retransmits a frame at most once. In other words, even if a frame suffers consecutive errors, it is retransmitted just once. We first observe that both MCCA and ECA sustain the throughput for QoS traffic irrespective of the frame error rate. On the other hand, the throughput for non-qos traffic decreases as the frame error rate increases for both systems. However,

8 References Throughput (Mbps) MCCA : non-qos MCCA : QoS ECA : non-qos ECA : QoS error rate (%) Figure. Error recovered performance non-qos traffic of MCCA still preserves 72% of the overall throughput even if frame errors occur with the rate of %, As a result, we can conclude that MCCA with the error recovery mechanism still has a great throughput gain compared to ECA even in unreliable channel environments. 7. Conclusion In this paper, we propose a new high-efficient MAC scheme, called MCCA, for the next-generation high-speed WLANs. The MCCA is based on the ECA-based multiuser polling (multipolling) and a two-level frame aggregation scheme performing aggregation at both MAC and PHY layers. Therefore, the proposed scheme can aggregate frames with different QoS requirements and different destinations. The aggregate PPU scheme, however, has the nature that this aggregated frame should be well scheduled in order for the receiving HT STAs to recognize easily and correctly. Therefore, we have introduced our multipolling for the purpose of scheduling the aggregate PPU frames. Moreover, by using the multipolling, we also achieve very high efficiency of the channel utilization thanks to using a minimum size of backoff counter value, which is uniquely assigned by U/L MAPs of HT AP. With simulation runs, we show that the MCCA provides very high throughput performance while the delay performance remains acceptable. The achieved performance enhancement is approximately 646 % in terms of the aggregate throughput of non-qos traffic when the MCCA is employed while the aggregate throughput of QoS traffic is not sacrificed. In the future, we plan to evaluate the proposed scheme further. Those include the consideration of more realistic channel environments such as multipath fading and multiple transmission rates depending on the channel condition of each STA. [] IEEE Std , Part : Wireless LAN Medium Access (MAC) and Physical Layer (PHY) specifications, Reference number ISO/IEC 882-:999(E), IEEE Std 82., 999 edition, 999. [2] IEEE 82.a-999, Supplement to Part : Wireless LAN Medium Access (MAC) and Physical Layer (PHY) specifications: High-speed Physical Layer in the 5 GHz Band, 999. [3] IEEE 82.e/., raft Supplement to Part : Wireless LAN Medium Access (MAC) and Physical layer (PHY) specifications: Medium Access (MAC) Enhancementsfor Quality of Service (QoS), Oct. 24. [4] IEEE 82.g-23, Supplement to Part : Wireless LAN Medium Access (MAC) and Physical Layer (PHY) specifications: Further Higher ata Rate Extension in the 2.4 GHz Band, 23. [5] IEEE 82.k/., raft Supplement to Part : Wireless LAN Medium Access (MAC) and Physical layer (PHY) specifications: Radio Resource Measurement, July 24. [6] IEEE 82. Working Group Homepage, online link. [7] Adrian P. Stephens et al., 82. TGn Functional Requirements, IEEE 82.-3/83r2, March 24. [8] Stefan Mangold, Sunghyun Choi, Guido R. Hiertz, Ole Klein, and Bernhard Walke, Analysis of IEEE 82.e for QoS Support in Wireless LANs, IEEE Wireless Communications Magazine, vol., no. 6, ec. 23. [9] Sunghyun Choi, Javier del Prado, Sai Shankar N, and Stefan Mangold, IEEE 82.e Contention-Based Channel Access (ECF) Performance Evaluation, in Proc. IEEE ICC 3, May 23. [] Stefan Mangold, Sunghyun Choi, Peter May, Ole Klein, Guido Hidertz, and Lothar Stibor, IEEE 82.e Wireless LAN for Quality of Service, in Proc. European Wireless (EW 22), vol., pp , Feb. 22. [] Yang Xiao and Jon Rosdahl, Throughput and elay Limits of IEEE 82., IEEE Communications Letters, vol. 6, no. 8, Aug. 22. [2] Shou-Chih Lo, Guanling Lee, and Wen-Tsuen Chen, An Efficient Multipolling Mechanism for IEEE 82. Wireless LANs, IEEE Trans. on Computers, vol. 52, no. 6, June 23. [3] Youngsoo Kim, Sunghyun Choi, Kyunhun Jang, and Hyosun Hwang, Throughput Enhancement of IEEE 82. WLAN via Aggregation, in Proc. IEEE VTC 4- Fall, Sept. 24. [4] The Network Simulator ns-2, online link.