双跳60ghz网络中链路和中继选择的分解原理

Zhifeng He, S. Mao
{"title":"双跳60ghz网络中链路和中继选择的分解原理","authors":"Zhifeng He, S. Mao","doi":"10.1109/INFOCOM.2016.7524517","DOIUrl":null,"url":null,"abstract":"We investigate the scheduling problem in a centralized dual-hop 60 GHz network with multiple Source-Destination (SD) pairs, relays, and a PicoNet Coordinator (PNC). The objective is to minimize the Maximum Expected Delivery Time (MEDT) among all SD pairs by jointly optimizing relay and link selection, while exploiting reflected mmWave transmissions and considering link blockage dynamics. We develop a Decomposition Principle to transform this problem into two sub-problems, one for link selection and the other for relay assignment when there is enough replays. We prove that the proposed scheme can achieve an optimality gap of just 1 time slot at greatly reduced complexity. We also develop a heuristic scheme to handle the case when there is no enough relays. The proposed schemes are validated with simulations, where their superior performance is observed.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A decomposition principle for link and relay selection in dual-hop 60 GHz networks\",\"authors\":\"Zhifeng He, S. Mao\",\"doi\":\"10.1109/INFOCOM.2016.7524517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the scheduling problem in a centralized dual-hop 60 GHz network with multiple Source-Destination (SD) pairs, relays, and a PicoNet Coordinator (PNC). The objective is to minimize the Maximum Expected Delivery Time (MEDT) among all SD pairs by jointly optimizing relay and link selection, while exploiting reflected mmWave transmissions and considering link blockage dynamics. We develop a Decomposition Principle to transform this problem into two sub-problems, one for link selection and the other for relay assignment when there is enough replays. We prove that the proposed scheme can achieve an optimality gap of just 1 time slot at greatly reduced complexity. We also develop a heuristic scheme to handle the case when there is no enough relays. The proposed schemes are validated with simulations, where their superior performance is observed.\",\"PeriodicalId\":274591,\"journal\":{\"name\":\"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOM.2016.7524517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2016.7524517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

我们研究了一个集中式双跳60ghz网络中的调度问题,该网络具有多个源-目的(SD)对、中继和一个PicoNet协调器(PNC)。目标是通过联合优化中继和链路选择,同时利用反射毫米波传输并考虑链路阻塞动态,最大限度地减少所有SD对之间的最大预期传输时间(MEDT)。利用分解原理将该问题分解为两个子问题,一个是链路选择问题,另一个是中继分配问题。我们证明了该方案可以在大大降低复杂度的情况下实现仅1个时隙的最优性间隙。我们还开发了一种启发式方案来处理没有足够继电器的情况。通过仿真验证了所提方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A decomposition principle for link and relay selection in dual-hop 60 GHz networks
We investigate the scheduling problem in a centralized dual-hop 60 GHz network with multiple Source-Destination (SD) pairs, relays, and a PicoNet Coordinator (PNC). The objective is to minimize the Maximum Expected Delivery Time (MEDT) among all SD pairs by jointly optimizing relay and link selection, while exploiting reflected mmWave transmissions and considering link blockage dynamics. We develop a Decomposition Principle to transform this problem into two sub-problems, one for link selection and the other for relay assignment when there is enough replays. We prove that the proposed scheme can achieve an optimality gap of just 1 time slot at greatly reduced complexity. We also develop a heuristic scheme to handle the case when there is no enough relays. The proposed schemes are validated with simulations, where their superior performance is observed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信