Optimization of LTE radio resource block allocation for maritime channels

Amit Kachroo, M. K. Özdemir, Hatice Tekiner-Mogulkoc
{"title":"Optimization of LTE radio resource block allocation for maritime channels","authors":"Amit Kachroo, M. K. Özdemir, Hatice Tekiner-Mogulkoc","doi":"10.1109/SARNOF.2016.7846771","DOIUrl":null,"url":null,"abstract":"In this study, we describe the behavior of LTE over the sea and investigate the problem of radio resource block allocation in such SINR limited maritime channels. For simulations of such sea environment, we considered a network scenario of Bosphorus Strait in Istanbul, Turkey with different number of ships ferrying between two ports at a given time. After exploiting the network characteristics, we formulated and solved the radio resource allocation problem by max-min integer linear programming method. The radio resource allocation fairness in terms of Jain's fairness index was computed and it was compared with round robin and opportunistic methods. Results show that the max-min optimization method performs better than the opportunistic and round robin methods. This result in turn reflects that the max-min optimization method gives us the high minimum best throughput as compared to other two methods considering different ship density scenarios in the sea. Also, it was observed that as the number of ships begin to increase in the sea, the max-min method performs significantly better with good fairness as compared to the other two methods.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 37th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2016.7846771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this study, we describe the behavior of LTE over the sea and investigate the problem of radio resource block allocation in such SINR limited maritime channels. For simulations of such sea environment, we considered a network scenario of Bosphorus Strait in Istanbul, Turkey with different number of ships ferrying between two ports at a given time. After exploiting the network characteristics, we formulated and solved the radio resource allocation problem by max-min integer linear programming method. The radio resource allocation fairness in terms of Jain's fairness index was computed and it was compared with round robin and opportunistic methods. Results show that the max-min optimization method performs better than the opportunistic and round robin methods. This result in turn reflects that the max-min optimization method gives us the high minimum best throughput as compared to other two methods considering different ship density scenarios in the sea. Also, it was observed that as the number of ships begin to increase in the sea, the max-min method performs significantly better with good fairness as compared to the other two methods.
海上信道LTE无线电资源块分配优化
在本研究中,我们描述了海上LTE的行为,并研究了在这种信噪比有限的海上信道中无线电资源块分配问题。为了模拟这样的海洋环境,我们考虑了土耳其伊斯坦布尔博斯普鲁斯海峡的网络场景,在给定的时间内,两个港口之间有不同数量的船只。在充分利用网络特性的基础上,利用最大-最小整数线性规划方法,提出并求解了无线资源分配问题。计算了基于Jain公平性指数的无线资源分配公平性,并与轮循和机会方法进行了比较。结果表明,最大最小优化方法优于机会优化方法和轮循优化方法。这一结果反过来反映了在考虑不同船舶密度的情况下,与其他两种方法相比,最大最小优化方法为我们提供了更高的最小最佳吞吐量。此外,我们还观察到,随着海上船舶数量的增加,max-min方法的性能明显优于其他两种方法,具有良好的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信