排队约束下D2D通信联合模式选择与资源分配

Yi Li, M. C. Gursoy, Senem Velipasalar
{"title":"排队约束下D2D通信联合模式选择与资源分配","authors":"Yi Li, M. C. Gursoy, Senem Velipasalar","doi":"10.1109/INFCOMW.2016.7562126","DOIUrl":null,"url":null,"abstract":"Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"51 11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Joint mode selection and resource allocation for D2D communications under queueing constraints\",\"authors\":\"Yi Li, M. C. Gursoy, Senem Velipasalar\",\"doi\":\"10.1109/INFCOMW.2016.7562126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.\",\"PeriodicalId\":348177,\"journal\":{\"name\":\"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"51 11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2016.7562126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2016.7562126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

基于蜂窝网络的设备对设备通信(D2D)是一种新的通信模式,旨在提高蜂窝网络的性能。通过允许一对D2D用户直接通信,与蜂窝用户共享相同的频谱资源,D2D通信可以实现更高的频谱效率,提高能源效率,降低业务延迟。本文提出了一种新的信道匹配算法,用于联合模式选择和信道分配,目标是在统计排队约束下最大化系统吞吐量。考虑了七种可能的模式,即D2D蜂窝模式、D2D专用模式、上行专用模式、下行专用模式、上行复用模式、下行复用模式和D2D复用模式。利用随机网络演算的工具,通过确定有效容量来表征吞吐量。我们将信道分配问题表述为一个最大权重匹配问题,该问题可以用匈牙利算法来解决。通过仿真结果,验证了本文提出的匹配算法所取得的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint mode selection and resource allocation for D2D communications under queueing constraints
Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信