A Low-complex/High-throughput Resource Allocation for Multicast D2D Communications

S. Moghaddam, M. Ghasemi
{"title":"A Low-complex/High-throughput Resource Allocation for Multicast D2D Communications","authors":"S. Moghaddam, M. Ghasemi","doi":"10.1109/ICCCE.2018.8539307","DOIUrl":null,"url":null,"abstract":"The main objective of this research is to find a resource allocation method for multicast device-to-device (D2D) communications underlaying cellular network. Assuming that the D2D users are grouped in the clusters, resource allocation is performed using six different criteria, two of which are based on the outage probability, and the other ones are based on the signal to interference plus noise ratio (SINR). The methodology is to optimally allocate the resources to the clusters based on a table including the minimum SINR (referred to S-table) or maximum outage probability (referred to O-table) of different users in the reused cellular radio resources. By comparing the numerical analysis of different methods with the simulation results of the Hungarian algorithm in the view of the total throughput and minimum and maximum outage probabilities, it is demonstrated that the allocation priority for the best low-complex method is given to the clusters with the lowest average channel quality. It is shown that, while the outage probability is below an acceptable threshold level and the computational complexity decreases with respect to the Hungarian algorithm, an increase in the throughput is obtained.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCE.2018.8539307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The main objective of this research is to find a resource allocation method for multicast device-to-device (D2D) communications underlaying cellular network. Assuming that the D2D users are grouped in the clusters, resource allocation is performed using six different criteria, two of which are based on the outage probability, and the other ones are based on the signal to interference plus noise ratio (SINR). The methodology is to optimally allocate the resources to the clusters based on a table including the minimum SINR (referred to S-table) or maximum outage probability (referred to O-table) of different users in the reused cellular radio resources. By comparing the numerical analysis of different methods with the simulation results of the Hungarian algorithm in the view of the total throughput and minimum and maximum outage probabilities, it is demonstrated that the allocation priority for the best low-complex method is given to the clusters with the lowest average channel quality. It is shown that, while the outage probability is below an acceptable threshold level and the computational complexity decreases with respect to the Hungarian algorithm, an increase in the throughput is obtained.
一种低复杂度/高吞吐量的组播D2D通信资源分配方法
本研究的主要目的是寻找一种基于蜂窝网络的多播设备对设备(D2D)通信的资源分配方法。假设将D2D用户分组在集群中,使用六种不同的标准进行资源分配,其中两种基于中断概率,另一种基于信噪比(SINR)。该方法是基于一个表,包括重用的蜂窝无线电资源中不同用户的最小SINR(称为s表)或最大中断概率(称为o表),将资源最佳地分配给集群。从总吞吐量、最小中断概率和最大中断概率两方面将不同方法的数值分析与匈牙利算法的仿真结果进行比较,结果表明,对于平均信道质量最低的簇,最佳低复杂度方法的分配优先级最高。结果表明,虽然中断概率低于可接受的阈值水平,并且计算复杂度相对于匈牙利算法有所降低,但吞吐量有所增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信