【24h】

Base station assisted neighbor discovery in device to device systems

机译:设备到设备系统中的基站辅助邻居发现

获取原文
获取原文并翻译 | 示例

摘要

Neighbor discovery is an essential prerequisite for any device-to-device (D2D) communication. Unlike ad-hoc networks, the base station (BS) in D2D networks may facilitate the neighbor discovery process. However, device-to-BS channel states or device locations are not enough to provide BS with information on the channel quality between the devices. Thus, due to the inherent uncertainty of link quality between devices, the BS-assisted neighbor discovery cannot be treated as typical scheduling problem. In this paper, we investigate the assisted directional neighbor discovery in D2D networks. We first formulate the scheduling problem as an integer optimization problem that captures the uncertainty. Then we propose a greedy based centralized scheduling to determine directional pilot transmission instances. We also propose a one-way randomized discovery, where we choose the directional transmission probabilities based on two techniques, an intuitive and an optimized methods. Finally, we provide simulation results that assess the performance the schemes.
机译:邻居发现是任何设备到设备(D2D)通信的基本前提。与自组织网络不同,D2D网络中的基站(BS)可以促进邻居发现过程。然而,设备到BS的信道状态或设备位置不足以向BS提供关于设备之间的信道质量的信息。因此,由于设备之间链路质量的固有不确定性,因此无法将BS辅助的邻居发现视为典型的调度问题。在本文中,我们研究了D2D网络中的辅助定向邻居发现。我们首先将调度问题表述为捕获不确定性的整数优化问题。然后,我们提出了一个基于贪婪的集中式调度,以确定定向导频传输实例。我们还提出了一种单向随机发现方法,其中我们根据两种技术(一种直观的方法和一种优化的方法)选择定向传输概率。最后,我们提供评估方案性能的仿真结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号