蜂窝系统D2D通信冲突图的构建

Wenbin Wu, Yuan Zhang
{"title":"蜂窝系统D2D通信冲突图的构建","authors":"Wenbin Wu, Yuan Zhang","doi":"10.1109/WCSP.2014.6992092","DOIUrl":null,"url":null,"abstract":"This paper presents a new method for constructing a conflict graph for D2D communications in cellular systems, which is useful for efficient radio resource allocation for D2D links. The construction is an iterative process which includes a broadcast-and-acknowledgment protocol. The convergence and delay performance of the proposed constructing process is theoretically analyzed. Simulation results demonstrate that our method have good performance in constructing the conflict graph and the result of theoretical analysis matches well with the simulation results.","PeriodicalId":412971,"journal":{"name":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Constructing conflict graph for D2D communications in cellular systems\",\"authors\":\"Wenbin Wu, Yuan Zhang\",\"doi\":\"10.1109/WCSP.2014.6992092\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method for constructing a conflict graph for D2D communications in cellular systems, which is useful for efficient radio resource allocation for D2D links. The construction is an iterative process which includes a broadcast-and-acknowledgment protocol. The convergence and delay performance of the proposed constructing process is theoretically analyzed. Simulation results demonstrate that our method have good performance in constructing the conflict graph and the result of theoretical analysis matches well with the simulation results.\",\"PeriodicalId\":412971,\"journal\":{\"name\":\"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2014.6992092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2014.6992092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种构建蜂窝D2D通信冲突图的新方法,该方法有助于D2D链路的有效无线电资源分配。该构造是一个迭代过程,其中包括广播和确认协议。从理论上分析了该构造过程的收敛性和延迟性能。仿真结果表明,该方法具有较好的构造冲突图的性能,理论分析结果与仿真结果吻合较好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constructing conflict graph for D2D communications in cellular systems
This paper presents a new method for constructing a conflict graph for D2D communications in cellular systems, which is useful for efficient radio resource allocation for D2D links. The construction is an iterative process which includes a broadcast-and-acknowledgment protocol. The convergence and delay performance of the proposed constructing process is theoretically analyzed. Simulation results demonstrate that our method have good performance in constructing the conflict graph and the result of theoretical analysis matches well with the simulation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信