机会波束形成系统中基于DSmT的调度算法

Feichi Long, Tiejun Lv, Hui Gao, Pengfei Chang
{"title":"机会波束形成系统中基于DSmT的调度算法","authors":"Feichi Long, Tiejun Lv, Hui Gao, Pengfei Chang","doi":"10.1109/CTS.2011.5898983","DOIUrl":null,"url":null,"abstract":"A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station's (BS) choice can be appropriately calculated in DSmT's framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DSmT based scheduling algorithm in opportunistic beamforming systems\",\"authors\":\"Feichi Long, Tiejun Lv, Hui Gao, Pengfei Chang\",\"doi\":\"10.1109/CTS.2011.5898983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station's (BS) choice can be appropriately calculated in DSmT's framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.\",\"PeriodicalId\":142306,\"journal\":{\"name\":\"2011 18th International Conference on Telecommunications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 18th International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CTS.2011.5898983\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 18th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTS.2011.5898983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于Dezert-Smarandache理论(DSmT)的机会波束形成系统调度方法。通过对每个用户的系统吞吐量、公平性和时延进行联合优化,与比例公平调度(PFS)相比,该算法可以实现更大的系统吞吐量和更低的平均时延,且公平性和可接受的复杂度大致相同。此外,与PFS中的情况不同,用于在系统吞吐量和公平性之间进行权衡的参数对于各种实际设置都是有效的,因为每个用户在基站(BS)选择中所占的权重可以在DSmT框架中适当地计算出来。仿真结果表明,该算法在四个指标上均优于PFS等传统调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DSmT based scheduling algorithm in opportunistic beamforming systems
A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station's (BS) choice can be appropriately calculated in DSmT's framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信