A Frequency Assignment Technique for Effective SINR and Throughput Management in a Battlefield

Athindran Ramesh Kumar, N. P, J. K. Milleth
{"title":"A Frequency Assignment Technique for Effective SINR and Throughput Management in a Battlefield","authors":"Athindran Ramesh Kumar, N. P, J. K. Milleth","doi":"10.1109/NCC.2018.8600243","DOIUrl":null,"url":null,"abstract":"Spectrum is a scarce and precious resource in a battlefield. Multiple frequencies spread over different bands are available for usage in a battlefield. The frequencies need to be assigned to the nodes/Base Stations(BSs) in a battlefield in such a way as to meet the Signal-to-Interference-Noise Ratio(SINR) and throughput requirements of all the users. Previous attempts for frequency assignment abstract away the notion of SINR and throughput and usually constrain the distance between the frequencies required between pairs of interfering BSs. In this work, the frequency assignment that optimizes the SINR and throughput of all the users in a system while ensuring fairness among the users is found. A genetic algorithm is used to perform the unconstrained optimization and this method is termed as the efficient rate and SINR matcher with hyperbolic cost (ERSMHC). A high SINR initialization algorithm (HSIA) and a high throughput greedy rate matching algorithm (HTGRM) that can be used for quickly initializing the system are also presented. The ERSMHC algorithm is shown to aid in meeting the stipulated rate and throughput requirements of more number of users as compared to HSIA and HTGRM.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8600243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Spectrum is a scarce and precious resource in a battlefield. Multiple frequencies spread over different bands are available for usage in a battlefield. The frequencies need to be assigned to the nodes/Base Stations(BSs) in a battlefield in such a way as to meet the Signal-to-Interference-Noise Ratio(SINR) and throughput requirements of all the users. Previous attempts for frequency assignment abstract away the notion of SINR and throughput and usually constrain the distance between the frequencies required between pairs of interfering BSs. In this work, the frequency assignment that optimizes the SINR and throughput of all the users in a system while ensuring fairness among the users is found. A genetic algorithm is used to perform the unconstrained optimization and this method is termed as the efficient rate and SINR matcher with hyperbolic cost (ERSMHC). A high SINR initialization algorithm (HSIA) and a high throughput greedy rate matching algorithm (HTGRM) that can be used for quickly initializing the system are also presented. The ERSMHC algorithm is shown to aid in meeting the stipulated rate and throughput requirements of more number of users as compared to HSIA and HTGRM.
战场上有效信噪比和吞吐量管理的频率分配技术
频谱在战场上是一种稀缺而宝贵的资源。在战场上可以使用分布在不同频带上的多个频率。战场上的节点/基站(BSs)的频率分配需要满足所有用户的信噪比(SINR)和吞吐量要求。以前的频率分配尝试抽象了信噪比和吞吐量的概念,并且通常限制了干扰BSs对之间所需频率之间的距离。在这项工作中,找到了优化系统中所有用户的信噪比和吞吐量的频率分配,同时确保用户之间的公平性。采用遗传算法进行无约束优化,该方法被称为带双曲代价的效率和信噪比匹配(ERSMHC)。提出了一种高信噪比初始化算法(HSIA)和一种高吞吐量贪婪率匹配算法(HTGRM),可用于系统的快速初始化。与HSIA和HTGRM相比,ERSMHC算法有助于满足更多用户的规定速率和吞吐量要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信