A tractable algorithm for fair and efficient uplink scheduling of multi-hop wimax mesh networks

M. Cao, V. Raghunathan, P. kumar
{"title":"A tractable algorithm for fair and efficient uplink scheduling of multi-hop wimax mesh networks","authors":"M. Cao, V. Raghunathan, P. kumar","doi":"10.1109/WIMESH.2006.288622","DOIUrl":null,"url":null,"abstract":"The IEEE 802.16 standard, also known as WiMax, provides a mechanism for deploying high-speed wireless mesh network in metropolitan areas. In this paper, we propose an algorithm for the data sub-channel allocation, i.e., transmission scheduling, of WiMax based mesh networks. The goal is to increase spatial reuse, achieve high system throughput, and provide fair access for the subscriber stations. In contrast to the previous \"hard\" fairness definitions, we introduce a new fairness notion that is imposed contingent on the actual traffic demands, in such a way that a higher capacity region can be achieved. We formulate a scheduling problem whose objective is to maximize the system throughput under our fairness model. We also develop an efficient algorithm to find the optimal schedule and the accompanying resource allocation. The performance of the scheduling algorithm is evaluated through simulations.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"99","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 2nd IEEE Workshop on Wireless Mesh Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIMESH.2006.288622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 99

Abstract

The IEEE 802.16 standard, also known as WiMax, provides a mechanism for deploying high-speed wireless mesh network in metropolitan areas. In this paper, we propose an algorithm for the data sub-channel allocation, i.e., transmission scheduling, of WiMax based mesh networks. The goal is to increase spatial reuse, achieve high system throughput, and provide fair access for the subscriber stations. In contrast to the previous "hard" fairness definitions, we introduce a new fairness notion that is imposed contingent on the actual traffic demands, in such a way that a higher capacity region can be achieved. We formulate a scheduling problem whose objective is to maximize the system throughput under our fairness model. We also develop an efficient algorithm to find the optimal schedule and the accompanying resource allocation. The performance of the scheduling algorithm is evaluated through simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多跳wimax网状网络中公平、高效的上行调度算法
IEEE 802.16标准,也称为WiMax,提供了在城域网部署高速无线网状网络的机制。本文提出了一种基于WiMax网状网络的数据子信道分配算法,即传输调度算法。目标是增加空间重用,实现高系统吞吐量,并为用户站提供公平的访问。与之前的“硬”公平性定义相比,我们引入了一个新的公平性概念,该概念是根据实际流量需求强加的,以这种方式可以实现更高的容量区域。在公平性模型下,提出了一个以系统吞吐量最大化为目标的调度问题。我们还开发了一种有效的算法来寻找最优调度和相应的资源分配。通过仿真对调度算法的性能进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm Multi-hop cooperative transmissions in wireless sensor networks Detecting wormhole attacks in wireless networks Self-certified public key generation on the intel mote 2 sensor network platform A service-oriented query architecture for sensor-actuator networks
×
引用
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