Optimal Routing for Multihop Social-Based D2D Communications in the Internet of Things
Optimal Routing for Multihop Social-Based D2D Communications in the Internet of Things
复制标题
DOI：
10.1109/jiot.2018.2817024
复制
发表时间：
2018-06-01
影响因子：
10.6
通讯作者：
Coon, Justin P.
中科院分区：
文献类型：
--
作者：
Chen, Gaojie;Tang, Jinchuan;Coon, Justin P.
随着无线通信的发展和机器的智能化，物联网（IoT）已经引起了工业界和学术界的兴趣。多跳路由和中继是未来支撑物联网网状网络的关键技术。本文研究了基于可信连接概率（T-CP）的解码转发中继的多跳、双跳、设备到设备（D2 D）通信的最优路由。随机和固定位置的基站（BS）被认为是，在前一种情况下假设的BS的位置被建模为泊松点过程（PPP）。首先，我们推导出连通概率（CP）的两个表达式：1）一个紧下界和2）一个精确的封闭形式。针对BS与D2 D发射机之间的信道状态信息（CSI）已知（CSI感知）和未知（无CSI）的情况进行分析。来自活动蜂窝用户设备（CUE）的干扰的特征在于将CUE位置建模为PPP。此外，动机的结果表明，社交行为导致D2 D设备与附近的邻居进行通信，我们推导出的信任概率D2 D连接通过使用基于排名的模型。最后，我们提出了一种新的路由算法，可以实现最高的T-CP的任何一对D2 D设备在分布式方式。通过Monte Carlo模拟验证了推导的分析结果。我们表明，所提出的路由算法达到几乎相同的性能，通过穷举搜索。当BS被随机定位时，基于CP的最优路径是D2 D发送器和接收器之间的最短路径。然而，对于固定BS，最佳路径选择取决于BS的位置，这为设计用于5G IoT的多跳D2 D系统提供了非常有用的见解。
With the development of wireless communications and the intellectualization of machines, the Internet of Things (IoT) has been of interest to both industry and academia. Multihop routing and relaying are key technologies that will underpin IoT mesh networks in the future. This paper investigates optimal routing based on the trusted connectivity probability (T-CP) for multihop, underlay, device-to-device (D2D) communications with decode-and-forward relaying. Both random and fixed locations for base stations (BSs) are considered, where the former case assumes that the locations of the BSs are modeled as a Poisson point process (PPP). First, we derive two expressions for the connectivity probability (CP): 1) a tight lower bound and 2) an exact closed-form. Analysis is carried out for the cases where the channel state information (CSI) between BSs and the D2D transmitter is known (CSI-aware) and unknown (no-CSI). Interference from active cellular user equipments (CUEs) is characterized by modeling CUE locations as a PPP. Moreover, motivated by results that have shown that social behavior leads to D2D devices communicating with nearby neighbors, we derive the trust probability for D2D connections by using a rank-based model. Finally, we propose a novel routing algorithm that can achieve the highest T-CP for any pair of D2D devices in a distributed manner. The derived analytical results are verified by Monte Carlo simulations. We show that the proposed routing algorithm achieves almost the same performance as that attained through an exhaustive search. When BSs are located randomly, the optimal path based on the CP is the shortest path between the D2D transmitter and receiver. However, for fixed BSs, the optimal path selection depends on the locations of the BSs, which provides a very useful insight in designing the multihop D2D system for 5G IoT.