ou: MU-MIMO WLAN中最优用户选择

Yizirui Zhou, Anfu Zhou, Min Liu
{"title":"ou: MU-MIMO WLAN中最优用户选择","authors":"Yizirui Zhou, Anfu Zhou, Min Liu","doi":"10.1109/ICCNC.2016.7440681","DOIUrl":null,"url":null,"abstract":"In multiuser MIMO (MU-MIMO) networks, different users can transmit packets to the AP concurrently, thereby network capacity could be significantly improved. Previous works, using the conventional user selection schemes, have shown the promise of MU-MIMO in practical WLANs. However, we find that, to harness the full potential of MU-MIMO, an optimal user selection scheme is required. In this paper, we formulate the user selection problem in MU-MIMO as a discrete constrained optimization problem, and by decomposing and solving this problem, we design an optimal selection scheme called OUS. OUS efficiently allocates network resources so as to improve both the overall throughput of a network and fairness among users. We conduct extensive simulations to evaluate performance of OUS, and the simulation results show that compared with previous works, OUS improves the overall throughput by 40% and improves the fairness by 30% in most cases.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"OUS: Optimal user selection in MU-MIMO WLAN\",\"authors\":\"Yizirui Zhou, Anfu Zhou, Min Liu\",\"doi\":\"10.1109/ICCNC.2016.7440681\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In multiuser MIMO (MU-MIMO) networks, different users can transmit packets to the AP concurrently, thereby network capacity could be significantly improved. Previous works, using the conventional user selection schemes, have shown the promise of MU-MIMO in practical WLANs. However, we find that, to harness the full potential of MU-MIMO, an optimal user selection scheme is required. In this paper, we formulate the user selection problem in MU-MIMO as a discrete constrained optimization problem, and by decomposing and solving this problem, we design an optimal selection scheme called OUS. OUS efficiently allocates network resources so as to improve both the overall throughput of a network and fairness among users. We conduct extensive simulations to evaluate performance of OUS, and the simulation results show that compared with previous works, OUS improves the overall throughput by 40% and improves the fairness by 30% in most cases.\",\"PeriodicalId\":308458,\"journal\":{\"name\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2016.7440681\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2016.7440681","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在多用户MIMO (MU-MIMO)网络中,不同的用户可以同时向AP发送数据包,从而可以显著提高网络容量。以往的工作,使用传统的用户选择方案,已经显示出MU-MIMO在实际无线局域网中的前景。然而,我们发现,要充分利用MU-MIMO的潜力,需要一个最佳的用户选择方案。本文将MU-MIMO中的用户选择问题表述为一个离散约束优化问题,并通过对该问题的分解和求解,设计了一种称为OUS的最优选择方案。ou可以有效地分配网络资源,从而提高网络的整体吞吐量和用户之间的公平性。我们进行了大量的仿真来评估ou的性能,仿真结果表明,与以前的工作相比,ou在大多数情况下提高了40%的总吞吐量,提高了30%的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
OUS: Optimal user selection in MU-MIMO WLAN
In multiuser MIMO (MU-MIMO) networks, different users can transmit packets to the AP concurrently, thereby network capacity could be significantly improved. Previous works, using the conventional user selection schemes, have shown the promise of MU-MIMO in practical WLANs. However, we find that, to harness the full potential of MU-MIMO, an optimal user selection scheme is required. In this paper, we formulate the user selection problem in MU-MIMO as a discrete constrained optimization problem, and by decomposing and solving this problem, we design an optimal selection scheme called OUS. OUS efficiently allocates network resources so as to improve both the overall throughput of a network and fairness among users. We conduct extensive simulations to evaluate performance of OUS, and the simulation results show that compared with previous works, OUS improves the overall throughput by 40% and improves the fairness by 30% in most cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Public scene recognition using mobile phone sensors Mixed signal detection and carrier frequency estimation based on spectral coherent features A queue-length based distributed scheduling for CSMA-driven Wireless Mesh Networks GreenTCAM: A memory- and energy-efficient TCAM-based packet classification Hierarchical traffic engineering based on model predictive control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1