移动WiMAX的链路感知非请求授权业务包调度

D. S. Shu'aibu, S. Yusof, N. Fisal
{"title":"移动WiMAX的链路感知非请求授权业务包调度","authors":"D. S. Shu'aibu, S. Yusof, N. Fisal","doi":"10.1109/ICMSAO.2011.5775622","DOIUrl":null,"url":null,"abstract":"Packet scheduling in wireless network is one of the issues that requires attention to quality of service provision (QoS). In heterogeneous wireless network, whereby many packets of different QoS are involved, packet scheduling becomes more difficult. This paper presents packet scheduling algorithm that uses earliest deadline first for scheduling constant bit rate packets. We estimate the wireless link based on the total path loss and obtain SNR value of the packet for scheduling. The simulation shows that the proposed algorithm has achieved higher throughput.","PeriodicalId":6383,"journal":{"name":"2011 Fourth International Conference on Modeling, Simulation and Applied Optimization","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Link aware unsolicited grant service packet scheduling for mobile WiMAX\",\"authors\":\"D. S. Shu'aibu, S. Yusof, N. Fisal\",\"doi\":\"10.1109/ICMSAO.2011.5775622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Packet scheduling in wireless network is one of the issues that requires attention to quality of service provision (QoS). In heterogeneous wireless network, whereby many packets of different QoS are involved, packet scheduling becomes more difficult. This paper presents packet scheduling algorithm that uses earliest deadline first for scheduling constant bit rate packets. We estimate the wireless link based on the total path loss and obtain SNR value of the packet for scheduling. The simulation shows that the proposed algorithm has achieved higher throughput.\",\"PeriodicalId\":6383,\"journal\":{\"name\":\"2011 Fourth International Conference on Modeling, Simulation and Applied Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Conference on Modeling, Simulation and Applied Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMSAO.2011.5775622\",\"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 Fourth International Conference on Modeling, Simulation and Applied Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSAO.2011.5775622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

无线网络中的分组调度是服务提供质量(QoS)需要关注的问题之一。在异构无线网络中,由于涉及许多不同QoS的分组,使得分组调度变得更加困难。提出了一种采用最早截止日期优先调度恒比特率包的分组调度算法。我们基于总路径损耗来估计无线链路,并获得数据包的信噪比值用于调度。仿真结果表明,该算法具有较高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link aware unsolicited grant service packet scheduling for mobile WiMAX
Packet scheduling in wireless network is one of the issues that requires attention to quality of service provision (QoS). In heterogeneous wireless network, whereby many packets of different QoS are involved, packet scheduling becomes more difficult. This paper presents packet scheduling algorithm that uses earliest deadline first for scheduling constant bit rate packets. We estimate the wireless link based on the total path loss and obtain SNR value of the packet for scheduling. The simulation shows that the proposed algorithm has achieved higher throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信