Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/110583
題名: | Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks | 作者: | 郭桐惟 Kuo, Tung-Wei;Lee, Kuang-Che;Lin, Kate Ching-Ju;Tsai, Ming-Jer |
貢獻者: | 資科系 | 日期: | Apr-2014 | 上傳時間: | 29-Jun-2017 | 摘要: | In multiuser MIMO (MU-MIMO) LANs, the achievable throughput of a client depends on who is transmitting concurrently with it. Existing MU-MIMO MAC protocols, however, enable clients to use the traditional 802.11 contention to contend for concurrent transmission opportunities on the uplink. Such a contention-based protocol not only wastes lots of channel time on multiple rounds of contention but also fails to maximally deliver the gain of MU-MIMO because users randomly join concurrent transmissions without considering their channel characteristics. To address such inefficiency, this paper introduces MIMOMate, a leader-contention-based MU-MIMO MAC protocol that matches clients as concurrent transmitters according to their channel characteristics to maximally deliver the MU-MIMO gain while ensuring all users fairly share concurrent transmission opportunities. Furthermore, MIMOMate elects the leader of the matched users to contend for transmission opportunities using traditional 802.11 CSMA/CA. It hence requires only a single contention overhead for concurrent streams and can be compatible with legacy 802.11 devices. A prototype implementation in USRP N200 shows that MIMOMate achieves an average throughput gain of 1.42× and $1.52× over the traditional contention-based protocol for two- and three-antenna AP scenarios, respectively, and also provides fairness for clients. | 關聯: | IEEE Transactions on Wireless Communications, 13(8), 4389-4400 | 資料類型: | article | DOI: | http://dx.doi.org/10.1109/TWC.2014.2320908 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
4389-4400.pdf | 881.08 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.