MIMO-OFDM无线局域网机会调度方案的性能研究

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI:10.1109/LCN.2008.4664226

M. Gidlund, P. Åhag

{"title":"MIMO-OFDM无线局域网机会调度方案的性能研究","authors":"M. Gidlund, P. Åhag","doi":"10.1109/LCN.2008.4664226","DOIUrl":null,"url":null,"abstract":"In this paper, we propose and investigate scheduling algorithms for multiple-input multiple-output (MIMO) wireless local area networks (WLANs) based on orthogonal frequency division multiplexing (OFDM). We propose two new scheduling approaches which combines the channel states with queue states. The obtained results show that the proposed schemes outperform well known schemes such as proportional fair (PF) and shortest remaining processing time (SRPT) in terms of throughput and fairness.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance of opportunistic scheduling schemes for MIMO-OFDM wireless LANs\",\"authors\":\"M. Gidlund, P. Åhag\",\"doi\":\"10.1109/LCN.2008.4664226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose and investigate scheduling algorithms for multiple-input multiple-output (MIMO) wireless local area networks (WLANs) based on orthogonal frequency division multiplexing (OFDM). We propose two new scheduling approaches which combines the channel states with queue states. The obtained results show that the proposed schemes outperform well known schemes such as proportional fair (PF) and shortest remaining processing time (SRPT) in terms of throughput and fairness.\",\"PeriodicalId\":218005,\"journal\":{\"name\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2008.4664226\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2008.4664226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出并研究了基于正交频分复用(OFDM)的多输入多输出(MIMO)无线局域网(wlan)调度算法。提出了两种将通道状态与队列状态相结合的调度方法。结果表明，本文提出的算法在吞吐量和公平性方面优于比例公平算法(PF)和最短剩余处理时间算法(SRPT)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Performance of opportunistic scheduling schemes for MIMO-OFDM wireless LANs

In this paper, we propose and investigate scheduling algorithms for multiple-input multiple-output (MIMO) wireless local area networks (WLANs) based on orthogonal frequency division multiplexing (OFDM). We propose two new scheduling approaches which combines the channel states with queue states. The obtained results show that the proposed schemes outperform well known schemes such as proportional fair (PF) and shortest remaining processing time (SRPT) in terms of throughput and fairness.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 33rd IEEE Conference on Local Computer Networks (LCN)

自引率

0.00%

发文量