Open Access

Solving hidden terminal problem in MU-MIMO WLANs with fairness and throughput-aware precoding and a degrees-of-freedom-based MAC design

  • Sanjeeb Shrestha1Email author,
  • Gengfa Fang1,
  • Eryk Dutkiewicz2 and
  • Xiaojing Huang3
EURASIP Journal on Wireless Communications and Networking20162016:112

Received: 6 October 2015

Accepted: 9 April 2016

Published: 22 April 2016


We generally emphasize that the zeroforcing (ZF) technique backed by an appropriate medium access control (MAC) protocol can be used to address the inevitable hidden terminal (HT) problem in multi-user multiple input multiple output (MU-MIMO) wireless local area network (WLAN) settings. However, to address the implementation-specific requirements of MU-MIMO WLANs, such as fairness in client access and throughput of the network, we propose a fairness and a throughput-aware ZF precoding in our design at the physical layer (PHY). This precoding scheme not only solves the HT problem but also meets the fairness and the throughput requirements of MU-MIMO WLANs. Besides, we design a MAC layer protocol, supportive to PHY, which decides transmission opportunities (TXOPs) among access points (APs) based on the available degrees of freedom (DoF). We make a mandatory provision in our design that APs should have a sufficient DoF. This can ensure collision-free transmission whenever APs/transmitters transmit in the HT scenario. Additionally, we design an improved channel sounding process for MU-MIMO WLANs with a less signaling overhead than IEEE802.11ac.

We demonstrate the feasibility of our PHY in a USRP2/GNU Radio testbed prototype in the lab settings. It is found that our PHY improves the SNR and effective SNR of the received signal from about 5 to 11 dB in the HT scenario.

The performance of our MAC design is checked with simulation studies in a typical six-antenna AP and clients scenario. We observe that our MAC protocol has a slightly higher signaling overhead than traditional ready to send/clear to send (RTS/CTS) due to design constraints; however, the signaling time overheads are reduced by 98.67 μs compared to IEEE802.11ac. Another interesting aspect to highlight is the constant Throughput gain of four to five times that of the traditional RTS/CTS. Our MAC protocol obtains this gain as early as 98.67 μs compared to IEEE802.11ac.


Hidden terminals Precoding vector Degrees of freedom Transmission opportunity Fairness Network throughput

1 Introduction

Today wireless local area networks (WLANs) are very popular, and this trend is growing in an ubiquitous fashion. The penetration of WLANs is recorded as almost more than 70 % in household and business enterprises and about 30 % in public sectors such as transport, leisure, events, and streets, ( Meanwhile, the growing use of multimedia services with heterogeneous hardware such as iPhones, laptops, HDTV, tablets, and the dependency of enterprises on WLANs for mission-critical networks have made WLANs dynamic in topologies, complex in irregular traffic patterns, and challenging from an architectural view point. Measurements from production LANs [1] show that collisions of frames in WLANs are bound to happen, where transmission loss due to interference among 50 % of sender receiver pairs suffer a 2.5 % probability of transmission loss. While IEEE802.11 carrier sense multiple access/collision avoidance (CSMA/CA) with ready to send/clear to send (RTS/CTS) has become a de-facto mechanism to avoid collisions, there exist inherent limitations as to how it treats interference at the receiver related to the carrier sensing at the transmitter. However, the fact is that successful transmissions mostly depend on an interference-free condition at the receiver. Theoretical and experimental work on CSMA/CA [2, 3] show that the CSMA/CA mechanism degrades performance due to poor spatial reuse. Besides, it also fails to address the hidden terminal (HT) problem [4] and capture effect [5] issues. Nonetheless, HT nodes (that do not sense each other’s transmission though they interfere with each other at the intended receiver causing decoding failure) are an inevitable phenomenon in WLANs and their impact on network throughput cannot be overlooked. The study in [6] reveals that HTs lead to about 40–42 % of collision loss.

In early years, a receiver-initiated busy-tone scheme was proposed to solve the HT problem for packet radio networks (PRN) and was found to be effective in eliminating collisions caused by HTs [4]. However, the scheme required a dedicated channel for the busy tone which is not desirable in wireless networks. Karn proposed the RTS/CTS mechanism as a part of MACA [7] to address the HT problem; however, experimental results show that RTS/CTS significantly reduces the overall throughput [8].

A recent study proposed a lightweight wireless handshake [9] where the header of the payload and ACK are separated and designed to act like RTS/CTS. Nonetheless, packet decoding in dynamic channels is a fundamental limitation for that approach. In addressing the HT in WLANs, adopting the solution used in CDMA is not viable as it requires tight power control and special codes [10], and at high SNRs, the performance is degraded. An alternative technique like zigzag decoding [11] analyzes collisions of packets with strategically selected collision patterns which show a significant packet reduction loss from 72.06 % to about 0.7 % in a test bed of 14 USPR nodes. Moreover, it needs to have a collision-free chunk to bootstrap decoding in an irregular traffic pattern such as in WLAN scenarios.

In the multi-antenna wireless network scenario, the physical layer (PHY) technique such as zeroforcing (ZF) has been used to design a medium access control (MAC) protocol [12, 13] and [14], where HT problem is briefly discussed. In [12], ZF beamforming technique for null steering similar to [13] was used in mesh networks. However, it did not limit the channel bandwidth by splitting the channel into control and data sub-channels as in [13]. The flip side of the scheme was the inefficient use of the spectrum because after every successful communication sessions, nodes were supposed to keep silent for a certain period of time specified in the field silent period in RTS and CTS so that they might not disturb neighbors’ communications. Likewise, ZF beamforming technique enabling spatial reuse was presented in reference to IEEE802.11s in [14]. However, the scheme relies on optional mesh coordinated channel access (MCCA) for channel access which is challenging from synchronization aspects in such a decentralized mesh network.

We present a fairness and a throughput-aware ZF precoding to deal with the HT problem in multi-user multiple input multiple output (MU-MIMO) WLANs. The PHY design is supported by a degrees of freedom (DoF)-based MAC protocol. Unlike its precursors that used ZF null steering approach for MAC design [1214] and other HT solutions [4, 7, 9, 11], our design excels in twofolds. First, it maintains concurrent transmissions in the HT scenario (managed by our extended PCF). Second, it preserves fairness among access points (APs) (by the fairness algorithm) while deciding the transmission opportunities (TXOPs) for APs.

The authors have also published a MAC design to solve the HT problem based on ZF beamforming in [15]. There were two major focuses. First, it illustrates that ZF beamforming is feasible for solving the HT problem in MU-MIMO WLANs. Second, it shows an outline of a MAC design which specifically introduced and discussed DoF-based TXOPs for APs, active and silent mode for APs and concurrent algorithm for clients’ selection. However, in this paper, we have worked out the finer details of our proposed solution for the HT problem and came up with interesting concepts both at PHY and medium access control (MAC) layer. Specifically, at the PHY, fairness in clients access along with the throughput of the network is given utmost importance. Thus, we proposed a fairness and throughput-aware ZF precoding to solve the HT problem. At the MAC, specifically, we refined the channel sounding process and clearly indicated the way to distinguish between the desired and the undesired clients in the network. Additionally, medium access of APs and clients in both the downlink and the uplink, and the transition of our extended PCF to standard distributed coordinated function (DCF) and vice versa, are distilled on an event by event basis. DoF-based TXOPs and the concurrent algorithm are illustrated in detail.

For instance, take the example in Fig. 1, where there are deployments of three distributed APs, AP1 (in blue), AP2 (in green), and AP3 (in violet), with their clients. Due to the nature of dynamic topologies, the non-isotropic nature of the wireless transmission range, mixed-mode 802.11b/g/n usage, dense deployments, decentralized control, etc., they are all out of the carrier sensing range of each other but their transmissions overlap. As a result when APs transmit to their desired clients (meaning that they belong to the same network marked with the same colors), the undesired clients (meaning that they do not belong to the same network, marked with different colors) suffer collision of signals from their respective hidden APs, i.e., AP1, AP2, and AP3.
Fig. 1

Hidden terminals. The figure illustrates the general hidden terminal problem in a MU-MIMO WLAN with the examples of the ith, jth, and kth network AP2, AP1, and AP3 along with their clients in similar colors

From a high-level view, our proposed design makes the APs null their signals at the undesired clients (marked with different colors) while transmitting to the desired clients (marked with the same color) within their transmission range1. The aim is to ensure that, when the desired APs transmit to all the desired clients, there will not be any collision of signals. In such an approach, neither of the APs has to listen and wait before transmission as is the case when using RTS/CTS, nor do the receiver clients have to re-encode any former decoded chunks as in the successive interference cancellation (SIC) scheme [16].

However, since APs lose as many DoFs as the number of antennas in which they cancel interference [17], this mainly brings two implications in the design. First, fairness issues among the desired clients and network throughput of an AP from the single-AP perspective. Second, TXOPs of the distributed APs in the HT scenario from the multiple APs’ perspective. Both implications are discussed in detail in Section 3.

Our proposed design addresses these implications while solving the HT problem in MU-MIMO WLANs. The key contributions are as follows:

First, we propose a fairness and a throughput-aware ZF precoding at PHY to address the HT problem in MU-MIMO WLAN settings. For this, we specifically design a concurrent algorithm (described in detail in Section 4.1) based on both the packet queue position and the best quality of the channels between the APs and the desired clients at any instant (We refer this a concurrent algorithm based on first in first out (FIFO) + the Best of the Two Choices). Thus, our proposed design is able to maintain both the fairness among the clients and the network throughput in MU-MIMO WLANs while solving the HT problem.

Second, conceptually, the proposed solution exploits the time as well as the available DoF (permitted by the deployment of multiple antennas both at the APs and the clients) in MU-MIMO WLANs to address the HT problem. Specifically, the exploitation of DoFs enables us to decide the TXOPs among the APs involved in HT scenario. This is in contrast to the popular RTS/CTS scheme where a time-division approach is basically used for TXOPs.

Third, the proposed solution basically converts the HT problem into the scenario where transmitters (APs in the downlink and clients in the uplink) can transmit concurrently without collision. Our MAC simulation studies show that the concurrent transmissions yield a network throughput of four times compared to the traditional RTS/CTS scheme. This gain would otherwise be wasted with the RTS/CTS scheme where all nodes have to listen to the medium and wait for a random amount of time for transmission to avoid the collision of signals.

Fourth, we propose a modified channel sounding process for MU-MIMO WLANs in MAC, which has a reduced signaling time overhead of 98.67 μs than IEEE802.11ac’s signaling time overhead. APs in our design used this process to acquire channels from the desired and undesired clients within their transmission range.

Fifth, we tested the feasibility of our proposed PHY solution in a simple hardware platform consisting of URSP2/GNU Radio in lab settings. The results showed a notable received SNR gain from 5 to 11 dB compared to the HT scenario.

The rest of the paper is arranged as follows: Section 2 presents the HT-based system model in MU-MIMO WLANs. Section 3 presents a design overview. Section 4 illustrates the fairness and the throughput-aware precoding whereas Section 5 deals with our medium access control protocol. Section 6 describes our experimental setup. Performance evaluation is presented in Section 7, and a conclusion is presented in Section 8.


The superscript (.) H denotes the Hermitian transpose whereas the operators \({\mathbb {E}}\left [. \right ]\) and . denote the expectation and the Euclidean norm, respectively. The matrices, vectors, and scalars are defined as they are used.

2 Hidden terminal-based system model in MU-MIMO WLANs

Consider a HT scenario as shown in Fig. 2 where the ith network AP2 and the jth network AP1 are out of carrier sensing range of each other, so they cannot hear each other’s transmissions. However, AP1 and AP2 can transmit to their clients, “I4,” “I5,” and “I6” and “I1,” “LP,” “I2,” “HDTV,” and “I3,” respectively, at the same time, causing collision of signals and decoding failure.
Fig. 2

The hidden terminal problem with a specific two-network scenario, i.e., K = 2. This is the hidden terminal-based system model in MU-MIMO WLANs that we have considered, with the jth network reference client “I4”. Here, we have taken K=2 APs, out of which AP1 is the desired AP for “I4” whereas the remaining ith network AP2 is a hidden AP. Given K hidden APs, there are K APs interfering with the desired transmission at the jth network client “I4”

For simplicity and ease of discussion, we assume clients I1(1), I2(1), I3(1), I4(1), I5(1), and I6(1) have one antenna whereas clients LP(2) and HDTV(2) have two antennas. The corresponding antenna/s associated with the clients is/are shown in parentheses whenever necessary.

Suppose there are K access points (APs) who are out of carrier sensing range of each other and are transmitting simultaneously. Clearly, at one of the jth reference clients I4, we have collision of signals that are coming from K−1 HT nodes. For simplicity and ease of discussion, we take the jth network AP1 and client I4 as a reference as shown in Fig. 1. We consider N transmitting antennas (different for each AP) at the APs and M receiving antennas (different for each client) at the clients.

The received signal at the jth network client I4 is now given by
$$ {\mathbf{y}} = {\sum\nolimits}_{i = 1,2..j,..}^{K} {{\mathbf{h}}_{ij}^{H} {{\mathbf{x}}_{i}}} + {{\mathbf{w}}} $$
where the received signal is \({{\mathbf {y}}} \in {\mathbb {C}^{M \times 1}}\), h ij is the channel associated with the ith AP to the jth client, \({{\mathbf {h}}_{ij}} \in {\mathbb {C}^{N \times M}}\), and transmitted signal \({{\mathbf {x}}_{i}} \in {\mathbb {C}^{N \times 1}}\). The noise term is represented by \({\mathbf {w}} \in {\mathbb {C}^{M \times 1}}\) and is modeled as circularly symmetric additive white Gaussian noise with zero mean and σ 2 variance. All the APs satisfy the transmit power constraint P, i.e., \(E\left \| {{\mathbf {x}}_{i}^{2}} \right \| < P,\) for i{1,..,j−1,j,….K−1,K}. The concatenation of channels at the jth network client I4 is given by
$$ \mathbf{H} = \left[ {\mathbf{h}_{1j}^{H},\mathbf{h}_{2j}^{H},.~. \ldots\mathbf{h}_{jj}^{H},\ldots\ldots\mathbf{h}_{K - 1j}^{H},\mathbf{h}_{Kj}^{H}} \right] $$

where H is a [M×K N] matrix with the jth row equal to the channel of the K APs to the jth antenna element of the jth client with M antennas.

We assume that the interference level at each receiver/client in our system model is in the weak interference regime, i.e., the interference is at 0<a=ba where a and b are interference coefficients (if a two-interferer-based interference channel (IFC) is considered) and a is the critical value where there is a sudden change in the slope [18]. By this, we mean that, first, the receivers make no attempt to decode and subtract the received interference from K−1 APs to get their desired signal. Second, the only way to get rid of collision of signals at the receivers in our system model is by preventing the interferences reaching the receivers. The main justification for this assumption is that, in most envisioned MU-MIMO WLAN applications, clients would use receivers with a simple architecture. Additionally, in a dynamic environment of WLANs, interference subtraction is difficult as the receivers do not know the coding and modulation schemes used by the interfering transmitters.

Our assumption is directly in contrast with the presence of a very strong interference, where Carleial [19] in 1975 showed the striking fact that very strong interference is as innocuous as no interference. The interfering signals are so strong in this case that the receivers may decode them reliably and subtract them from the received signal to obtain the desired signal.

3 Design overview

We propose a fairness and a throughput-aware ZF precoding at PHY to address the HT problem in MU-MIMO WLANs. The PHY design is supported by a MAC protocol based on DoF, provided by the use of an excess service antennas both at APs and clients in MU-MIMO WLANs. Additionally, we present a modified channel sounding process with less signaling time overhead than IEEE802.11ac. Given uplink and downlink traffic, without loss of generality, we focus on downlink.

3.1 Precoding for MU-MIMO in our design

To place our design’s precoding algorithm in context, we begin with a brief introduction to conventional zeroforcing beamforming (ZFBF) referenced to a multiuser MIMO interference channel (MU-MIMO-IC). Subsequently, we discuss the application-specific requirements of MU-MIMO WLANs. The aim is to highlight the need to adopt and enhance the classical ZFBF to effectively address the HT problem in MU-MIMO WLANs. Finally, we present an algorithm to precode APs’ transmissions in a HT scenario with twofold benefits: first, to cancel interference to undesired clients and remove collision of signals. Second, to maintain concurrent transmission to desired clients with optimal fairness and network throughput.

3.1.1 Premier-Zeroforcing beamforming in multiuser interference channel

ZFBF is a transmission strategy where the SNR of each desired stream is maximized subject to the constraint that interference to other clients is completely eliminated [20, 21].

Consider a MU-MIMO interference channel (IC) with K transmitters having N antennas and their corresponding receivers, each with a single antenna as in a typical multiple input single output (MISO) system. The interference to the undesired receivers is completely eliminated by ZFBF. Thus, the best ZF beamforming vector for any ith transmitter is given by solving the following optimization problem for i{1,……K}
$$\begin{array}{@{}rcl@{}} \mathop{\max}\limits_{{{\mathbf{v}}_{i}}} ~\log \left({1 + \frac{{{{\left| {{\mathbf{h}}_{ii}^{H}\mathbf{v}_{i}} \right|}^{2}}}}{{{\sigma_{i}^{2}}}}} \right) \\ s.t~{\left| {{\mathbf{h}}_{ij}^{H}{{\mathbf{v}}_{i}}} \right|^{2}} & = & 0~\forall j \ne i\\ {\left\| {{{\mathbf{v}}_{i}}} \right\|^{2}} & \leqslant & {P_{i}} \end{array} $$

where \({\left | {{\mathbf {h}}_{ij}^{H}{{\mathbf {v}}_{i}}} \right |^{2}} = 0\) is the ZF leakage constraint of the ith transmitter to the jth receiver. The optimization problem has a non-trivial solution given by \({\mathbf {v}}_{i}^{ZF} = c\prod _{\left [ {{h_{i1}},\ldots \ldots.{h_{ii - 1}},{h_{ii + 1}}\ldots \ldots.{h_{iK}}} \right ]}^ \bot {{\mathbf {h}}_{ii}}\), where c is the scalar satisfying the transmit power constraint. The necessary condition for the non-trivial solution is that the number of antennas at transmitter N is greater than and equal to the number of antennas at receiver M, i.e., \(N \geqslant M\).

The signal-to-interference plus noise ratio (SINR) for the jth client in a network is given by
$$ \mathrm{SIN{R}}_{\mathrm{j}} = \frac{{{{\left| {{\mathbf{h}}_{jj}^{H}{{\mathbf{v}}_{j}}} \right|}^{2}}}}{{{\sigma_{j}^{2}} + \sum\limits_{i\ne j}^{K-1} {{{\left| {{\mathbf{h}}_{ij}^{H}{{\mathbf{v}}_{i}}} \right|}^{2}}} }}. $$

3.2 Design challenges

It is evident from the system model presented in Fig. 2 that the HT scenario in MU-MIMO WLANs basically corresponds to a multiuser IC as discussed in Section 3.1.1. In such cases, one may wonder whether the solution to the optimization problem in (3) can be applied to remove interference to the undesired clients and manage collision of signals arising from the HT problem.

However, the solution is not so straightforward, as there are application-specific requirements in MU-MIMO WLANs (which are to be discussed shortly). The design challenge may be in the calculation of a precoding vector which not only solves the HT problem but also meets the application-specific requirements of MU-MIMO WLANs.

Unlike cellular systems, MU-MIMO WLANs have heterogeneous antenna clients (it may be at home networks or office network settings or elsewhere) such as iPhones, laptops, HDTVs. The numbers of antennas these clients possess are different. It may be due to space and cost constraints. For instance, iPhones have a single antenna whereas laptops and HDTVs can have two or more than two antennas. In the HT scenario, APs in MU-MIMO WLANs are entitled to serve heterogeneous antenna clients with two contrasting objectives: (a) fairness in client access among (heterogeneous) desired clients and (b) maximize the network throughput. These specific objectives put a stringent requirement on the precoding vector while we address the HT problem in MU-MIMO WLANs. We shall shortly discuss the implications of the specific objectives and our approach to the solution. Without loss of generality, we focus on downlink.

For instance, consider the previous MU-MIMO WLANs in Fig. 2. Specifically, whenever the six-antenna AP2 decides to transmit, it has to satisfy two conditions. First, remove interference to the undesired clients (I4 and I5) to get rid of the collision when AP1 transmits to them. Second, maintain concurrent transmission among the desired clients (I1, LP, I2, HDTV, and I3). It is worthwhile to note that in our design, both conditions have to be satisfied at the APs (focusing on downlink) at the same time by an appropriate precoding vector based on ZFBF.

For calculation of the precoding vector, APs have to consider the channel realization associated with the undesired clients, since interference cancellation is an important step in our design (the detailed process for acquiring channel state information (CSI) is given in Section 5.1). Having said that, it also becomes equally important for AP2 to consider who among the desired clients I1, LP,I2, HDTV, and I3 are served concurrently.

We highlight that the choice of the desired clients is vital in two respects. First, it is related to the concurrent transmission among the desired clients, which in fact is associated with the AP’s network objectives such as maximizing the network throughput or maintaining fairness among the served clients and or both. We may consider this scenario as a popular load-balancing problem among desired clients. Second, the choice of the desired clients forms an integral part in the precoding vector (detailed description is given in Section 4, Step 3, and Subsection 4.1) which AP2 needs to calculate before transmission.

In summary, the design challenge for the HT problem in MU-MIMO WLANs with heterogeneous desired and undesired clients is to calculate a suitable precoding vector at the APs so that it can achieve the following simultaneously: (a) remove interference to undesired clients and avoid collision of signals and (b) maintain fairness and network throughput among the desired clients with concurrent transmissions.

Additionally, as there can be many APs involved in causing the HT problem within a certain network in an area, another challenge is to design an appropriate decision-making scheme which can address the TXOP issue among APs.

We shall now discuss fairness and network throughput in concurrent transmissions and TXOP among APs in more detail.

3.2.1 Fairness and network throughput with concurrent transmissions

The ZF solution allows APs to transmit to their desired clients simultaneously/concurrently, while at the same time canceling interference to undesired clients in their transmission range in order to avoid collision of signals. We recall the fact that interference cancellation by APs to undesired clients with ZF costs precisely as many DoFs of APs as the number of antennas at the undesired clients. This means that APs with the remaining DoF have to operate concurrent transmissions among the desired clients and at the same time cancel interference to the undesired clients.

For instance, consider the previous network at Fig. 2. Whenever AP2 is supposed to transmit, addressing the HT problem existing there by using our design costs AP2 exactly two DoFs to remove interference to the undesired clients (i.e., I4(1) and I5(1)). Recall that the number in parentheses indicates the number of antenna/s each client possesses. Thus, AP2 can have only four DoFs, by which it can at most serve four antennas concurrently while canceling interference to the undesired clients at the same time.

However, there are five desired clients; namely I1, LP, I2, HDTV, and I3 in the ith network to be served. Now, the critical question is how AP2 with TXOP chooses the clients from the desired clients so that the remaining DoF that AP2 has (i.e., 4) can be best utilized in favor of network objectives such as maximizing the network throughput or maintaining fairness among the served clients or both. We may view this scenario as a popular load-balancing problem. Among many possible solutions, we focus our discussion on the fairness issue among the desired clients and the throughput of the network. The detailed discussion for the fairness and the network throughput-aware ZF precoding is given in Section 4.

3.2.2 DoF-based transmission opportunity (TXOP) of APs/transmitters

Unlike the traditional time division-based medium-access mechanism in WLANs, our medium-access mechanism for ZFBF is based on both time and the remaining DoF of APs/transmitters. It is worthwhile to note that, instead of dealing with the total available DoF of the APs, we deal with the remaining DoF of the APs. The obvious reason is that ZF precoding loses as many DoFs as the number of antennas where interference cancellation is done.

The traditional contention-based time division medium access for transmitters becomes inadequate for our fairness and throughput-aware ZF-based PHY design, as this would cause interference to undesired clients, if transmitters win contention at some instant but do not possess the required DoF for transmission. Thus, it becomes imperative to design a medium-access mechanism based on both time and the remaining DoF of transmitters. We aim to ensure that transmitters would have sufficient available DoF at the time they win contention for the medium and have TXOP.

The detailed discussion for TXOP among the transmitters is given in Section 5.2.

We shall now address the two design challenges, as discussed above, from PHY and MAC perspectives. Network throughput and fairness with concurrent transmissions are illustrated from a PHY perspective whereas the TXOP of APs/transmitters is addressed in MAC.

4 Fairness and network throughput-aware precoding

The design objective of our PHY is to calculate a suitable precoding vector at APs which is not only fairness aware in terms of service access to clients but also supports maximum throughput in the network. The PHY of our design obtains the precoding vector in the following steps: ∙ Step 1 APs go for channel sounding and measure the CSI within their transmission range from both the desired, i.e., \({\mathbf {H}_{i{i_{Q}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},\ldots \ldots..,{\mathbf {h}_{i{i_{Q}}}}} \right ]\), and undesired, i.e., \({\mathbf {H}_{i{i_{P}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},\ldots \ldots..,{\mathbf {h}_{i{i_{P}}}}} \right ]\) clients. Thus, the total CSI is \(\mathbf {H} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},\ldots \ldots..,{\mathbf {h}_{i{i_{Q}}}},{\mathbf {h}_{i{j_{1}}}},{\mathbf {h}_{i{j_{2}}}},\ldots {\mathbf {h}_{i{j_{P}}}}} \right ]\) where the number of desired clients and undesired clients, are Q and P, respectively. A detailed description of channel sounding for the desired and the undesired clients, including the ways to distinguish them, is given in Section 5.1. ∙ Step 2 APs know the number of antennas they possess, i.e., N in our system model, and the number of antennas at undesired clients (i.e., PM in our system model) due to channel sounding in Step 1. Then, APs check whether N>P M for TXOP. Note that our MAC checks N>P M rather than \(N \geqslant PM\) at APs. The aim is to ensure that APs at least have 1 DoF after TXOP.

If the condition is satisfied, the APs win the TXOP and remain in an “active mode”; otherwise, they lose TXOPs at that instant and remains in a “silent mode”. The reason for remaining in the active mode and the silent mode is obvious. Those APs who have available DoF have the ability to remove interference to the undesired clients, so they will remain in the active mode and be ready for concurrent transmission in the next step. Otherwise, APs will remain in the silent mode because if they transmit with the lack of available DoF, they end up interfering with some undesired clients within their transmission range, causing collision of signals. More details about the modes of APs are discussed in Section 5.2. ∙ Step 3 Before the active mode APs go for concurrent transmissions, they should know how many concurrent transmissions have to be made. APs calculate this by checking how many remaining DoF they have at that instant, i.e., (NP M)>0. The obvious reason is that we can at most have as many concurrent transmissions as the remaining DoFs that APs have in the active mode.

For instance, let (NP M)=D, where D is the number of remaining DoFs of APs. Now, APs run the concurrency/scheduling algorithm and select D out of Q channel realizations keeping in mind the network throughput and fairness among the desired clients. For instance, \({\mathbf {H}_{i{i_{D}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},\ldots \ldots..,{\mathbf {h}_{i{i_{D}}}}} \right ]\) are the channel realizations of the selected clients by the concurrency algorithm where \({\mathbf {H}_{i{i_{D}}}}\) is a subset of \({\mathbf {H}_{i{i_{Q}}}}\), i.e., \({\mathbf {H}_{i{i_{D}}}} \subset {\mathbf {H}_{i{i_{Q}}}}\), and the number of channel realizations are less than (if there are insufficient clients request an uplink) or equal to the remaining DoFs, i.e., \({\mathbf {H}_{i{i_{D}}}} \le \left ({N - PM} \right)\).

The mechanism on how \({\mathbf {H}_{i{i_{D}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},\ldots \ldots..,{\mathbf {h}_{i{i_{D}}}}} \right ]\) is selected is part of the concurrency/scheduling algorithm, and detailed discussions are given in Section 4.1. ∙ Step 4 After \({\mathbf {H}_{i{i_{P}}}}\) and \({\mathbf {H}_{i{i_{D}}}}\) are determined in step 1 and step 3, the precoding vector is calculated. As for example, the precoding vector \({{\mathbf {v}}_{i}} \in {\mathbb {C}^{N \times 1}}\) for AP2 is given by
$$ {\mathbf{v}_{i}} = {\frac{{\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{i{i_{D}}}}} }}{{\left\| {\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{i{i_{D}}}}}} \right\|}}\mathbf{U}} $$

where \(\prod _{{{\mathbf {H}}_{ij_{P}}}}^ \bot = {\mathbf {I_{N}}} - {{\mathbf {H}}_{ij_{P}}}{\left ({{\mathbf {H}}_{ij_{P}}}^{H}{{\mathbf {H}}_{ij_{P}}}\right)^{- 1}}{{\mathbf {H}}_{ij_{P}}}^{H}\) denotes the projection onto the orthogonal complement of the column space of \(\mathbf {H}_{ij_{P}}\). I N represents the identity matrix of size N. \({\mathbf {U}} \in {\mathbb {C}^{DM \times 1}}\) is a unit vector acting as a demultiplexer where U H U=1. The condition NP M has to be satisfied in order to take the left inverse.2

The received signal at the jth reference client I4 of the jth network AP1 is given by
$${} \mathbf{y} = \mathbf{H}_{j{j_{D}}}^{H}\frac{{\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{j{j_{D}}}}} }}{{\left\| {\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{j{j_{D}}}}}} \right\|}}\mathbf{U}~{s_{j}} + \sum\limits_{i \ne j}^{K - 1} {\mathbf{H}_{i{j_{P}}}^{H}\frac{{\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{i{i_{D}}}}} }}{{\left\| {\prod\nolimits_{{\mathbf{H}_{i{j_{P}}}}}^ \bot {{\mathbf{H}_{i{i_{D}}}}}} \right\|}}} \mathbf{U}~{s_{i}} + \mathbf{w}. $$

4.1 Concurrent algorithm

After winning the TXOP, the active mode APs decide which of the desired clients within the network are to be served concurrently, i.e., APs select D out of Q clients. APs in our design make this decision with the help of a concurrent algorithm which runs at APs.

It is imperative to note that the concurrent algorithm is an integral part of determining the precoding vector at PHY in our design, as described in Section 4, step 3. In this section, we illustrate how the concurrent algorithm is designed.

For instance, consider the previous network with AP2 with the remaining DoF equal to 4 and there are 5 desired clients namely, I1, LP, I2, HDTV, and I3, in the network to be served. Since AP2 in the network has only 4 remaining DoFs, it can at most serve four antennas concurrently. Now the critical question is how AP2 with TXOP chooses the clients among I1, LP, I2, HDTV, and I3 so that the objectives such as maximizing the network throughput or maintaining fairness among the served clients or/and both is/are met. We may view this scenario as a popular load-balancing problem among the desired clients.

For equal fairness among the clients within a network, desired clients can be served based on FIFO packet queues. As for example, suppose that the packets are queued thus: I1(1), LP(2), I2(1), HDTV(2), and I3(1). Recall that the number in parentheses indicates the number of antenna/s each client possesses. In the FIFO algorithm, the first four packets in the queue are taken (because six-antenna AP2 has only 4 remaining DoFs while it has to null signals to two antennas of the undesired clients) and will be served first and the remainder will be served accordingly. However, AP2 will be unable to use 1 DoF in some FIFO queue patterns, for example, (a) I1(1), I2(1), I3(1), (b) I1(1), LP(2) and (c) HDTV(2), I1(1), where two or three consecutive FIFO clients already occupy 3 DoFs (out of 4 DoFs) of AP2 and is followed by a two-antenna client request, either LP(2) or HDTV(2). This is for the reason that the selection of two-antenna clients would exceed the remaining DoFs of APs at that instant.

Additionally, clients are chosen according to the packet queue request, irrespective of the channel quality. Thus, this method is highly oblivious to the network throughput, though it can ensure fairness in terms of FIFO request queues.

For maximizing the network throughput, one can choose the Brute-Force approach, where all the combinations among the desired clients, subject to the number of antennas being equal to the remaining DoFs of AP (i.e., 4 in the example) are checked and the best among the combinations that maximizes the throughput are chosen.

As in the case considered with clients queue: I1(1), LP(2), I2(1), HDTV(2), and I3(1), we simply use a combination formula ([22], p17), i.e., \(\left ({\begin {array}{*{20}{c}} n \\ k \end {array}} \right) = \frac {{n!}}{{k!\left ({n - k} \right)!}},~\) whenever kn, for C(n,k), where n and k are 5 and 3, respectively, resulting in 10 combinations3 of desired clients. Out of the ten possible combinations, 4, being unable to satisfy the constraint that the total number of antennas should be equal to the remaining DoFs of AP, are discarded. Thus there are six combinations among the five desired clients: I1(1), LP(2), I2(1), HDTV(2), and I3(1).

We choose the best combination among the six possible combinations for concurrent transmission that maximize the throughput at that instant. Thus, the Brute-Force method will ensure a maximum throughput of the network. Nonetheless, it would undoubtedly end up with unfairness among the clients who cannot maximize throughput because they are not chosen for transmission. Also, this method can be very cumbersome for a large number of users, as the combinations grow because all the possible combinations of clients have to be checked.

In order to balance both the fairness and the throughput of the network, one possible solution would be the combination of the FIFO and the Best of the Two Choices. For fairness, we always select the first client in the queue for transmission. For the rest of the clients, we use the Best of the Two Choices. The Best of the Two Choices is one of the standard approaches for reducing the complexity of combinatorial problems [23].

For general illustrative purposes, we use the popular balls and bin model to show the superior performance of load balancing by the Best of the Two Choices [23]. Suppose that n balls are placed into n bins, with each ball being placed into a bin chosen independently and uniformly at random. Let the load of a bin be the number of balls in that bin after all balls have been placed. It is well known that, with high probability, the maximum load upon completion will be approximately \(\frac {{\ln ~n}}{{\ln \left ({\ln \left (n \right)} \right)}}\). Thus, it is evident that the load is not balanced in the system.

Suppose that the balls are placed sequentially, so that for each ball, we choose two bins independently and uniformly at random and place the ball into the less-full bin (breaking ties arbitrarily). In this case, the maximum load drops to \(\frac {{\ln \left ({\ln \left (n \right)} \right)}}{{\ln ~2}} + O\left (1 \right)\) with high probability.

Thus, we pick the first client in the queue for transmission to ensure fairness and the rest of the clients are chosen in accordance with a randomized design that exploits the Best of the Two Choices. In our considered scenarios of desired clients, I1, LP, I2, HDTV, and I3, this method results in four combinations out of all ten possible combinations. Thus, we take the best combinations among the four which ensures the maximum network throughput. Hence, the FIFO combined with the Best of the Two Choices balances both fairness and network throughput.

Out of the three concurrent algorithms discussed above, based on fairness and network throughput, we use the FIFO combined with the Best of The Two Choices as a part of the concurrency algorithm in our design. This gives us D selected desired clients leading to \({\mathbf {H}_{i{i_{D}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},........,{\mathbf {h}_{i{i_{D}}}}} \right ]\) as described in Section 4, step 3. The basic pseudo-code of the FIFO combined with the Best of the Two Choices is given as Algorithm 1. The simulation result of the concurrent algorithm is presented in Fig. 16.

It is imperative to note that the selection of the desired clients, i.e., \({\mathbf {H}_{i{i_{D}}}} = \left [ {{\mathbf {h}_{i{i_{1}}}},{\mathbf {h}_{i{i_{2}}}},........,{\mathbf {h}_{i{i_{D}}}}} \right ]\), with concurrency algorithm is an integral component for a fairness and network throughput-aware ZF precoding vector at APs as shown in the analytical expression in (5).

In a nutshell, a simple diagrammatic illustration of our design in PHY is given in Fig. 3. The fairness and network throughput-aware ZF precoding vector at APs satisfies the PHY objectives as described in Section 4.
Fig. 3

Diagrammatic illustration of the design in PHY. The figure basically illustrates our design in PHY. It depicts the way to calculate fairness and throughput aware ZF precoding vector at AP

5 Medium access control

Since the PHY solution of our protocol allows multiple APs to transmit concurrently to their desired clients without interference to undesired clients (alleviating the HT problem), we need to develop a MAC protocol suited for this.

Basically, the challenge for MAC is threefold. First, in order to get a suitable precoding vector as described in Section 4, the CSIs associated with both the desired and the undesired clients within the transmission range of the APs/transmitters have to be obtained. The signaling/handshaking time overhead associated with this process must be as low as possible.

The detailed mechanism for a modified seamless channel sounding process is given in Section 5.1.

Second, the mechanism for medium access for APs and clients is vital. Unlike traditional time-division-based decisions, APs/transmitters in our design decide TXOPs based on the available DoFs of the APs. Thus, we need to design a mechanism that checks DoFs at APs and decides TXOPs accordingly. The provision for DoF-based TXOP for APs is presented in Subsection 3.2.2 whereas the decision procedure is presented in Section 5.2.

Third, our design permits concurrent transmissions between the APs and the clients after the APs win the TXOP. We need to develop a mechanism at MAC to manage these concurrent transmissions which has to compatible with the WLAN standard.

Other important aspects are to move the complexity of signal processing to the APs and dynamically change the combination of concurrent clients in bursty traffic demand, while respecting fairness. We shall discuss these aspects further.

5.1 Acquiring CSI associated with transmitter and clients

While IEEE802.11ac incorporates MU-MIMO and provides the basic framework for channel estimation with the null data packet in the standard (called channel sounding), it has noticeable signaling time overheads. We adopt and modify the channel sounding of IEEE802.11ac with a view to reduce a signaling time overhead and better utilization of the precious airtime of the APs. Keeping in mind that the channel sounding process should be as standard-compliant as possible for being amenable to commercial adaptation, we reused some data frames from the standard in our design. Additionally, IEEE 802.11ac leaves the determination of the MU-MIMO precoding scheme open and implementation-dependent. We take ZF beamforming as the principal transmission strategy and design the sounding process accordingly.

The channel sounding is initiated by those APs, who have packets in the queue for transmission. Since APs need to find the channels associated with desired and undesired clients for fairness and throughput-aware precoding, they first transmit a broadcast frame called “ B_frame” so that the clients within the APs’ transmission range can report their channels to the APs. The frame formats used in channel sounding are shown in Fig. 4.
Fig. 4

Frame formats and basic channel sounding process. The figure shows the channel sounding process and the frame formats used for channel sounding. We present the channel sounding process considering the ith network AP2 and clients from both the ith and the jth networks

Similar to the null data packet (NDP) announcement frame of 802.11ac, APs broadcast a control frame, B_frame, of 25 bytes. This frame contains a 6-byte field for the transmitter address (i.e., AP) and separate address fields for a set of multiple station information records used to request multi-user feedback. Most importantly, APs assign association identifications (AIDs) to the clients upon association which are included inside the 12 least significant bits (LSB) of station information (STA info).

The second step is to send the training symbols by APs for channel measurement. This is done by the training frame, T_frame, without a data field. Unlike NDP frames in 802.11ac, the T_frame in our design consists of 1-bit CSI request field at VHT-SIG-A2 in the VHT-SIG-A field. The tail bit consists of only 5 bits compared to 6 bits in 802.11ac. This change in tail bits is to make 24 bits correspond to one orthogonal frequency-division multiplexing (OFDM) symbol.

The function of the 1-bit CSI request field is to ask both desired and undesired clients their CSI within the transmission range of APs. Unlike IEEE 802.11ac, it is worthwhile to note that there are no separate polling frames to acquire CSI from the undesired client. All the clients (desired and undesired) respond with their associated CSI after the CSI request field is received as a part of the training frame.

The removal of the separate polling frame in our design in fact decreases the signaling time overheads in the channel sounding process. Specifically, for the two-network scenario that we have considered in previous examples, it removes two short interframe space (SIFS) times and the time for one beamforming poll frame which equals 98.67 μs. The detailed calculation for signaling time overhead is presented in Subsection 7.2.1.

Each client analyzes the training symbols in the PLCP header (of the T_frame) and measures the channel between the APs and themselves. It is obvious that the clients within the overlapping region would hear multiple B_frame broadcasts. Each client responds to the channel request on a first in first out (FIFO) basis in the uplink.

After the reception of the T_frame, the third step is to feedback the measured channels. Owing to the limited feedback channel, the channels (in the form of the matrices) are compressed and sent in the form of VHT compressed beamforming frames.

Since the APs need to differentiate the channels associated with the desired and the undesired clients, our design uses 2 bits from the reserved bits of the compressed beamforming action frame of 802.11ac. The 2 bits can have at most four logical combinations, which are used to distinguish between the desired and the undesired clients. The reserved field bits are set “00” or “11” in the compressed beamforming action frame by the clients who have AID (i.e., desired clients). Otherwise, the bits are set “01” or “10” by the clients who do not have AID (i.e., undesired clients). Hence, upon the reception of the compressed beamforming action frame, APs check the reserved field and distinguish the CSI feedback between the desired and the undesired clients, \({{\mathbf {H}}_{i{i_{Q}}}}\) and \({{\mathbf {H}}_{i{i_{P}}}}\).

In terms of power, regulation can limit the transmit power based on the number of antennas used at the transmitter so that transmit beamforming does not increase the maximum distance range.

Figure 4 represents a basic diagram of the frame formats and the channel measurement process for the APs in a typical ith network, AP2 and two clients, each from the ith and jth networks.

5.2 Transmission opportunity for APs with heterogeneous antennas

We present a simple DoF-based approach to decide the TXOPs among APs who compete for the medium at any instant. Thus, APs calculate the precoding vector only when they have sufficient DoF for transmission4; otherwise, the APs end up causing interference to other clients.

Before competing for TXOP, APs go for channel sounding and acquire CSI from Q desired (i.e., \({{\mathbf {h}}_{i{i_{d}}}}\)) and P undesired (i.e., \({{\mathbf {h}}_{i{j_{u}}}}\)) clients in their transmission range, where \( \mathop {{i_{d}}}\limits _{{i_{d}} \ne {j_{u}}} \in \{ 1......QM\}\) and \(\mathop {{j_{u}}}\limits _{{j_{u}} \ne {i_{d}}} \in \{ 1......PM\} \) as described in Section 5.1. Second, APs make a decision for TXOP (i.e., choose to remain in the active or the silent mode), if (i>j u ), for example for AP2, where i is the number of antennas at AP2, i{1.....N}, and j u is the number of antennas at undesired clients within range. Note that our design checks i>j u rather than \(i \geqslant {j_{u}}\) for TXOP. The aim is to ensure that every AP has at least one DoF after winning TXOP because interference cancellation costs exactly as many DoFs as the number of antenna/s [17].

Suppose that we have three APs in a network having N 1, N 2, and N 3 antennas, respectively. Each of these APs has I 1, I 2, I 3 antennas for undesired clients in the overlapping region. The three APs satisfying N 1>I 2+I 3, N 2>I 1+I 3 and N 3>I 1+I 2 will have TXOP and will remain in the active mode; otherwise, the APs will not have TXOP and remain in the silent mode at that instant. Hence, the TXOP among the APs are decided on the available DoF.

5.2.1 Fairness among APs with heterogeneous antennas

Since TXOP for APs is based on DoF of APs, it is possible that APs with larger number of antennas (i.e., consisting of higher DoFs) would win TXOP all the time.

This may result in a deep unfairness among APs having fewer antennas. In order to prevent APs with a fewer antennas, starving for TXOP, our design executes a simple fairness algorithm for TXOPs, which runs at APs. Since MU-MIMO WLANs are distributed in nature, the fairness algorithm for TXOPs is designed to ensure fairness among APs without requiring coordination with each other.

Specifically, we assign all APs with two types of credit counters (i.e.,“S_Counter” and “F_Counter”, initialized to 0) and a credit threshold (i.e.,“C_threshold,’, set to a constant value). Each time when APs get the TXOP, the ‘S_counter’ counter will be incremented, otherwise the “F_Counter” will be increased. If the “F_Counter” crosses the “C_threshold”, the corresponding AP directly qualifies for TXOP. The basic pseudocode is given in Algorithm 2.

5.2.2 Fairness index of the algorithm for TXOPs

We evaluate the fairness index of our Algorithm 2 Fairness Algorithm for TXOPs, according to the Jain fairness index [24], which fundamentally gives a quantitative measure to any resource sharing or allocation problem. We consider three APs with two, three, and four antennas among which the fairness in throughput is studied. We assume that each AP, after winning TXOP, has at least one stream for transmission and has at most a number of transmission streams equal to the number of antennas at the AP. For instance, a three-antenna AP has at least one transmission stream (worst case) and at most can have three transmission streams (best case) after TXOP. Let R i be the ith AP that has TXOP and n be the number of such APs; thus, the Jain fairness index is given by
$$ f\left(R \right) = \frac{{{{\left| {\sum\limits_{i = 1}^{n} {{R_{i}}}} \right|}^{2}}}}{{\sum\limits_{i = 1}^{n} {{R_{i}^{2}}} }},~{R_{i}} \ge 0. $$
R i is calculated as the ratio of the maximum throughput and the least expected throughput, i.e., for the AP with three antennas,
$$ {R_{i}}=\frac{{\mathrm{Throughput~when~three~streams~are~used}}}{\mathrm{Throughput~when~single~stream~is~used}}. $$

Similarly, R i can be calculated for the remaining APs. The fairness index for n=3 (in our case) is calculated and is discussed further in Subsection 7.2.2.

5.3 Access to the medium

Since concurrent transmissions take place after the determination of TXOP, there is no contention among the APs during concurrent transmissions. We exploit this fundamental attribute of the concurrent transmission and adopt and expand the IEEE802.11 point coordination function (PCF) mode to address the concurrent transmissions. The reason is that concurrent transmissions are contention free and they can be governed by the contention-free period (CFP) of PCF (the detailed process is discussed below). Besides, the PCF is the part of the IEEE802.11 standard and its expansion to suit our PHY solution would be more straight forward to satisfy the interoperability issues.

5.3.1 Contention-free period and contention period

Similar to the PCF in IEEE802.11, we designate each AP in the network as a point coordinator. We divide time into CFP and contention period (CP) as shown in Fig. 5.
Fig. 5

Extended point coordination function. We extend the traditional PCF for concurrent transmissions. Since concurrent transmissions are contention free, the CFP of PCF can be used for this purpose. The figure shows four concurrent transmissions as an example

The beginning of the CFP is marked by the transmission of a beacon by APs. This sets the duration of the current CFP. During CFP, APs run the concurrency algorithm as described in Section 4.1 and select the clients for transmissions both at downlink and uplink. The CFP is followed by CP, during which any clients can contend for the medium using IEEE802.11 and point-to-point MIMO. The objective of the CFP is to manage the concurrent transmissions as much as possible so that the network throughput can be increased. The duration of CFP depends on the traffic congestion and may increase or decrease with the rise and fall of the traffic congestion. However, at CFP, the APs serve at least one packet (on downlink and uplink) to all clients that have pending traffic. In contrast, the duration of CP is constant. Similarly to IEEE802.11, we set the minimum length of CP to be equivalent to the time required to transmit and acknowledge one maximum-size frame. However, sometimes it is possible for the contention-based service to run past the expected beginning of CFP, which we call “foreshortening” of CFP.

5.3.2 Medium access to downlink

Figure 5 presents a series of events that take place in this process. APs run the concurrency algorithm and select the group of clients for transmission at that instant. After that, APs transmit their downlink packets and poll the clients for uplink data with the help of the CF-Poll+Data frame. This process is similar to the existing PCF except that the current PCF polls the individual clients one by one whereas, with our MAC, APs poll for uplink traffic a group of clients selected by the concurrency algorithm.

The CF-Poll+Data frame contains two parts. The first part of the frame is shown in Fig. 6 which contains IDs of the clients that are selected as the result of the concurrency algorithm. The IDs are given to the clients upon association to assist with control and management function. It also contains the frame id, Fid, the address of APs, and the checksum of their broadcast. The APs and the clients use this checksum to test whether or not the received data is correct. The second part of the frame is the list of concurrent downlink data of the APs to the clients. For instance, a downlink transmission of the AP with four antennas is given in Fig. 5. Upon reception of data at clients in downlink, the clients send acknowledgments (ACKs) to AP. The order in which they send these ACKs is the same order as the IDs in the Data+Poll frame. Basically, clients send ACKs using the traditional MIMO. Thus, each received data at clients is acknowledged.
Fig. 6

Metadata structure. This is the metadata that is transmitted with CF-Poll frames

5.3.3 Medium access to uplink

The uplink data transmission at CFP is initiated by the grant frame5 broadcast by AP. The grant frame consists of the IDs of the clients determined by the concurrency algorithm that runs at APs. The clients in the uplink transmit the Data+Req frame. This frame contains the uplink data and, if there are more data in the clients to send, it also contains a request frame. The request frame is for transmission of the new frame in the uplink. However, APs do not entertain the new requests immediately. Instead, APs record the ids of the clients who have sent requests along with their uplink data and then polls them in the next cycle. Upon the reception of the poll request, clients with the new data can transmit to APs. APs decode Data+Req frame sent by clients by using the standard MIMO decoding method.

Upon the reception of the Data+Req frame, APs confirm the received data by the broadcast of the ACKs frames within its transmission range. The clients in the transmission range receive the ACKs frames. However, the clients who are not selected for the uplink transmission discard the ACKs. Thus, clients are acknowledged for successful reception of data in the uplink transmission.

The end of CFP is marked by the CF-End frame broadcast by APs. This frame indicates to the clients the end of the CFP. This frame prepares APs and clients to go back to the standard contention mode in DCF.

5.3.4 When to initiate the extended PCF?

Traditionally, the HTs are managed by the RTS/CTS mechanism. Basically, the RTS function determines whether the APs should use the CSMA/CA or the RTS/CTS mechanism to send the payload. Usually, the RTS threshold value is set in the range of 0–2347 and any data bytes more than the threshold exchange data by the RTS/CTS mechanism.

In contrast to this traditional scheme, we set the retransmission threshold at the APs as Re_Threshold. Generally, when the transmitted data are not acknowledged at the APs, either due to data or ACKs loss, APs retransmit the data and retry up to a certain count, Re_count. We compare Re_count and Re_Threshold and, if (Re_count>Re_Threshold), the extended PCF is initiated. The provision of Re_Threshold is similar to the traditional RTS threshold value. However, we choose a retransmission threshold, Re_Threshold, for initiation of the extended PCF. This is because the presence of the HT scenario causes collisions of signals, and there is a high possibility of occurrence of retransmissions. In such a context, our proposed extended PCF comes into play to address the HT scenario.

5.3.5 It is worthwhile to note a few points

  • Are active and silent modes fixed?The active and silent modes for APs are not fixed. Since the number of antennas that APs possess is always fixed, so N is fixed. However, PM is not fixed. It is variable and depends on two components: first, the number of undesired clients, P, present in any AP’s transmission range and second, the number of heterogeneous antennas, M, each undesired client possesses at the given instant where there exists the HT scenario.

    Since PM vary from case to case, this will further vary two components in our scheme. First the remaining DoFs at APs are variable because DoF=N-PM (this determines number of concurrent transmissions in the scheme). Second, the TXOP of APs varies because TXOP = (N>P M). Thus, with variable PM, at one instant, APs can satisfy N>P M and will have TXOP, while at the other instant, APs may not satisfy N>P M and lose TXOP. APs with TXOP will remain in an active mode; otherwise, they will remain in a silent mode. Additionally, to ensure fairness for the APs who may remain in the silent mode for a long time and starve for TXOP, we have proposed Algorithm 2, a fairness algorithm for TXOPs.

  • How the concurrent algorithm goes out of active and silent modes?The CPF MaxDuration and Timestamp field of Beacon frame are used to manage the transition of the active and the silent mode APs. The algorithm presented with the flow diagram runs on top of standard DCF, which is invoked when we have an HT scenario in MU-MIMO WLANs. Thus, both the active and the silent mode APs at the end of the algorithm return to the contention-based DCF. The process works as follows: After TXOP is decided, both the active and the silent mode APs set CFP to the maximum duration. Similar to traditional PCF, this is done by setting bit 15 to 1 out of 2 bytes in the CFP MaxDuration field in the CF parameter set [25]. The active mode APs inform this decision to their clients by sending a Beacon frame. Upon the reception of the Beacon frame, clients set their network allocation vector (NAV) to 32,768. On the other hand, silent mode APs do not transmit any Beacon frame; however, they constantly monitor the Timestamp and wake up at the elapse of CFP. Since the duration set for both the active and the silent mode APs is the same, the times when the silent mode APs wake up, and the transmission of CF-End, marking the end of CFP by the active mode APs, coincide.

  • If there is no contention among the APs, how will they synchronize?We see the need of synchronization in our scheme in two stages. Stage 1 synchronization is needed to invoke extended PCF when all APs in the vicinity start experiencing the HT problem. However, the challenge comes from the decentralized and distributed nature of MU-MIMO WLANs where different APs do not communicate with each other. In such a context, we need a synchronization mechanism which can synchronize APs independently before we initiate extended PCF. We describe this synchronization mechanism in stage 1 which is achieved as follows: We use the Re_Threshold and the point control function inter-frame spacing (PIFS) interval to synchronize APs before we initiate extended PCF. Since there exists the HT scenario among APs, there will be a collision of data packets and ACKs are not received at APs. This makes APs retry for transmission of data packets. Our scheme exploits this well-known process of APs in WLANs and set the same retransmission threshold, Re_Threshold, for all APs. Thus, whenever there is a HT problem in the network, APs in the vicinity reach their Re_Threshold more or less at the same time. Now, this is the time for APs to initiate an extended PCF.

    Additionally, to better synchronize the initiation of the extended PCF, we make APs wait longer for a specified PIFS interval. This process will give extra time to any APs who lag to reach Re_Threshold. Thus, all APs will be synchronized and will initiate an extended PCF at the same time.

    Stage 2 synchronization is needed during the CFP operation. The synchronization is obtained via different types of frames used in CFP, such as management frames, control frames, and data frames.

    For example, Acks in our scheme are synced as follows: (Acks) are sent after an SIFS interval whenever APs or clients receive data packets in the uplink or downlink. Since the concurrent algorithm is used to select a group of clients who are to be served at an instant, the transmission of Acks after packet reception can be done by using the traditional MIMO technique both in uplink and downlink.

6 Experimental setup

6.1 The USRP2 platform

We implement our proposed PHY solution on the hardware platform made up of the Universal Software Radio Peripheral2 (USRP2) ( The RFX2400 daughterboards and Jacksion labs equipments are respectively used for the radiofrequency (RF) transmitters and receivers and for the clock to maintain synchronization. The standard GNU Radio libraries ( are used in the Ubuntu 11.04 environment. The experiment is carried out in the indoor environment with stationary nodes and with an operating frequency of 2.45 GHz. Table 1 shows the PHY parameters.
Table 1

Physical layer parameters



Carrier frequency

2.45 Ghz

Number of subcarriers


Occupied subcarriers



1.5625 MHz

FFT length


OFDM symbol+CP


Symbol time per subcarrier

81.92 μs

Subcarrier spacing

24.414 kHz

Transmission rate

585 kbps



6.2 Implementations

We construct the testbed with the help of four USRP2s equipped with RFX2400 daughterboards. We configure two USPR2s consisting of a single antenna each, to work as a single node6. These two antennas represent the ith network AP2 as in Fig. 2. The remainder of the USRP2s, consisting of a single antenna each, were configured as the jth network AP1 and the jth network client I4.

We then create the HT scenario by placing the jth network AP1 and the ith network AP2 equidistant from the jth network client I4. We use the same RF antenna (i.e., 50 mW) to ensure equal transmission powers at both APs. This condition is vital because the transmission would otherwise demonstrate the “capture effect” [5], where one transmission would capture the link and start transmission while the other terminal is affected by or may starve for transmission.

Additionally, the system requires a mechanism for channel feedback in order to calculate a suitable precoding vector at the APs. We use time division duplexing (TDD) and achieve the CSI at the APs with the help of the preambles7. The packet preamble is augmented with each OFDM data symbol8, which consists of seven identical OFDM symbols each of length 64. Between the OFDM symbols, there are guard intervals of length 64. These form the cyclic prefix of our design9.

Nonetheless, due to USRP2/GNU Radio’s inability to support numerous instantaneous channels between APs and clients, we basically focus our prototype implementation on interference cancellation to the undesired clients so that, when the desired APs transmit to these clients, there will not be any collision of signals.

Specifically, first, the APs (AP1 and AP2) send the packet preambles. Second, the clients within the transmission range receive the preambles and update them to the host PC. The reception of the preamble is an important step as it contains crucial information such as OFDM symbol timing, carrier frequency offset (CFO), and channel estimation. Third, the host PC calculates the channel frequency response as shown in Fig. 7 and feeds them back to AP2 (In our prototype setting, we use the University’s DHCP server for feeback purposes). After getting CSI at AP2, AP2 calculates the precoding vector for transmission.
Fig. 7

Channel frequency response. This is the frequency response of the channel with 64 subcarriers out of which 48 are occupied subcarriers, and the remainder are unoccupied subcarriers. The response is obtained by estimating the channel with the preambles sent by APs

The precoding vector is then multiplied by the transmitting symbols of AP2. As a result, interference is removed at the undesired clients I4(1). Hence, whenever the jth network AP1 transmits to its jth desired client I4(1), at the same time with ith network AP2, there will not be a collision of signals. The jth network client I4(1) is now able to detect the desired signal from the jth network AP1 and logs the results to the host PC. The host PC extracts the raw received signals with offline decoding using MATLAB®;.

A general illustrative diagram describing the implementation procedure is shown in Fig. 8. The abbreviations USRP2 sync and PV denote USRP2 synchronization and precoding vector, respectively.
Fig. 8

General implementation diagram. This is a basic diagram illustrating the process of implementation

6.3 Channel feedback

Timely channel feedback to the APs is vital, as stale CSI degrades the performance in terms of interference management. To ensure timely CSI feedback, we first measure the feedback delay time (T f ) of our testbed environment (which is found to be 4.871 ms). Then, we compare it with the standard coherence time (CT), 21.2 ms, measured by MacLeod et al. in [26] for ISM wireless indoor environments. Comparison shows that T f is about a fifth of the standard CT. This ensures that the channel changes more infrequently than the feedback delay time T f of our testbed environment, meaning that the precoding vector is up to date with respect to changes in the channel conditions.

The comparison of T f and the standard CT is made, as the measurement environment of the standard CT and our experimental environment is similar. Both are for the industrial, scientific, and medical (ISM) band and are inside a laboratory with electronic equipment, desks, tile floors, two walls at two sides, and two glassed walls.

7 Performance evaluation

7.1 PHY performance evaluation from the test-bed

We consecutively do three things: First, measure the received SNR at the jth network client I4 under the HT scenario (i.e., both AP1 and AP2 are transmitting at the same time) shown in Fig. 2. Second, apply our scheme (i.e., both AP1 and AP2 are transmitting but the ith AP2 uses the precoding vector to null the interference at the jth network client I4) and measure the received SNR at I4. Third, measure the received SNR at I4 with individual collision-free transmission (i.e., HTs free transmissions when AP2 is not present).

We shall compare and analyze the raw received signals, the SNR10, and the effective SNR (ESNR)11 in the aforementioned conditions.

7.1.1 Analysis from the raw received signal

After the HT condition is satisfied, both AP1 and AP2 start transmitting. We observe that the jth network client I4 is totally flooded with the signals from both AP1 and AP2 (i.e., signals interfere with each other) as shown in Fig. 9. The observed y-axis shows a real part of the signal. The signals lie within the range of −0.2 to +0.2 dB, however with some irregularities and spikes12.
Fig. 9

Decoded raw samples form AP1 and AP2 in the HT scenario. In the HT scenario, AP1 and AP2 transmit their signals simultaneously. The signal received at I4 is given in the figure. The received signal contains both the signals from AP1 and AP2 in a collided form

We calculate and use the precoding vector at the ith network AP2 to null the interference at the jth network undesired client I4. This results in a raw received signal at the jth network client I4 from just its jth network AP1 as shown in Fig. 10.
Fig. 10

Raw received signal after implementing the scheme. This figure describes the raw received signals after applying our scheme in the HT scenario. AP2 cancel interference at I4, and as a result, the AP1 signal is only seen at I4. However, some part of the AP2 signal is also present. This is deliberately done to show that what the AP2 signal would look like when interference cancellation is not applied

Also, we see the signal received from AP2. It is intentionally done to show what the AP2 signal would look like if it were not managed. It is the part of AP2’s signal where we deliberately did not apply interference cancellation.

7.1.2 The impact on the received SNR

We compare the received SNRs at the jth network client I4: (a) under the HT scenario, (b) with our proposed solution, and (c) with the collision-free transmission. The SNR values for 48 occupied subcarriers of OFDM signals are plotted in Fig. 11.
Fig. 11

Comparison among the received SNR per subcarrier with collision free jth network AP1 and the jth network client I4 transmission, the proposed solution, and the HT scenario. We plot the received SNRs in collision-free transmissions, the proposed solution, and the HT scenario separately. We present them in one combined figure. The gain in SNRs is associated with 48 occupied subcarriers

We see a significant gain, in the received SNR (blue dots) of the jth network client I4 after applying our design, relative to the SNR under the HT scenario (green dots). This improvement in SNR comes from the successive jth network AP1 transmission to its jth network client I4. The gain in SNR is significant because, in the HT scenario, the signal transmission is marred by interference from the ith network AP2. However, after implementing our design, the interference is mitigated and yields a significant SNR gain.

In addition to this, there is an average of about 4–5 dB difference in SNR between the received SNR of the collision-free transmission (red dots) and the received SNR with our design (blue dots) in Fig. 11. The SNR gain in a collision-free transmission is at the upper bound that our design is supposed to achieve.

Despite imperfections in interference mitigation caused by hardware offsets and other implementation limitations, our design possesses an acceptable received SNR gain of about 6 dB on average, with the 48 occupied subcarriers. This gain is about 10 dB in comparison to transmission in the HT scenario.

7.1.3 Analysis of ESNR

For multicarrier systems like OFDM, subcarriers may undergo different levels of fading, and these channel qualities cannot simply be represented by the overall received signal strength indication (RSSI)13due to frequency selectivity [27]. In such a context, the ESNR can be used as an important metric for performance evaluation. We use the availability of CSI at the subcarrier levels, as shown in Fig. 7, to measure the ESNR at the jth network client I4, by averaging the subcarriers’ bit error rate (BER) and then inverse mapping the BER to the SNR. From Fig. 12, we observe a rise in the ESNR value by about 10 dB for each modulation scheme after applying the PHY solution.
Fig. 12

ESNR comparison of different modulation schemes in the HT scenario. The figure shows an effective SNR comparison with modulation schemes BPSK, QPSK, 16QAM, and 64QAM in the HT scenario

7.2 The MAC layer performance evaluation

We compare the signaling time overhead of our MAC with the traditional RTS/CTS mechanism in the context of the HT problem in WLANs. Also, we compare the signaling time overhead of our MAC and the IEEE802.11ac standard. We further compare the total network throughput gain of our MAC and the traditional RTS/CTS. The throughput of our MAC and the IEEE802.11ac is also compared.

7.2.1 Signaling time overhead and capacity gain of MAC

As shown in Fig. 4, the payload is not transmitted until we access all the channels and calculate the precoding vectors for the APs. This period is defined as the signaling period.

In a typical HT scenario for two networks, we calculate the signaling time overheads associated with different frames as shown in Fig. 4. Since a physical layer convergence protocol (PLCP) preamble and a PLCP header are added to an MPDU to create a PLCP protocol data unit (PPDU), the transmission duration of the broadcast B_frame is given by \({T_{\mathrm {B}\_\text {frame}}} = \mathrm {PLCP~frame} + \left [ {\frac {{25}}{{BpS(m)}}} \right ]\times \text {tSymbol} = 40 + \left [ {\frac {25}{3}} \right ]\times 4 ~\upmu s = 73.33 ~\upmu s\). We use the same PLCP frame as IEEE802.11ac because it is designed to be compatible with legacy standards. tSymbol=4 μ s is the OFDM symbol interval. The type of modulation used is binary phase-shift keying (BPSK) with data rate 6 Mbps and code rate \(\frac {1}{2}\). The training frame has the same format as the VHT PPDU except for the data field, so the transmission duration \({T_{T\_\text {frame}}} = \left ({8\times 5} \right) = 40~\upmu s\).

Unlike IEEE802.11ac, there is no provision for the beamforming report poll in our design; thus, there is no signaling time overhead associated with it. In the IEEE802.11ac standard, the beamforming report poll frame constitutes a signaling time overhead of \({T_{\mathrm {B{R_{Poll}}}}} = 40 + \left [ {\tfrac {{20}}{3}} \right ]\times 4~\upmu s = 66.67~\upmu s\), considering BPSK modulation with data rate 6 Mbps and code rate \(\frac {1}{2}\).

We further calculate the time duration of VHT compressed beamformimg assuming payload length l=200 octets, \({T_{\mathrm {C{B}_{{\text {Report}}}} = }}40 + \left [ {\tfrac {{5 + l}}{3}} \right ]\times 4~\upmu s = 313.33~\upmu s\).

Thus, for typical two networks, K=2, the signaling time overhead is given by \({T_{\text {OH}}} = {T_{{B_{\text {frame}}}}} + {T_{T\_\text {frame}}} + 2 \times {T_{\text {CB}_{{\text {Report}}}}} + 3 \times \text {SIFS} = 787.99~\upmu s\phantom {\dot {i}\!}\), where SIFS=16 μ s. The traditional signaling time overhead for the RTS/CTS scheme is given by T RTS/CTS=T DIFS+T RTS+T CTS+2×SIFS=(34+50.33+42.33+2×16)=158.7 μ s whereas the IEEE802.11ac signaling time overhead is given by \({T_{\mathrm {{OH_{ac}}}}} = {T_{\mathrm {{NDP_{ann}}}}} + {T_{\text {NDP}}} + 2 \times {T_{\text {CB}_{{\text {Report}}}}} + {T_{\text {BR}_{Poll}}} + 5 \times \text {SIFS} = 886.66~\upmu s\).

Based on the calculations of the signaling time overheads, we study their impact on the network throughput. The simulations are carried out for a six-antenna AP2 consisting of five desired clients, I1, LP,I2,HDTV, and I3 and two undesired clients, I4 and I5, in the transmission range. There are four clients to be served concurrently. Typically, N=6 and I=2 (from the same jth network), so the number of concurrent transmissions after TXOP is NI=4.

We first take an arbitrary air time t=20 ms and compare the throughput gain for our MAC with traditional RTS/CTS and MAC of IEEE802.11ac at 5, 15, and 25 dB, respectively. Our simulation results in Fig. 13 reveal that the RTS/CTS scheme has an early gain in capacity at around 157.8 μs and IEEE802.11ac MAC has a gain at around 886.66 μs, whereas our MAC protocol gain in capacity is around 787.99 μs. This is an expected behavior, as our MAC has a higher signaling time overhead than RTS/CTS and lower than IEEE802.11ac MAC. It is interesting to observe that our MAC protocol and IEEE802.11ac have about four to five times capacity gain compared to the RTS/CTS scheme; however, our MAC has the advantage of obtaining the gain as early as 98.67 μs compared to IEEE802.11ac.
Fig. 13

Capacity comparison between RTS/CTS, our MAC and IEEE802.11ac MAC, airtime 20 ms. We measure the network throughput in a typical six-antenna AP and the client network with our proposed solution and compare it with the network throughput that can be obtained by RTS/CTS and IEEE802.11ac. The available airtime for transmission is considered to be 20 ms

Normally, a lower signaling time overhead is desired so that the available transmission time can be better utilized for packet transmissions. Owing to the design constraints, we cannot lower the signaling time overhead below the traditional RTS/CTS; however, we can reduce the signaling time overhead by 98.67 μs compared to IEEE802.11ac. Additionally, a constant network capacity gain of four to five times can be achieved compared to RTS/CTS.

The gain in capacity comes from the concurrent transmissions (made possible by the precoding vector) that take place once the handshaking process is completed. Thus, the slightly longer signaling time in our MAC protocol is compensated for by the throughput gain contributed by concurrent transmissions. In summary, the larger signaling overhead of IEEE802.11ac is reduced by 98.67 μs and a constant capacity gain of four to five times, compared to RTS/CTS, is achieved by our MAC protocol.

Furthermore, we have a closer look with a short available airtime t=2 ms with all other factors remaining the same. Figure 14 shows that we have the same throughput gain of around four to five times compared to RTS/CTS, and this gain is as early as 98.67 μs before IEEE802.11ac, as in t=20 ms. Thus, from Figs. 13 and 14, it is clear that the gain holds for the available airtime satisfying t>787.99 μ s. Thus, as long as the available airtime is t>787.99 μ s, a constant gain in the range of four to five times with respect to the traditional RTS/CTS and signaling overhead improvement of 98.67 μs compared to IEEE802.11ac is achieved by our MAC at 5, 15, and 25 dB.
Fig. 14

Capacity comparison between RTS/CTS and our MAC and IEEE802.11ac MAC, airtime 2 ms. We measure the network capacity in a typical six-antenna AP and the client network with our MAC and compare it with the network throughput that can be obtained by RTS/CTS and IEEE802.11ac. The available airtime for transmission is considered to be 2 ms

7.2.2 Computation of fairness index

We discuss the fairness index of Algorithm 2 fairness algorithm for TXOPs considering three APs, i.e., n=3, with the number of antennas two, three, and four, respectively. Figure 15 shows the system throughput with the credit counters where “C_threshold” is arbitrarily taken to be 6. Also, we show the maximum and minimum stream-based throughput of APs when the credit counter gradually increases to C_threshold. Besides, we calculate the Jain fairness index according to (7) for three APs and present the Jain fairness index with the credit counters. It is shown that our fairness algorithm has a fairness index greater than 0.9. Thus, the use of our fairness algorithm provides a more than 90 % fair share among three APs in terms of throughput.
Fig. 15

Throughput of three APs with the fairness index. Basically, we present a Jain fairness index considering three APs and clients, i.e., 4×4, 3×3, and 2×2 systems

7.2.3 Performance of the concurrent algorithm

Section 4, step 3 discussed the need for the concurrent algorithm and Section 4.1 presents the three possible options for concurrent transmission in detail. With the simulation studies, we checked the performance of the three concurrent algorithms considering the previous MU-MIMO WLAN where there is a six-antenna AP with five desired and two undesired clients. Since there are NI=6−2=4 concurrent transmissions to maintain, each concurrent algorithm, FIFO, Brute force, and the FIFO combined with the Best of the Two Choices, were used to calculate the network throughput with increasing SNR values. The simulation result at Fig. 16 shows that, of the three, Brute force has a higher throughput, followed by FIFO combined with Best of the Two Choices, and FIFO. The reason is that Brute force always maximizes the network throughput by selecting the best combination of served clients. FIFO combined with Best of the Two choices takes care of the fairness issue while maximizing the throughput so can have a lower throughput. FIFO is oblivious to the network throughput as it cares most about the fairness issue.
Fig. 16

Throughput comparison among FIFO, Brute force and FIFO combined with Best of the Two Choices. We discuss three concurrency algorithms for APs to transmit with their desired clients within the network after winning TXOP. The throughput comparison is made among FIFO, Brute force, and the FIFO combined with the Best of the Two Choices

A closer study of Fig. 16 shows that the maximum network throughput of the considered network can never exceed the throughput of the Brute force algorithm. However, in the scenarios when the best channel clients queue subsequently, the FIFO algorithm can attain the throughput performance of the Brute force algorithm. This case applies to the FIFO combined with Best of the Two Choices algorithm as well, given that the first client in the queue happens to be among one of the best channels available.

8 Conclusions

Collisions of signals due to the HT problem in MU-MIMO WLANs are inevitable. We showed with our USRP2/GNU Radio prototype that the concept of ZF precoding can be instrumental to solving the HT problem, as we see a received SNR gain from 5–11 dB in our lab settings. However, with a view to address the implementation-specific requirements of MU-MIMO WLANs, such as fairness in client access and the throughput of the network, we propose a fairness and a throughput-aware ZF precoding in our design at PHY. Besides, based on the requirements of PHY, a MAC protocol is designed which decides TXOP among APs/transmitters on available DoF. The simulation studies show that our MAC protocol has a constant throughput gain of four to five times compared to traditional RTS/CTS. Besides, it has a low signaling time overhead of 98.67 μs compared to IEEE802.11ac.

9 Endnotes

1 When we have non-hidden terminals, e.g., AP2 transmits to HDTV, and AP1 transmits to I6 only, it is not necessary to ZF at the interfered terminals. The absence of the HTs can be regarded as a normal traffic condition in a network, meaning that there is no collision of signals at either client because they are not in the transmission overlapping region. Whenever we have a normal traffic condition, we usually use the standard contention-based DCF.

2 The right inverse can still be taken if N<P M, however this will not increase the concurrent transmissions as the number of DoFs of the network is min{N,PM}.

3 We take a singular value decomposition for each combination of channels and the position of the channel realization does not matter in the throughput calculation.

4 For instance, in a network of three ongoing concurrent transmissions, a two-antenna AP does not qualify for TXOP; however, APs with a greater number of antennas than 3 can obtain the precoding vector and can transmit concurrently.

5 The grant frame is similar to the traditional CF-Poll, with frame type value “10” and subtype value “0110”. The difference between the traditional CF-Poll and grant frame is that APs send a CF-Poll frame on a client-by-client basis whereas a grant frame in our scheme is sent to a group of clients selected by the concurrency algorithm.

6 The external clock was provided by Jackson labs equipment along with an external GPS antenna to fine tune the external clock in the construction of two-antenna single node.

7 It is to be emphasized that we use packet preamble for packet detection, OFDM symbol timing determination, carrier frequency offset (CFO) estimation, and channel estimation. No separate pilot signals of any patterns or any pilot signals embedded as a part of the desired signal are used for symbol timing determination, CFO estimation, and channel estimation.

8 Each data OFDM symbol has 64 subcarriers with 48 data symbols transmitted over 48 subcarriers and 16 null subcarriers.

9 The OFDM FFT size and the CP size are kept equal to deal with additional delays due to channel propagation and hardware turnaround time in our prototype settings. However, usually, in a real implementation, the CP length is kept smaller than the OFDM FFT size.

10 In the networking community, we often compare the throughput results. However, they do not bring much insight for radios that do not have proper rate adaptation. Since current GNU Radios do not yet support rate adaptation and they do not have a stable implementation of the set of modulation and coding scheme that allows rate adaptation, it is unfair to compare the throughput because the system can have the same throughput yet can have significantly higher SNR. A higher SNR could have used better modulation and coding schemes to achieve higher throughput.

11 This is defined as the SNR that would give the same error performance on a narrowband channel [28].

12 The principle of superposition among the collided signals caused signals to add up constructively or destructively (noise is present as well) which may have caused the received signal to be irregular in pattern and with spikes.

13 For a narrowband channel which shows an almost flat fading response to all the subcarriers, RSSI would be a better choice for measuring the success and failure of packet delivery.



The authors would like to acknowledge the supports provided by Macquarie University, Sydney, Australia.The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

Department of Engineering, Macquarie University
School of Computing and Communications, University of Technology Sydney
University of Technology Sydney


  1. Y-C Cheng, J Bellardo, P Benkö, AC Snoeren, GM Voelker, S Savage, in Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. SIGCOMM ’06. Jigsaw: Solving the puzzle of enterprise 802.11 analysis (ACMNew York, NY, USA, 2006), pp. 39–50.View ArticleGoogle Scholar
  2. M Bertocco, G Gamba, A Sona, S Vitturi, in Instrumentation and Measurement Technology Conference Proceedings, 2007. IMTC 2007. IEEE. Performance measurements of csma/ca-based wireless sensor networks for industrial applications (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2007), pp. 1–6.Google Scholar
  3. X Yang, N Vaidya, in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE. On physical carrier sensing in wireless ad hoc networks, vol. 4 (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2005), pp. 2525–25354.Google Scholar
  4. FA Tobagi, L Kleinrock, Packet switching in radio channels: part ii–the hidden terminal problem in carrier sense multiple-access and the busy-tone solution. IEEE Trans. Commun.23(12), 1417–1433 (1975).View ArticleMATHGoogle Scholar
  5. C Ware, J Judge, J Chicharo, E Dutkiewicz, in Communications, 2000. ICC 2000. 2000 IEEE International Conference On. Unfairness and capture behaviour in 802.11 adhoc networks, vol. 1 (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2000), pp. 159–163.Google Scholar
  6. A Sheth, C Doerr, D Grunwald, R Han, D Sicker, in Proceedings of the 4th international conference on Mobile systems, applications and services. MOJO: A distributed physical layer anomaly detection system for 802.11 WLANs (ACM, 2006), pp. 191–204.Google Scholar
  7. P Karn, in ARRL/CRRL Amateur Radio 9th Computer Networking Conference. MACA—a new channel access method for packet radio, vol. 140, (1990), pp. 134–140.Google Scholar
  8. PC Ng, SC Liew, KC Sha, WT To, Experimental study of hidden node problem in IEEE 802.11 wireless networks. Sigcomm Poster., 26 (2005).Google Scholar
  9. K Lin, Y-J Chuang, D Katabi, A light-weight wireless handshake. ACM SIGCOMM Comput. Commun. Rev.42(2), 28–34 (2012).View ArticleGoogle Scholar
  10. JG Andrews, Interference cancellation for cellular systems: a contemporary overview. IEEE Wirel. Commun.12(2), 19–29 (2005).View ArticleGoogle Scholar
  11. S Gollakota, D Katabi, in Zigzag decoding: combating hidden terminals in wireless networks, 38, (ACM, 2008), p. 4.Google Scholar
  12. J-S Park, A Nandan, M Gerla, H Lee, in Communications, 2005. ICC 2005. 2005 IEEE International Conference On. Space-mac: enabling spatial reuse using MIMO channel-aware MAC, vol. 5 (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2005), pp. 3642–3646.View ArticleGoogle Scholar
  13. J Mundarath, P Ramanathan, BD Van Veen, in Global Telecommunications Conference, 2004. GLOBECOM’04. IEEE. Nullhoc: a MAC protocol for adaptive antenna array based wireless ad hoc networks in multipath environments, vol. 5 (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2004), pp. 2765–2769.View ArticleGoogle Scholar
  14. Y Lebrun, K Zhao, S Pollin, A Bourdoux, F Horlin, S Du, R Lauwereins, Beamforming techniques for enabling spatial-reuse in MCCA 802.11s networks. EURASIP J. Wirel. Commun. Netw.2011(1), 1–13 (2011).View ArticleGoogle Scholar
  15. S Shrestha, G Fang, E Dutkiewicz, X Huang, in Telecommunications (ICT), 2015 22nd International Conference On. Zeroforcing precoding based MAC design to address hidden terminals in MU-MIMO WLANs (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2015), pp. 283–288.View ArticleGoogle Scholar
  16. P Patel, J Holtzman, Analysis of a simple successive interference cancellation scheme in a DS/CDMA system. IEEE J. Sel. Areas Commun.12(5), 796–807 (1994).View ArticleGoogle Scholar
  17. D Tse, P Viswanath, Fundamentals of wireless communication (Cambridge university press, 2005).Google Scholar
  18. H Te Sun, K Kobayashi, A new achievable rate region for the interference channel. IEEE Trans. Inf. Theory. 27(1), 49–60 (1981).MathSciNetView ArticleMATHGoogle Scholar
  19. A Carleial, Interference channels. IEEE Trans. Inf. Theory. 24(1), 60–70 (1978).MathSciNetView ArticleMATHGoogle Scholar
  20. A Wiesel, YC Eldar, S Shamai, Zero-forcing precoding and generalized inverses. IEEE Trans. Signal Proc.56(9), 4409–4418 (2008).MathSciNetView ArticleGoogle Scholar
  21. F Boccardi, H Huang, in Signal Processing Advances in Wireless Communications, 2006. SPAWC’06. IEEE 7th Workshop On. Zero-forcing precoding for the MIMO broadcast channel under per-antenna power constraints (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2006), pp. 1–5.View ArticleGoogle Scholar
  22. VN Sachkov, Combinatorial methods in discrete mathematics(55) (1996). Cambridge University Press.Google Scholar
  23. M Mitzenmacher, The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst.12(10), 1094–1104 (2001).View ArticleGoogle Scholar
  24. R Jain, D-M Chiu, WR Hawe, in A quantitative measure of fairness and discrimination for resource allocation in shared computer system. (Eastern Research Laboratory, Digital Equipment CorporationHudson, MA, 1984), p. 38.Google Scholar
  25. M Gast, 802.11 wireless networks: the definitive guide (O’Reilly Media, Inc., 2005).Google Scholar
  26. H MacLeod, C Loadman, Z Chen, in Communication Networks and Services Research Conference, 2005. Proceedings of the 3rd Annual. Experimental studies of the 2.4-ghz ISM wireless indoor channel (IEEE3 Park Avenue 17th Floor, New York, NY 10016 5997 USA, 2005), pp. 63–68.Google Scholar
  27. D Halperin, W Hu, A Sheth, D Wetherall, Predictable 802.11 packet delivery from wireless channel measurements. ACM SIGCOMM Comput. Commun. Rev.41(4), 159–170 (2011).View ArticleGoogle Scholar
  28. S Nanda, KM Rege, Frame error rates for convolutional codes on fading channels and the concept of effective Eb/N0. IEEE Trans. Veh. Technol.47(4), 1245–1250 (1998).View ArticleGoogle Scholar


© Shrestha et al. 2016