首页> 外文会议>IEEE International Conference on Communication Workshop >D2D multi-hop routing: Collision probability and routing strategy with limited location information
【24h】

D2D multi-hop routing: Collision probability and routing strategy with limited location information

机译:D2D多跳路由:碰撞概率和路由策略具有有限的位置信息

获取原文

摘要

In this paper, we define a collision area in a heterogeneous cellular network for the purpose of interference management between Device-to-Device (D2D) and conventional cellular (CC) communications. Currently, most D2D routing algorithms assume synchronized accurate location knowledge among users and the base stations. In reality, this level of location accuracy is difficult and power consuming in Universal Mobile Telecommunications System (UMTS). In current Long-Term Evolution (LTE), there is no location information from the cell besides range information from time measurements. In the absence of accurate location information, we analyze the collision probability of the D2D multi-hop path hitting the defined collision area. Specifically, we consider the problem for three different routing scenarios: intra-cell, intra-cell to cell boundary, and cell boundary to boundary routing. As a result, we propose a dynamic switching strategy between D2D and CC communications in order to minimize mutual interference. The gradient-based switching strategy can avoid collision with the collision area and only requires knowledge of the current user and the final destination user's distances to the serving base station.
机译:在本文中,我们在非均相蜂窝网络中定义了用于设备到设备(D2D)和传统蜂窝(CC)通信之间的干扰管理的碰撞区域。目前,大多数D2D路由算法假设用户和基站之间的同步准确的位置知识。实际上,在通用移动电信系统(UMTS)中,这种位置精度难以且功耗难以消耗。在当前的长期演进(LTE)中,除了从时间测量的范围信息之外,小区没有来自小区的位置信息。在没有准确的位置信息的情况下,我们分析了击中定义的碰撞区域的D2D多跳路径的碰撞概率。具体而言,我们考虑三种不同的路由方案的问题:单元内,小区间到小区边界,细胞边界到边界路由。结果,我们提出了D2D和CC通信之间的动态切换策略,以便最大限度地减少相互干扰。基于梯度的交换策略可以避免与碰撞区域发生冲突,并且只需要对当前用户和最终目的地用户的距离到服务基站的碰撞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号