arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.14367cs.NI
收藏

毫米波D2D通信中动态障碍下的分布式中继选择

Distributed Relay Selection in Presence of Dynamic Obstacles in Millimeter Wave D2D Communication

Durgesh Singh, Arpan Chattopadhyay, Sasthi C. Ghosh

摘要:

毫米波(mmWave)设备到设备(D2 D)通信由于严重的穿透损耗而极易受到障碍物的影响,并且几乎需要视线(LOS)通信路径A2 D信道条件对于设备/用户设备(UE)是本地的,因此对于基站(BS)是直接可见的\textit{not}。因此,D2 D信道的质量需要由UE传播到BS,这可能导致一些延迟。因此,由于移动的障碍物,由BS使用该收集的信道信息向UE提供的解决方案对于建立通信可能变得不太有用。这些类型的障碍可能事先不知道,因此可能导致D2 D信道质量的不可预测的波动。因此,我们试图学习D2 D信道使用有限时域部分可观测马尔可夫决策过程(POMDP)框架来建模这种网络环境中的不确定性与动态障碍。目标是当信道质量恶化时通过使UE在i)继续在其上正在发生通信的当前中继链路上或ii)通过探索其本地的其他可能UE切换到另一个好中继之间本地选择最佳可能决策来最小化延迟。我们推导出一个最优的阈值策略,告诉UE采取适当的决定本地。随后,我们给出了一个简化的和易于实现的固定阈值策略,该策略统计连续确认失败的数量,基于该数量,UE在本地做出适当的决策。通过大量的模拟,我们证明了我们的方法优于最近的算法。

英文摘要:

Millimeter wave (mmWave) device to device (D2D) communication is highly susceptible to obstacles due to severe penetration losses and requires almost a line of sight (LOS) communication path. D2D channel condition is local to devices/user equipments (UEs) and hence is \textit{not} directly visible to the base station (BS). Thus quality of the D2D channel needs to be propagated to BS by UEs which may incur some delay. Hence the solution provided by BS to UEs using this gathered channel information might become less useful to establish communication due to moving obstacles. These types of obstacles might not be known in advance and hence may cause unpredictable fluctuations to the D2D channel quality. Hence we seek to learn the D2D channels using the finite horizon partially observable Markov decision process (POMDP) framework to model the uncertainty in such kind of network environments with dynamic obstacles. The objective is to minimize delay when channel quality deteriorates, by making UEs choose locally the best possible decision between i) to continue on the current relay link on which communication is taking place or ii) to switch to another good relay by exploring other possible UEs in its locality. We derive an optimal threshold policy which tells the UE to take appropriate decision locally. Later, we give a simplified and easy to implement stationary threshold policy which counts the number of successive acknowledgement failures, based on which UE make appropriate decision locally. Through extensive simulation, we demonstrate that our approach outperforms recent algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑