Joint stream allocation and scheduling for single-user MIMO communication in WMNs

M. Bansal, A. Trivedi
{"title":"Joint stream allocation and scheduling for single-user MIMO communication in WMNs","authors":"M. Bansal, A. Trivedi","doi":"10.1109/NCC.2011.5734740","DOIUrl":null,"url":null,"abstract":"Multiple-Input Multiple-Output (MIMO) technology has great potential for improving the throughput of Wireless Mesh Networks (WMNs). In this paper, we investigate the joint stream allocation and scheduling problem for single-user MIMO communication in WMNs with the objective of maximizing the demand satisfaction for a set of flows. The notion of transmission configuration (TC) is introduced and a heuristic algorithm is proposed to find a good subset of all possible TCs. Using these TCs, the joint stream allocation and scheduling problem is formulated as a linear programming (LP) and a convex program (CP) to obtain the maximum throughput and proportional fair solutions. To find the optimal solutions, we also introduce a scheme to enumerate all possible TCs. The simulation results demonstrate that performance of the proposed heuristic algorithm is very near to the optimal solution. The computational complexity of the proposed heuristic algorithm is substantially less compared to the optimal. In addition, we show that as the number of antennas increases, the demand satisfaction and the network throughput increase linearly.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"172 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2011.5734740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Multiple-Input Multiple-Output (MIMO) technology has great potential for improving the throughput of Wireless Mesh Networks (WMNs). In this paper, we investigate the joint stream allocation and scheduling problem for single-user MIMO communication in WMNs with the objective of maximizing the demand satisfaction for a set of flows. The notion of transmission configuration (TC) is introduced and a heuristic algorithm is proposed to find a good subset of all possible TCs. Using these TCs, the joint stream allocation and scheduling problem is formulated as a linear programming (LP) and a convex program (CP) to obtain the maximum throughput and proportional fair solutions. To find the optimal solutions, we also introduce a scheme to enumerate all possible TCs. The simulation results demonstrate that performance of the proposed heuristic algorithm is very near to the optimal solution. The computational complexity of the proposed heuristic algorithm is substantially less compared to the optimal. In addition, we show that as the number of antennas increases, the demand satisfaction and the network throughput increase linearly.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
WMNs中单用户MIMO通信的联合流分配与调度
多输入多输出(MIMO)技术在提高无线网状网络(WMNs)的吞吐量方面具有很大的潜力。本文以一组流的需求满足最大化为目标,研究了WMNs中单用户MIMO通信的联合流分配和调度问题。引入了传输组态的概念,提出了一种启发式算法来寻找所有可能的传输组态的良好子集。利用这些tc,将联合流分配和调度问题表述为线性规划(LP)和凸规划(CP),以获得最大吞吐量和比例公平的解。为了找到最优解,我们还引入了一种枚举所有可能的tc的方案。仿真结果表明,所提启发式算法的性能非常接近最优解。与最优算法相比,所提出的启发式算法的计算复杂度大大降低。此外,我们还表明,随着天线数量的增加,需求满意度和网络吞吐量呈线性增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Copyright page Joint stream allocation and scheduling for single-user MIMO communication in WMNs New approach to joint MIMO precoding for 2-way AF relay systems Energy-aware data centre management Prediction of SINR improvement with a directional antenna or antenna array in a cellular system
×
引用
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