Uni-MUMAC: A Unified Down/Up-link MU-MIMO MAC Protocol for IEEE 802.11ac WLANs

Uni-MUMAC: A Unified Down/Up-link MU-MIMO MAC Protocol for IEEE 802.11ac WLANs


Due to the dominance of the downlink traffic in Wireless Local Area Networks (WLANs), a large number of previous research efforts have been put to enhance the transmission from the Access Point (AP) to stations (STAs). The downlink Multi-User Multiple-Input Multiple-Output (MU-MIMO) technique, supported by the latest IEEE amendment-802.11ac, is considered as one of the key enhancements leading WLANs to the Gigabit era. However, as cloud uploading services, Peer-to-Peer (PP) and telepresence applications get popular, the need for a higher uplink capacity becomes inevitable.

In this paper, a unified down/up-link Medium Access Control (MAC) protocol called Uni-MUMAC is proposed to enhance the performance of IEEE 802.11ac WLANs by exploring the multi-user spatial multiplexing technique. Specifically, in the downlink, we implement an IEEE 802.11ac-compliant MU-MIMO transmission scheme to allow the AP to simultaneously send frames to a group of STAs. In the uplink, we extend the traditional one round channel access contention to two rounds, which coordinate multiple STAs to transmit frames to the AP simultaneously. -nd round Contention Window (), a parameter that makes the length of the -nd contention round elastic according to the traffic condition, is introduced. Uni-MUMAC is evaluated through simulations in saturated and non-saturated conditions when both downlink and uplink traffic are present in the system. We also propose an analytic saturation model to validate the simulation results. By properly setting and other parameters, Uni-MUMAC is compared to a prominent multi-user transmission scheme in the literature. The results exhibit that Uni-MUMAC not only performs well in the downlink-dominant scenario, but it is also able to balance both the downlink and uplink throughput in the emerging uplink bandwidth-hungry scenario.


IEEE 802.11 Wireless Local Area Networks (WLANs) is becoming an indispensable part of our life, at homes and working places. Due to the problems, such as frame collisions and protocol overheads, the throughput of WLANs is significantly lower than the raw data rate of what the Physical (PHY) layer can achieve [1]. The evolution of Internet traffic is going to exacerbate this low-throughput problem. The Internet traffic shifts from web browsings and file transfers to a wide variety of applications, many of which integrate content-rich files provided by users [2]. This shift, mainly driven by the bandwidth-hungry multimedia applications (e.g., web HDTV, video sharing and wireless display), demands a performance increase in both downlink and uplink of WLANs [4].

Spatial multiplexing is one of the current trends (the spatial diversity and the frame aggregation are among others) aiming at improving the performance of wireless systems. IEEE 802.11n [5] supports spatial multiplexing in the point-to-point communication mode (i.e., Single-user MIMO or SU-MIMO). The point-to-multipoint communication mode, for example, the transmission from the Access Point (AP) to multiple stations (STAs) (i.e., downlink Multi-user MIMO or MU-MIMO), is supported by the latest IEEE amendment-802.11ac [6]. However, the uplink MU-MIMO enhancement, which is crucial to mitigate collisions and to satisfy the performance requirements in the uploading-intensive scenario, has not been considered by any IEEE standard.

In this paper, we propose a unified down/up-link MU-MIMO Medium Access Control (MAC) protocol called Uni-MUMAC, which coordinates distributed STAs to exploit the spatial multiplexing gain to improve the performance of IEEE 802.11ac WLANs. The main contributions are summarized as follows. 1) Two separate MU-MIMO MAC protocols, one for the downlink transmission [7] and the other one for the uplink transmission [8], are integrated into a unified MU-MIMO MAC protocol. Compared to [7] and [8], where only one-way traffic is considered (i.e., the downlink or the uplink), the presence of both downlink and uplink transmissions has been taken into account. 2) A special focus is placed at finding the most suitable value of the -nd round Contention Window () to obtain the highest system throughput, and the impact of the optimized uplink transmission on the downlink is discussed. With the optimized and other properly configured parameters (e.g., the number of aggregated frames and the queue length of the AP), Uni-MUMAC is then extensively evaluated through simulations in the downlink-dominant and the down/up-link balanced traffic scenarios in IEEE 802.11ac based WLANs. 3) An analytic model is developed to validate the simulation results, and a prominent proposal in the literature is implemented to compare with our scheme.

The rest of the paper is organized as follows. First, Section 2 explores some of the key MU-MIMO MAC proposals in the literature. Then, Section 3 introduces the modified frame structure and detailed Uni-MUMAC operating procedures. After that, Section 4 gives the considered scenarios to evaluate Uni-MUMAC, the saturation throughput model, simulation results and observations. Finally, Section 5 concludes the paper and discusses the future research challenges.

2Related Work

Most previous work has put efforts on adjusting MAC parameters or extending MAC functions to improve the performance of WLANs. In the downlink, the spatial multiplexing technique has recently gained much attention. To support it, many proposals in the literature adopt the following MAC procedure. The AP firstly sends out a modified Request to Send (RTS) containing a group of targeted STAs, then those listed STAs estimate the channel, add the estimated Channel State Information (CSI) into the extended Clear to Send (CTS) and send it back. As soon as the AP receives all successful CTSs, it precodes the outgoing signals and sends multiple data frames simultaneously.

Cai et al. in [9] propose a distributed MU-MIMO MAC protocol that modifies RTS and CTS frames to estimate the channel, based on which, the AP is able to concurrently transmit frames to multiple STAs. Kartsakli et al. in [10] consider an infrastructured WLAN and propose four multi-user scheduling schemes to simultaneously transmit frames to STAs. The results show that the proposal achieves notable gains compared to that of the single user case. Gong et al. in [11] propose a modified Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol with three different ACK-replying mechanisms. The authors claim that the proposed protocol can provide a considerable performance improvement against the beamforming based approach when Signal-to-noise Ratio (SNR) is high. Zhu et al. in [12] investigate the required MAC modifications to support downlink MU-MIMO transmissions by focusing on the fairness issue. The proposed Transmit Opportunity (TXOP) sharing scheme not only obtains a higher throughput but is also more fair than the conventional mechanism. Cha et al. in [13] compare the performance of a downlink MU-MIMO scheme with a Space Time Block Coding (STBC) based frame aggregation scheme. The results show that the former produces a higher throughput than the latter if transmitted frames are of similar length.

The uplink enhancement is getting more attention as the popularity of PP and cloud applications increases. In general, there are two broad categories of uplink MU-MIMO MAC enhancements, namely, the un-coordinated access and the coordinated access. The former utilizes the MAC random mechanism to decide which STAs are allowed for data transmissions, while the latter employs the AP to schedule STAs’ uplink access.

Some of the un-coordinated uplink access schemes are sampled as follows. In [14], Jin et al. evaluate the performance of uplink MU-MIMO transmissions in the IEEE 802.11 basic access mode, where the simultaneous uplink transmissions are on the random access basis and the channel coefficients of each STA are assumed to be known by the AP. In [15], Zheng et al. present a Distributed Coordination Function (DCF) enhancement called Two-Round RTS Contention (TRRC) to take advantage of the spatial domain. The proposed scheme allows STAs to contend for the channel after a successful RTS is detected. In [16], Tan et al. present a distributed MAC scheme called Carrier Counting Multiple Access (CCMA), where a beacon that contains the uplink access threshold is announced by the AP periodically. Based on the threshold, STAs count the number of ongoing transmissions by monitoring preambles, and then decide to contend for the channel or stay idle. In [17], Babich et al. investigate the theoretical model of asynchronous frame transmissions, where a STA is allowed to transmit even if other STAs are already transmitting.

Some of the coordinated uplink access schemes are overviewed as follows. In [18], Tandai et al. propose a synchronized uplink transmission scheme coordinated by the AP. On receiving requests from STAs, the AP broadcasts a pilot-Requesting CTS (pR-CTS) to schedule STAs’ pilot transmissions for estimating the channel. After obtaining the CSI, the AP sends a Notifying-CTS (N-CTS) to inform the selected STAs to transmit frames in parallel. In [19], Zhou et al. propose a two-round channel contention mechanism, which divides the MAC procedure into two parts, namely, the random access and the data transmission. The random access terminates when the AP receives a predefined number of successful RTSs, and then the data transmission follows. In [20], Zhang et al. further extends the two contention rounds to multiple rounds, which enable more STAs to be involved in parallel uplink transmissions. The proposed protocol can fall-back to the single-round mode automatically on condition that the traffic is low and the single-round scheme can provide higher throughput. In [21], Jung et al. present an asynchronous uplink Multi-Packet Reception (MPR) scheme, where an additional feedback channel is assumed to be employed by the AP to acknowledge the successful frame receptions along with other ongoing transmissions.

Only a few work has combined the downlink and the uplink transmissions together. In [22], Shen et al. propose a High Throughput MIMO (HT-MIMO) MAC protocol, which utilizes frequency signatures to differentiate simultaneously-received control messages. The proposal works in the Point Coordination Function (PCF) mode, hence both downlink and uplink transmissions can be only initiated by the AP. In [23], Jin et al. focus on the unbalanced throughput problem between downlink and uplink, where a Contention Window (CW) adjustment scheme and a random piggyback scheme are proposed to increase the downlink throughput ratio. In [24], Li et al. propose a multi-user transmission MAC scheme, which supports the Multi-Packet Transmission (MPT) in the downlink and multiple control frame receptions (e.g., CTSs or ACKs) in the uplink, while simultaneous data transmissions from multiple STAs are not considered. Due to the simplicity, the MAC scheme of [24] is implemented to compare with our proposal.

3Uni-MUMAC Operations

Uni-MUMAC is based on the IEEE 802.11 Enhanced Distributed Channel Access (EDCA), which relies on the CSMA/CA mechanism to share the wireless channel. EDCA can operate in either the basic access mode or the optional RTS/CTS handshaking one. In this paper, Uni-MUMAC adopts and extends the RTS/CTS scheme for the following reasons: 1) The AP can notify the uplink contending STAs about the number of available antennas by a modified control frame; 2) The AP can estimate the CSI from the RTS/CTS exchanging process; 3) The distributed STAs can be synchronized from the exchanging process to transmit to the AP in parallel.

3.1Frame Structure

PHY Frame Structure

The PHY frame structure of IEEE 802.11ac is shown in Figure 1, where VHT PLCP, PPDU and MPDU stand for Very High Throughput Physical Layer Convergence Protocol, PLCP Protocol Data Unit and MAC Protocol Data Unit, respectively. As shown from the frame structure, PPDU consists of the PHY preamble and MPDUs. IEEE 802.11ac specifies that all MPDUs must be transmitted in the format of Aggregated-MPDU (A-MPDU), where aggregated MPDUs are separated by MPDU delimiters. Before being delivered to the PHY layer, a service field and a tail field are appended to the A-MPDU. The PHY preamble is formed by legacy fields for the backward compatibility (i.e., L-STF, L-LTF and L-SIG) and some newly introduced VHT fields [6][25].

Figure 1: PHY frame format of IEEE 802.11ac
Figure 1: PHY frame format of IEEE 802.11ac

IEEE 802.11ac introduces these VHT fields to assist WLANs in obtaining the high performance. A Group Identifier (Group-ID) field is added in VHT Signal Field-A (VHT-SIG-A), which is used to inform the targeted STAs about the followed MU-MIMO transmission, the order and the position of each STA’s corresponding stream. A complete Group-ID table is created and disseminated by the AP, and will be recomputed as STAs associate or de-associate to the AP. Since the number of STAs’ combinations can exceed the available number of Group-ID in a large basic service set, and the down/up-link channel may be different, thus, we assume a single Group-ID can reference to multiple transmission sets along with other PHY preamble features that could be used to resolve the intended STAs [26]. In other words, there will be always at least one proper Group-ID entry that can be mapped to the intended transmission set.

VHT Long Training Field (VHT-LTF) can contain an orthogonal training sequence that is known by both the transmitter and the receiver to estimate the MIMO channel. The number of VHT-LTF fields should not be less than the number of transmitted spatial streams to precisely estimate the channel. The legacy and VHT-SIG-A fields adopt the low rate modulation scheme to make the preamble understandable to all STAs, while the rest VHT fields and A-MPDU are transmitted using the VHT modulation scheme. In this paper, a single modulation and coding scheme (MCS), i.e., -QAM with , is utilized for all frames to simplify the simulation, although the extension to various MCS for different frames and STAs is straightforward. Here, we only introduce the PHY features that are closely related to the proposed protocol. The readers please refer to [6] for details of other PHY features.

MAC Frame Structure

The control frames of Uni-MUMAC are shown in Figures Figure 2 and ?. In the downlink, the control frames are MU-RTS, MU-CTS and MU-ACK. MU-RTS keeps the standard RTS frame structure, because the AP can utilize the Group-ID field of the PHY frame to notify targeted receivers. MU-CTS and MU-ACK add a transmitter address field to the original CTS and ACK frames in order to facilitate the AP to differentiate multiple responding STAs. Note that MU-CTS and MU-ACK coincidentally have the same frame structure as the standard RTS frame after adding a transmitter address field to the original CTS and ACK frames.

Figure 2: Frame structure of standard RTS
Figure 2: Frame structure of standard RTS

In the uplink, all frame modifications are limited to the AP side to reduce STAs’ computing consumption. These modified frames are Ant-CTS (CTS with antenna information), G-CTS (Group CTS) and G-ACK (Group ACK), as shown in Figure ?. An antenna information field is added to Ant-CTS, which is broadcast by the AP to announce the number of available antennas (after one antenna is occupied in the first contention round) and the start of the -nd contention round. G-CTS and G-ACK have the identical frame structure, where the receiver address field is removed and replaced by the Group-ID field in the IEEE 802.11ac PHY frame, while a transmitter address field is added to indicate the AP address. The G-CTS frame is used to inform STAs the start of the data transmission, and G-ACK is used to indicate the successful reception of data frames.

3.2Successful Downlink Transmissions

Figure 3 shows a successful Uni-MUMAC downlink transmission. Initially, the channel is assumed busy (B). After the channel has been idle for an Arbitration Inter Frame Space (AIFS), a random backoff (BO) drawn from CW starts to count down and is frozen as soon as the channel is detected as busy.

Suppose the AP first wins the channel contention and sends a MU-RTS. Then, the STAs who are included in Group-ID reply with MU-CTSs sequentially as the indicated order. Those STAs who are not included in the MU-RTS will set the Network Allocation Vector (NAV) to defer their transmissions. After a MU-CTS is received, the AP will measure the channel through the training sequence included in the PHY preamble, and then uses the estimated CSI to precode the simultaneously-transmitted frames. As being precoded, the frames destined to different STAs will not interfere with each other. Finally, STAs send MU-ACKs at the same time to acknowledge the successful reception of data frames.

Figure 3: A successful Uni-MUMAC downlink transmission
Figure 3: A successful Uni-MUMAC downlink transmission

Note that, the uplink channel is assumed to be the same as the downlink one in this paper. In other words, the implicit CSI feedback, namely, the AP estimates the channel using the training sequence included in the MU-CTS, is adopted. The reason is that the explicit CSI feedback will need more computing capability at STAs and require an extra field with substantial volume in the MU-CTS to include the measured CSI, which may not be suitable for STAs in some capacity or power constraint scenarios.

3.3Successful Uplink Transmissions

In the uplink, a standard RTS is sent to the AP by the STA that won the -st round channel contention. Instead of replying a CTS, an Ant-CTS is broadcast by the AP with two functions: 1) to notify the STA about the successful reception of the RTS, and 2) to inform other STAs that the number of available antennas and the start of the -nd contention round. The STAs who have frames to send will compete for the available spatial streams in the -nd contention round. A new random () drawn from starts to count down, and a RTS will be sent if of a STA reaches . The number of available antennas of the AP decreases by one each time an uplink RTS is successfully received. The -nd contention round finishes as: 1) all available antennas of the AP are occupied or 2) a predefined duration of the -nd contention round elapses in case there are not enough contending STAs (the maximum duration of the -nd contention round is set to slots). As soon as the -nd contention round finishes, a G-CTS is sent by the AP to indicate the readiness for receiving multiple frames in parallel. The G-CTS frame includes the STAs who have successfully sent RTSs during both -st and -nd contention rounds. When the G-CTS is received by the targeted STAs, they are synchronized to send data frames to the AP. Finally, the AP acknowledges the received data frames with G-ACK.

An example of a successful uplink transmission is shown in Figure 4, in which illustrating case, the AP has antennas, STA picks and STA picks from , respectively.

Figure 4: A successful Uni-MUMAC uplink transmission
Figure 4: A successful Uni-MUMAC uplink transmission

It is important to point out that the RTSs sent by STAs in the -nd contention round could collide with G-CTS sent by the AP. For example, in the case that the RTS sent by a STA who claims the AP’s last available antenna is not heard by some STAs (hidden terminals), which therefore believe that the AP still has available antennas. Then, after a Short Inter Frame Space (SIFS) interval, the G-CTS sent by the AP and RTSs sent by the hidden STAs would collide. To avoid this unexpected scenario, STAs are forced to wait for a Multi-User SIFS interval in the -nd contention round. MU-SIFS is an interval longer than SIFS but shorter than AIFS, which not only prioritizes the AP to send the G-CTS, but also avoids STAs to misunderstand MU-SIFS as an idle channel.

3.4Frame Collisions

Collisions will occur in both -st and -nd contention rounds if more than one STA choose the same random backoff value. On sending a RTS, EDCA specifies that the STA has to set a timer according to Equation (Equation 1) to receive the expected CTS, where represents the transmission duration of a CTS frame. If CTS is not received before the timer expires, the STAs who previously sent RTSs assume that collisions occurred. These RTS-sending STAs will compete for the channel access after the expiration of the timer. For the RTS-receiving STAs, none of RTSs can be decoded correctly. Therefore, after the collision time, the receiving STAs will wait for an Extended Inter Frame Space (EIFS, as shown in Equation (Equation 2)) interval to compete for the channel access together with those RTS-sending STAs.

As shown in Figure 5 (Ant-CTS and MU-CTSs with dotted lines mean these frames would be transmitted if there were no collisions), collisions in the -st contention round include two cases: 1) collisions among STAs; 2) collisions between STAs and the AP. Since STAs can not differentiate these two cases, the collision time has to be set according to the duration of the longer frame, which is . In addition, the and the EIFS interval also have to be extended according to (as shown in Equation (Equation 3), where is the number of AP’s antennas) and Multi-User EIFS (MU-EIFS, as shown in Equation (Equation 4)), to take the scenario that the AP is involved in collisions into account.

Figure 5: Collisions in the 1-st contention round
Figure 5: Collisions in the -st contention round

If collisions occur in the -nd contention round, the colliding STAs will not be indicated as the receivers in the Group-ID field of G-CTS. Therefore, only the STAs that have successfully sent RTSs in both contention rounds are allowed to transmit frames to the AP at the same time (as illustrated in Figure 6).

Figure 6: RTS collisions in the 2-nd contention round
Figure 6: RTS collisions in the -nd contention round

3.5Other Considerations

In IEEE 802.11 EDCA, a STA renews its if the channel contention was successful. For the STAs who did not win the contention, the frozen is used for the next contention round. In this paper, of the -st contention round is renewed after collisions in the -st round or if the STA is the initiator of the two-round process. Although both STA and STA participate in the transmission as shown in Figure 6, STA is considered to be the initiator. In other words, STA will have a new random in the followed -st contention round, while STA will use the frozen .

It is more straightforward regarding the renewal policy. Each STA draws a fresh from as soon as a new -nd contention round starts.

G-CTS is sent out by the AP when the number of available antennas reaches zero or the duration of the -nd contention round drains. As soon as the Ant-CTS is sent, the AP sets the G-CTS timer to account for up to slots (as shown in Equation (Equation 5)).

4Performance Evaluation

Uni-MUMAC is evaluated using an analytic model and simulations. The analytic model is adapted from Bianchi’s saturation throughput model [27] to support MU-MIMO transmissions in both downlink and uplink. The simulation is implemented in C++ using the Component Oriented Simulation Toolkit (COST) library [28] and the SENSE simulator [29].

A single-hop WLAN implementing Uni-MUMAC is considered as shown in Figure 7. It consists of one AP and STAs with an error-free channel. The AP employs an array of antennas, while each STA has only one antenna. The data frame has a fixed length of bits. The parameters used to evaluate Uni-MUMAC are listed in Table 1.

Figure 7: Down/Up-link Uni-MUMAC transmissions
Figure 7: Down/Up-link Uni-MUMAC transmissions

4.1Saturation Throughput Analysis

Table 1: System parameters
Parameters Values
[1ex] Channel Bandwidth MHz
Modulation & Coding Scheme -QAM with
Guard Interval s
Queue Length of STA & AP ,
Frame Length () bits
MAC Header () bits
MPDU Delimiter () bits
Service Bits () bits
Tail Bits () bits
Ant-CTS bits
G-CTS/G-ACK bits
Idle Slot () s
SIFS, MU-SIFS and AIFS , and s
AP Antennas () , ,
No. of Iteration ()

Let be the transmission probability of a node in a random slot, where is the size of the -st round contention window. Then, the probability that the channel is idle is:

The probability that the channel sees a successful transmission slot, , is given by:

which accounts for that a single node (either the AP or a STA) successfully wins the -st round channel contention.

By deducting and , the probability that the channel observes a collision slot, , is obtained:

In the saturated condition, a successful downlink transmission always contains (the number of AP antennas) data streams. Therefore, the number of bits of a successful downlink transmission () is:

where is the probability that a transmission is from the AP, and is the number of aggregated frames in an A-MPDU.

The calculation of the successfully received number of bits of uplink () has to account for successful transmissions of both -st and -nd contention rounds:

where is the probability that x (x ) antennas of the AP have been used for the uplink transmission. In other words, one antenna has been obtained by a STA in the -st contention round, and x-1 antennas have been successfully obtained by STAs in the -nd contention round.

The duration of a successful downlink transmission, , is:

An example to calculate the duration of a MU-RTS frame and a data frame using the system parameters of Table 1 is given in Equation (Equation 12). s are the duration of PHY header (the number of the VHT-LTF fields is proportional to the number of AP antennas ); , and are the length of the service field, the tail field and the MPDU delimiter; and are the number of data bits in a symbol and the symbol duration; is the number of aggregated frames in an A-MPDU; and are the length of MU-RTS and the MAC header respectively. More detailed calculation of the frame duration can be found in [30].

The duration of a successful uplink transmission, , is:

where stands for the average duration of the -nd contention round.

where is the probability that there are k (k ) slots in the -nd contention round.

As a STA can not differentiate if collisions of the -st round are caused by the AP or other STAs, the collision time has to be set according to the duration of the longer frame:

The average duration of a channel slot is:

Equation (Equation 17) gives a simple example to calculate , in which case, the AP has antennas and :

The first part of Equation (Equation 17) stands for that only one STA is successful in the -st slot. The second part represents that only one STA is successful in the -nd slot, which is conditioned on that the -st slot fails (, no STAs or more than one STA chooses the -st slot). Note that the similar condition is not required for the first part, because the -nd round contention finishes as soon as a STA wins the -st slot regardless the choices of other STAs of other slots. As increases, the closed form of becomes infeasible due to various combination of conditions for a STA to succeed in different slots. Therefore, we utilize a semi-analytic algorithm to calculate and , the pseudo code of which is shown in Algorithm ?.

Finally, the collision probability of a node,

and down/up-link throughput are derived:

The transmission probability , equations (Equation 18) and (Equation 19) form a non-linear system, which can be resolved by an iterative numerical technique [31].

4.2System Performance against

In this sub-section, the performance of Uni-MUMAC is evaluated by increasing , with the goal to find a suitable value that maximizes the system performance. Two traffic conditions are considered: 1) the saturated one, as shown in Figure ?, and 2) the non-saturated one, as shown in Figure ?. The saturated condition means that both the AP and STAs always have frames to transmit. Obviously, there is no -nd round channel access when the AP has antenna, which is why the results keep constant as . Note that the plots include both analysis and simulation results in the saturated condition, while the plots include only simulation results of the non-saturated condition.

As shown in Figure ?, when the WLAN is saturated (i.e., both downlink and uplink are saturated), has very small impact on the downlink throughput (AP’s throughput). However, for the uplink, the importance of choosing an appropriate is observed. For example, the uplink throughput (STAs’ throughput) approaches its maximum when as (Figure ?) and when as (Figure ?).

In the non-saturated condition, we set the traffic load for each STA and the AP to Mbps and Mbps, respectively. In Figure ?, the downlink throughput ( and ) obtains the highest value when , and then decreases as keeps increasing. The reason is that the continuous increase of leads to longer uplink transmissions that harm the downlink ones. Figure ? shows that the average delay increases as increases. Note that, the average delay remains at a relatively low level when the system is in the non-saturated condition, for example, the average delay of STAs when and the average delay of the AP when and . However, the average delay of the AP () increases sharply as the downlink traffic approaches saturation.

It is also observed that the downlink throughput, as the network becomes saturated, is much lower than the uplink one. The reasons are as follows. First, the AP bottle-neck effect. It is due to the fact that the AP manages all traffic to and from STAs in a WLAN, while it has the same probability to access the channel as the STAs due to the random backoff mechanism of CSMA/CA. In addition, the inherently high traffic load at the AP results in that the downlink is saturated in most of the time. Thirdly, a favorable value of for the uplink does not mean the same benefit to the downlink. For example, as shown in the Figure ?, the uplink obtains the highest throughput when is set approximately to (), while the downlink transmission prefers a value of as small as possible.

In order to mitigate the AP bottle-neck effect and compensate the downlink disadvantage when STAs choose a big , we set the maximum number of frames that the AP can aggregate in an A-MPDU to (), while keeping the number of frames aggregated by each STA to in the following simulations. Also, the queue length of the AP is set to quadratically increase with the number of STAs () to statistically guarantee that there are enough frames destined to different STAs [30].

In Figures ? and ?, the performance of Uni-MUMAC is evaluated in the same condition as done in Figures ? and ? except that the network adopts the new frame aggregation scheme (AP’s , STA’s ) and the new queue length (, ). The results show that Uni-MUMAC manages to avoid the extremely low downlink throughput when the system is saturated (Figure ?) and keeps the downlink transmission always in the non-saturation area (Figure ?), which is not achieved in Figure ?. The average delay of the AP (Figure ?) is much lower compared to that of the AP in Figure ?, which is because the system remains in the non-saturated condition by employing the frame aggregation scheme.

The results from Figure ? also show that the system can roughly obtain the maximum performance when . For example, in the case that the AP has antennas, the system throughput (AP+STA) reaches its maximum when as and as , respectively. Therefore, the optimum value of is fixed to in the following simulations.

4.3System Performance against

In this sub-section, the performance of Uni-MUMAC is evaluated against the number of STAs in the downlink-dominant and the down/up-link balanced traffic scenarios, where is increased from to , the maximum number of frames aggregated at the AP is set to and the -nd round Contention Window is also set to . The two traffic scenarios are specified as follows.

  1. Downlink-dominant: This is the traditional WLAN traffic scenario, where the AP manages a much heavier traffic load compared to that of STAs. Therefore, the traffic load of the AP is set to be times higher than that of each STA. For instance, if the traffic load of a STA is Mbps and there are STAs, the traffic load of the AP will be Mbps.

  2. Down/up-link balanced: This is one of WLAN traffic types that not only includes PP applications, which have already been around for some years, but also includes those emerging content-rich file sharing and video calling applications. Therefore, the traffic load of the AP is set to be the same as that of each STA. In this case, if there are STAs, and each STA has Mbps traffic load, the traffic load of the AP will be Mbps.

The multi-user MAC scheme (LI-MAC) proposed by Li et al. in [24] is implemented and used as a reference (named as AP/STA-LI in the legend) to compare with Uni-MUMAC. For fair comparison, LI-MAC and Uni-MUMAC adopt the same configuration parameters (as shown in Table 1). The key features of LI-MAC and Uni-MUMAC are illustrated in Table ?.

Figure ? shows the throughput by increasing the number of STAs in the downlink-dominant traffic scenario. It is with clear advantage to employ a higher number of antennas at the AP. The downlink throughput is much higher than the uplink one before the system gets saturated. The reasons for that are twofold: 1) the AP traffic load is inherently higher than that of STAs, and 2) the AP adopts the frame aggregation scheme. As the system becomes saturated, the throughput of both downlink and uplink decreases as increases.

As shown in Figure ?, the uplink throughput of LI-MAC () is the same as that of Uni-MUMAC (), which is because LI-MAC adopts the baseline DCF in the uplink. As the uplink throughput approaches saturation (), the downlink throughput of LI-MAC starts to decrease. The downlink throughput of Uni-MUMAC can achieve higher gains when the network is not saturated, which is because the proposed -nd round transmission increases the uplink transmission efficiency, and therefore decreases the number of AP’s channel contenders. However, as the number of STAs further increases, where both up/down-link saturate, LI-MAC outperforms Uni-MUMAC, which is because Uni-MUMAC suffers a high collision rate in the 2-nd round that prolongs the 2-nd round duration. However, it is important to point out that neither LI-MAC or Uni-MUMAC is able to work sustainably in the saturated condition.

Figure ? shows the throughput against in the down/up-link balanced traffic scenario. As expected, Uni-MUMAC achieves the balanced downlink and uplink throughput. This is because the AP and STAs are set to have the same traffic load, and more importantly, the frame aggregation scheme (AP’s , STA’s ) counteracts the STAs’ collective advantage on the channel access.

Comparing with Uni-MUMAC, the downlink throughput of LI-MAC achieves better performance when the uplink is saturated, which is because the duration of collisions in the uplink of LI-MAC is much shorter than that of Uni-MUMAC. However, the drawback is that LI-MAC has a big throughput gap between the AP and STAs, which does not satisfy the traffic requirements of the considered scenario.

Figure ? shows the average delay against . Both downlink and uplink delays increase with , and grow significantly as the downlink or the uplink traffic approaches the saturation. After the system gets saturated, the average delay becomes steady. It is worth pointing out that the average delay of STAs is higher than that of the AP when becomes bigger. The reason for that is that the transmission duration of the AP gets longer as increases (due to the frame aggregation scheme), which makes STAs waiting longer to access the channel.

Figure ? shows the -st round collision probability increases with and converges when the system becomes saturated, which confirms the down/up-link saturation trend as discussed in Figures ? and ?. It is interesting to note that the collision probability of STAs is higher than that of the AP when the system is non-saturated. The reason for that is a STA transmits less frequently than the AP in the non-saturated condition, which results in a lower conditional collision probability for the AP. It can be clearly explained by Equation 20, where and ( and ) are the -st round collision probability and the transmission probability of the AP (or a STA) in the non-saturated condition:

Figure 8 shows the -nd round collision probability against . It is clear that the -nd round collision probability is higher when the system traffic load is higher. In the low number of STAs area, the -nd round collision probability when the AP has antennas is sometimes lower than that when the AP has antennas. The reason is that, a higher number of antennas at the AP usually means a longer duration of the -nd contention round, which increases the chances of collisions in the -nd round. For example, in a case that the AP employs antennas, the -nd contention round finishes as soon as a STA successfully wins the still-available antenna of the AP; while in a case that the AP employs more than antennas, the -nd contention round continues, therefore increasing the -nd round collision probability.

Figure 8: 2-nd round collision probability against M
Figure 8: -nd round collision probability against

5Conclusions & Future Research Challenges

In this paper, a unified MU-MIMO MAC protocol called Uni-MUMAC, which supports both MU-MIMO downlink and uplink transmissions for IEEE 802.11ac WLANs, is proposed. We evaluate it through an analytic model and simulations. A prominent MAC scheme from the literature is implemented and compared with Uni-MUMAC.

By analyzing the simulation results, we observe that the -nd round Contention Window , which is tuned to optimize the uplink transmission, is however not bringing the same benefit to the downlink one. An adaptive frame aggregation scheme and a queue scheme are applied at the AP to offset this disadvantage. By properly setting the aforementioned parameters, the results show that a WLAN implementing Uni-MUMAC is able to avoid the AP bottle-neck problem and performs very well in both the traditional downlink-dominant and emerging down/up-link balanced traffic scenarios. The results also show that a higher system capacity can be achieved by employing more antennas at the AP.

Uni-MUMAC gives us insight about the interaction of down/up-link transmissions and how different parameters that control the system can be tuned to achieve the maximum performance. Based on the study of this paper, we considered the following aspects as the future research challenges or next steps for Uni-MUMAC.

  1. Adaptive Scheduling Scheme: As discussed in the paper, a parameter that optimizes the uplink could be unfavorable to the downlink. Therefore, an adaptive scheduling algorithm that takes several key parameters into account and compensates those STAs whose interests are harmed would play a significant role on obtaining the maximum performance while maintaining the fairness. As implied from the results, these parameters include: the size of A-MPDU, the queue length, the spatial-stream/frame allocation, the number of nodes/antennas, and other key parameters that control down/up-link transmissions.

  2. Traffic Differentiation: Another future research challenge is to provide new traffic differentiation capability in the uplink in addition to the one defined in IEEE 802.11e amendment [32]. The new traffic differentiation should be able to limit the number of STAs that can participate in the -nd contention round to reduce -nd round collisions. A possible solution could be to create a table at the AP with information about the priority of each traffic flow and the queue length of each STA, and then to utilize this table to control the -nd contention round.

  3. Multi-hop Mesh Networks: There are more challenges that need to be considered in designing MAC to operate in multi-hop wireless networks. First, the hidden-node problem. It is still an open challenge to find mechanisms that efficiently solve the collisions caused by hidden nodes. A collision-free scheme proposed in [33] or the handshake based coordinated access could be a starting point to combat the hidden-node collisions in wireless mesh networks. Secondly, due to the heterogeneity of mesh nodes (e.g., different number of antennas at nodes), MAC protocols for wireless mesh networks need to be designed with the capability of swiftly switching among MU-MIMO, SU-MIMO, multi-packet and single-packet transmission schemes. Thirdly, MAC and routing protocols need to be jointly designed. There could be multiple destinations involved in a MU-MIMO transmission, and some destinations could be out of the one-hop transmitting range, in which case, routing strategies should be able to forward multiple packets to different nodes in parallel.


  1. Cisco, “802.11ac: The Fifth Generation of Wi-Fi,” in Cisco White Paper, pp. 1–25, 2012.
  2. M. Kihl, P. Ödling, C. Lagerstedt, and A. Aurelius, “Traffic Analysis and Characterization of Internet User Behavior,” in ICUMT, pp. 224–231, 2010.
  3. F. Wamser, R. Pries, D. Staehle, K. Heck, and P. Tran-Gia, “Traffic Characterization of a Residential Wireless Internet Access,” Telecommunication Systems, vol. 48, no. 1-2, pp. 5–17, 2011.
  4. Cisco, “Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2012-2017,” in Cisco White Paper, pp. 1–34, 2013.
  5. IEEE Standard for Information Technology–LAN/MAN–Part 11: Wireless LAN Medium Access Control and Physical Layer Specifications–Amendment: Enhancements for Higher Throughput,” IEEE Std 802.11n, pp. 1–565, 2009.
  6. IEEE Standard for Information technology-Telecommunications and Information Exchange Between Systems-Part 11-Amendment 4: Enhancements for Very High Throughput for Operation in Bands below 6 GHz,” IEEE 802.11ac, pp. 1–425, 2013.
  7. R. Liao, B. Bellalta, C. Cano, and M. Oliver, “DCF/DSDMA: Enhanced DCF with SDMA Downlink Transmissions for WLANs,” in BCFIC, pp. 96–102, 2011.
  8. R. Liao, B. Bellalta, and M. Oliver, “DCF/USDMA: Enhanced DCF for Uplink SDMA Transmissions in WLANs,” in IWCMC, pp. 263–268, 2012.
  9. L. X. Cai, H. Shan, W. Zhuang, X. Shen, J. W. Mark, and Z. Wang, “A Distributed Multi-User MIMO MAC Protocol for Wireless Local Area Networks,” in GLOBECOM, pp. 4976–4980, 2008.
  10. E. Kartsakli, N. Zorba, L. Alonso, and C. V. Verikoukis, “Multiuser MAC Protocols for 802.11n Wireless Networks,” in ICC, pp. 1–5, 2009.
  11. M. X. Gong, E. Perahia, R. Stacey, R. Want, and S. Mao, “A CSMA/CA MAC Protocol for Multi-User MIMO Wireless LANs,” in GLOBECOM, pp. 1–6, 2010.
  12. C. Zhu, A. Bhatt, Y. Kim, O. Aboul-magd, and C. Ngo, “MAC Enhancements for Downlink Multi-user MIMO Transmission in Next Generation WLAN,” in CCNC, pp. 832–837, 2012.
  13. J. Cha, H. Jin, B. C. Jung, and D. K. Sung, “Performance Comparison of Downlink User Multiplexing Schemes in IEEE 802.11ac: Multi-user MIMO vs. Frame Aggregation,” in WCNC, pp. 1514–1519, 2012.
  14. H. Jin, B. C. Jung, H. Y. Hwang, and D. K. Sung, “Performance Comparison of Uplink WLANs with Single-User and Multi-User MIMO Schemes,” in WCNC, pp. 1854–1859, 2008.
  15. P. X. Zheng, Y. J. Zhang, and S. C. Liew, “Multipacket Reception in Wireless Local Area Networks,” in ICC, vol. 8, pp. 3670–3675, 2006.
  16. K. Tan, H. Liu, J. Fang, W. Wang, J. Zhang, M. Chen, and G. M. Voelker, “SAM: enabling practical spatial multiple access in wireless LAN,” in INFOCOM, pp. 49–60, ACM, 2009.
  17. F. Babich and M. Comisso, “Theoretical Analysis of Asynchronous Multi-packet Reception in 802.11 Networks,” IEEE Transactions on Communications, vol. 58, no. 6, pp. 1782–1794, 2010.
  18. T. Tandai, H. Mori, and M. Takagi, “Cross-layer-optimized user grouping strategy in downlink multiuser MIMO systems,” in VTC, pp. 1–6, IEEE, 2009.
  19. S. Zhou and Z. Niu, “Distributed Medium Access Control with SDMA Support for WLANs,” IEICE Transactions, vol. 93-B, no. 4, pp. 961–970, 2010.
  20. Y. J. Zhang, “Multi-round contention in wireless LANs with multipacket reception,” IEEE Transactions on Wireless Communications, vol. 9, pp. 1503–1513, Apr. 2010.
  21. D. Jung, R. Kim, and H. Lim, “Asynchronous Medium Access Protocol for Multi-User MIMO Based Uplink WLANs,” IEEE Transactions on Communications, vol. 60, no. 12, pp. 3745–3754, 2012.
  22. H. Shen, S. Lv, Y. Sun, X. Dong, X. Wang, and X. Zhou, “Concurrent Access Control Using Subcarrier Signature in Heterogeneous MIMO-Based WLAN,” in MACOM, pp. 109–121, 2012.
  23. H. Jin, B. C. Jung, H. Hwang, and D. K. Sung, “A Throughput Balancing Problem between Uplink and Downlink in Multi-user MIMO-Based WLAN Systems,” in WCNC, pp. 1–6, 2009.
  24. H. Li, A. Attar, and V. C. M. Leung, “Multi-User Medium Access Control in Wireless Local Area Network,” in WCNC, pp. 1–6, 2010.
  25. E. H. Ong, J. Kneckt, O. Alanen, Z. Chang, T. Huovinen, and T. Nihtila, “IEEE 802.11ac: Enhancements for Very High Throughput WLANs,” in PIMRC, pp. 849–853, 2011.
  26. O. Aboul-Magd, U. Kwon, Y. Kim, and C. Zhu, “Managing downlink multi-user mimo transmission using group membership,” in Consumer Communications and Networking Conference (CCNC), 2013 IEEE, pp. 370–375, IEEE, 2013.
  27. G. Bianchi, “Performance analysis of the ieee 802.11 distributed coordination function,” Selected Areas in Communications, IEEE Journal on, vol. 18, no. 3, pp. 535–547, 2000.
  28. .
    G. Chen and B. Szymanski, “Component Oriented Simulation Toolkit.” http://www.ita.cs.rpi.edu/cost.html.
  29. G. Chen, J. Branch, M. Pflug, L. Zhu, and B. Szymanski, “SENSE: a wireless sensor network simulator,” in Advances in pervasive computing and networking, pp. 249–267, Springer, 2005.
  30. B. Bellalta, J. Barcelo, D. Staehle, A. Vinel, and M. Oliver, “On the Performance of Packet Aggregation in IEEE 802.11ac MU-MIMO WLANs,” IEEE Communications Letters, vol. 16, no. 10, pp. 1588–1591, 2012.
  31. A. Kumar, E. Altman, D. Miorandi, and M. Goyal, “New insights from a fixed point analysis of single cell ieee 802.11 wlans,” in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 3, pp. 1550–1561, IEEE, 2005.
  32. IEEE Standard for Information Technology–LAN/MAN–Part 11: Wireless LAN Medium Access Control and Physical Layer Specifications–Amendment: Medium access control (MAC) Enhancements for Quality of Service,” IEEE 802.11e, pp. 1–211, 2005.
  33. J. Barcelo, B. Bellalta, C. Cano, A. Faridi, and M. Oliver, “On the distributed construction of a collision-free schedule in multi-hop packet radio networks,” Springer Telecommunication Systems, pp. 1–14, 2013.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description