IEEE802.16 Mesh模式下的高并发率带宽分配模型

Jianfeng Chen, Caixia Chi, Q. Guo
{"title":"IEEE802.16 Mesh模式下的高并发率带宽分配模型","authors":"Jianfeng Chen, Caixia Chi, Q. Guo","doi":"10.1109/APCC.2005.1554162","DOIUrl":null,"url":null,"abstract":"In this paper, a bandwidth allocation model is proposed for multi-hop wireless mesh network (WMN) with a goal of achieving high traffic throughput in minimal scheduling time slots. Scheduling scheme based on the optimization model serves the centralized scheduling first and compresses the scheduling time to minimum by enhancing concurrence rate among links, thus more time slots can be saved for distributed scheduling. Simulation results show that this model has higher concurrence rate and reduces nearly 50% centralized time slots than FIFO serving mode","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"A Bandwidth Allocation Model with High Concurrence Rate in IEEE802.16 Mesh Mode\",\"authors\":\"Jianfeng Chen, Caixia Chi, Q. Guo\",\"doi\":\"10.1109/APCC.2005.1554162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a bandwidth allocation model is proposed for multi-hop wireless mesh network (WMN) with a goal of achieving high traffic throughput in minimal scheduling time slots. Scheduling scheme based on the optimization model serves the centralized scheduling first and compresses the scheduling time to minimum by enhancing concurrence rate among links, thus more time slots can be saved for distributed scheduling. Simulation results show that this model has higher concurrence rate and reduces nearly 50% centralized time slots than FIFO serving mode\",\"PeriodicalId\":176147,\"journal\":{\"name\":\"2005 Asia-Pacific Conference on Communications\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2005.1554162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2005.1554162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

本文提出了一种多跳无线网状网络(WMN)的带宽分配模型,其目标是在最小调度时隙内实现高流量吞吐量。基于优化模型的调度方案首先服务于集中式调度,通过提高链路间的并发率,将调度时间压缩到最小,从而为分布式调度节省更多的时隙。仿真结果表明,与先进先出服务模式相比,该模型具有更高的并发率,并减少了近50%的集中时隙
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Bandwidth Allocation Model with High Concurrence Rate in IEEE802.16 Mesh Mode
In this paper, a bandwidth allocation model is proposed for multi-hop wireless mesh network (WMN) with a goal of achieving high traffic throughput in minimal scheduling time slots. Scheduling scheme based on the optimization model serves the centralized scheduling first and compresses the scheduling time to minimum by enhancing concurrence rate among links, thus more time slots can be saved for distributed scheduling. Simulation results show that this model has higher concurrence rate and reduces nearly 50% centralized time slots than FIFO serving mode
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信