基于ofdma的移动WiMAX网络中的蚁群信道感知时隙分配

I. Hwang, Chien-Yao Chiu, B. Hwang
{"title":"基于ofdma的移动WiMAX网络中的蚁群信道感知时隙分配","authors":"I. Hwang, Chien-Yao Chiu, B. Hwang","doi":"10.1109/ICPPW.2011.36","DOIUrl":null,"url":null,"abstract":"In this paper, a novel adaptive ant colony slot assignment (ACSA) algorithm including construct solution and pheromone update is proposed to assign OFDMA-based radio resource. The aim of ACSA is to achieve high bandwidth efficiency on the basis of specific channel conditions while guaranteeing the QoS requirements. Performance comparisons with the rate-guaranteed competitive scheduling (RCS) are presented in terms of delay, jitter, packet dropping rate, throughput and waste to highlight the better behavior of our proposed schemes.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Channel-Aware Slot Assignment by Ant Colony in OFDMA-Based Mobile WiMAX Networks\",\"authors\":\"I. Hwang, Chien-Yao Chiu, B. Hwang\",\"doi\":\"10.1109/ICPPW.2011.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel adaptive ant colony slot assignment (ACSA) algorithm including construct solution and pheromone update is proposed to assign OFDMA-based radio resource. The aim of ACSA is to achieve high bandwidth efficiency on the basis of specific channel conditions while guaranteeing the QoS requirements. Performance comparisons with the rate-guaranteed competitive scheduling (RCS) are presented in terms of delay, jitter, packet dropping rate, throughput and waste to highlight the better behavior of our proposed schemes.\",\"PeriodicalId\":173271,\"journal\":{\"name\":\"2011 40th International Conference on Parallel Processing Workshops\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 40th International Conference on Parallel Processing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2011.36\",\"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 40th International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2011.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种包含构造解和信息素更新的自适应蚁群时隙分配(ACSA)算法,用于ofdma无线资源分配。ACSA的目标是在保证QoS要求的同时,根据特定的信道条件实现高带宽效率。从延迟、抖动、丢包率、吞吐量和浪费等方面对RCS的性能进行了比较,以突出我们提出的方案的更好性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Channel-Aware Slot Assignment by Ant Colony in OFDMA-Based Mobile WiMAX Networks
In this paper, a novel adaptive ant colony slot assignment (ACSA) algorithm including construct solution and pheromone update is proposed to assign OFDMA-based radio resource. The aim of ACSA is to achieve high bandwidth efficiency on the basis of specific channel conditions while guaranteeing the QoS requirements. Performance comparisons with the rate-guaranteed competitive scheduling (RCS) are presented in terms of delay, jitter, packet dropping rate, throughput and waste to highlight the better behavior of our proposed schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信