基于OFDM的蜂窝系统动态分组分配性能分析

R. Jayaparvathy, S. Anand, S. Srikanth
{"title":"基于OFDM的蜂窝系统动态分组分配性能分析","authors":"R. Jayaparvathy, S. Anand, S. Srikanth","doi":"10.1109/APCC.2003.1274354","DOIUrl":null,"url":null,"abstract":"In this paper, we present a performance analysis of OFDM based cellular systems when using dynamic packet assignment in the uplink. We propose a two dimensional Markov chain to model the state of the traffic in each cell of a cellular system with data-only traffic and solve this Markov chain to compute the buffering probability, mean delay, and the average system throughput. We perform simulations to determine the optimum position of the base station at which we obtain the best system performance in terms of mean delay. We show that dynamic packet assignment provides improved performance compared to dynamic channel assignment in terms of Erlang capacity. We also show that our analytical model is accurate and computationally efficient.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dynamic packet assignment in OFDM based cellular systems - performance analysis\",\"authors\":\"R. Jayaparvathy, S. Anand, S. Srikanth\",\"doi\":\"10.1109/APCC.2003.1274354\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a performance analysis of OFDM based cellular systems when using dynamic packet assignment in the uplink. We propose a two dimensional Markov chain to model the state of the traffic in each cell of a cellular system with data-only traffic and solve this Markov chain to compute the buffering probability, mean delay, and the average system throughput. We perform simulations to determine the optimum position of the base station at which we obtain the best system performance in terms of mean delay. We show that dynamic packet assignment provides improved performance compared to dynamic channel assignment in terms of Erlang capacity. We also show that our analytical model is accurate and computationally efficient.\",\"PeriodicalId\":277507,\"journal\":{\"name\":\"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2003.1274354\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2003.1274354","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文对基于OFDM的蜂窝系统在上行链路中使用动态分组分配时的性能进行了分析。我们提出了一个二维的马尔可夫链来模拟一个只有数据流量的元胞系统中每个单元的流量状态,并求解该马尔可夫链来计算缓冲概率、平均延迟和平均系统吞吐量。我们进行了模拟以确定基站的最佳位置,在此位置上我们可以获得最佳的系统性能,即平均延迟。我们表明,在Erlang容量方面,与动态通道分配相比,动态数据包分配提供了更好的性能。我们还表明,我们的分析模型是准确的,计算效率高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic packet assignment in OFDM based cellular systems - performance analysis
In this paper, we present a performance analysis of OFDM based cellular systems when using dynamic packet assignment in the uplink. We propose a two dimensional Markov chain to model the state of the traffic in each cell of a cellular system with data-only traffic and solve this Markov chain to compute the buffering probability, mean delay, and the average system throughput. We perform simulations to determine the optimum position of the base station at which we obtain the best system performance in terms of mean delay. We show that dynamic packet assignment provides improved performance compared to dynamic channel assignment in terms of Erlang capacity. We also show that our analytical model is accurate and computationally efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信