PQMAC: Exploiting Bidirectional Transmission Opportunities via Leveraging Peersxe2x80x99 Queuing Information for FullDuplex WLAN Fullduplex (FD) wireless is an attractive PHY technology with high potential to improve the throughput of WLAN due to bidirectional transmissions. However, existing FD MACs fail to fully take advantage of bidirectional transmissions because of neglecting a feature of FD wireless that whether to build bidirectional transmissions relies on the queuing state of peers. In this paper, we design PQMAC, the first FD MAC which exploits more bidirectional transmission opportunities by leveraging peersxe2x80x99 queuing information. Since PQMAC seizes the neglected but important feature, PQMAC can improve the performance with a slight transmission overhead. Simulations show that, in a 1cell FD WLAN, PQMAC can achieve higher throughput than existing MACs when the buffer of AP is relatively small (xe2x89xa4200 frames). When the buffer of AP is relatively large (u003e200 frames), PQMAC can reduce the queuing delay without the loss of throughput.

Fair and efficient resource allocation in IEEE 802.11ah WLAN with heterogeneous data rates Abstract   For dense wireless LANs (WLANs), IEEE 802.11ah has specified restricted access window (RAW) as the channel access scheme. Here the competing stations (STAs) are divided into groups and STAs belonging to each group attempt to access the channel during their designated RAW slot by invoking the distributed coordination function (DCF) protocol. This paper describes an analytical model to evaluate the throughput performance of IEEE 802.11ah WLAN, when STAs use distinct data rates and the RAW mechanism is implemented for medium sharing. When STAs are grouped randomly (i.e., without considering their data rates), a group will contain STAs operating at distinct data rates. Since all these STAs simultaneously contend for channel access based on DCF protocol, the throughput of high data rate STAs are downequalized to that of lower data rate STAs; thus the aggregate network throughput is degraded significantly. To resolve the resulting performance anomaly problem, we consider data rate based grouping where STAs operating at the same data rate are grouped together. We describe an algorithm for implementing data rate based grouping at the access point (AP). Further, we describe an analytical procedure to find the network throughput under data rate based grouping. Through numerical and experimental investigations, we establish that data rate based grouping can significantly improve the aggregate network throughput performance, as compared to the conventional random grouping strategy. Further, we use Jainxe2x80x99s fairness index (JFI) to establish that data rate based grouping can also provide fair resource allocation among the STAs operating at distinct data rates, by ensuring that all the competing STAs in the network achieve throughput proportional to their data rates.