面向蜂窝网络的D2D多播通信的分簇和中继选择方法

传统蜂窝网络中,信道衰减的随机性和不确定性导致小区边缘用户的接收性能很差,尤其是面向视频传输等速率要求较高时其弊端更加凸显。D2D通信因其配置灵活性可作为传统蜂窝网络架构的有利补充,能有效改善边缘用户的性能。该文针对D2D通信的多播传输,分析了系统最小时延成本下的中继数量和分簇算法,提出一种基于分簇和中继选择的低时延D2D多播方案。该方案可以自适应选择多播重传中的中继的数量和中继节点到基站的距离,同时给出最优的带宽资源分配机制。仿真结果表明,与其他方案相比,所提方法能有效减少系统时延,提高边缘用户体验和系统性能。     

提高蜂窝网络中数据分发效率的D2D协作转发算法

Device-to-Device(D2D)通信是一种移动终端在蜂窝通信系统的控制下使用授权频段进行点到点通信的新型技术。通过允许接收终端间的数据转发,D2D通信可以用来提高蜂窝网络中的数据分发效率。现有的终端间转发算法,没有充分考虑D2D链路的差异,很难实现频谱资源的高效利用。为此,该文提出了一种基于多跳中继的D2D协作转发算法,包括多播和单播两个模式。该算法根据D2D链路质量自适应地选择最优的中继、路由及传输跳数,能够充分利用D2D链路的多信道分集增益。仿真结果表明,该文所提出的算法能够显著地提高D2D转发的资源利用率,进而提升数据分发业务的吞吐量。     

基于D2D通信系统中的一种跨层中继选择算法

在D2D通信系统与蜂窝网络共存的场景下,引入中继节点可有效提高D2D链路的吞吐量和D2D用户对蜂窝用户的干扰。文中基于译码转发模式,结合跨层协作通信的思想,提出了一种基于物理层和数据链路层的跨层中继选择算法。该算法结合物理层的信道状态信息和数据链路层的队列状态信息,两个参数进行最优中继节点的选择。并最终通过仿真验证表明,基于跨层中继选择算法可提高通信系统的吞吐量,同时降低了通信系统的平均时延和数据包错误率。     

面向5G的D2D簇内信息共享机制

D2D (device-to-device)通信是5G网络中的重要技术,有利于提升数据分发业务传输效率;然而,由于D2D通信引入了大量额外信令开销,当前的增强多播方案无法解决高效数据传输与低效信令流程之间的矛盾,降低了整体性能增益.为此,提出了一种基于多维矢量分析的最小化信令开销的D2D簇内信息共享算法,包含集中式与分布式两种实现方式,能通过自适应地选择D2D多播重传发射者和多播重传数据分组,大幅减少簇内重传次数,达到显著降低信令开销和传输时延的目的.     

基于LTE D2D discovery过程实现V2V安全通信

车辆安全驾驶已得到人们的足够重视,高效的安全驾驶系统是未来智能汽车产业发展的主要技术支撑之一.相比其他无线通信技术,LTE技术在提供低时延、高可靠性以及移动性方面具有很大优势.由于D2D技术本身的短距离通信优点和直接通信方式使其能提供可控与可靠的本地服务,我们将提出基于LTE D2D discovery过程的V2V安全短距离通信方案,确保车辆间告警信息的广播时延小于100ms.     

蜂窝系统中基于时延的D2D通信模式选择算法

D2D(Device-to-Device)通信作为蜂窝网的辅助通信方式,可以有效提高系统容量,具有提高频谱效率、减小时延等优势。模式选择是蜂窝网与D2D联合通信的关键问题之一。提出一种基于时延的D2D通信模式选择算法,该算法引入队列状态信息模型,以队列长度为权重的最大加权算法为调度策略,以时延作为模式选择的标准。通过仿真给出本算法与基于系统容量最大化的模式选择算法的性能比较,仿真结果表明与基于系统容量最大化的模式选择算法相比,本算法所需时延和丢包率均减小约20%。     

D2D网络中基于联盟博弈的中继选择方法

随着无线终端的大规模普及,用户设备（User Equipment,UE）对无线网络的内容分发服务提出了更高的要求。提出了利用设备对设备（Device to Device,D2D）通信技术进行协作中继传输,使得任何UE都可作为潜在中继节点,并且令中继节点为其他UE中继数据,可以提升整体网络的内容分发质量。为弥补UE作为中继节点产生的能耗,采用能量采集（Energy Harvesting,EH）的激励机制,将携能信号作为奖励发送至UE,以提高UE为其他用户中继数据的意愿。同时,为解决中继选择问题,提出了基于联盟博弈方法,对UE和中继节点的合作行为进行分析,为UE选取最优的中继节点,以获取最优的内容分发服务。仿真结果表明,所提方法与贪婪搜索算法相比,可以更大程度地提高系统的吞吐量。     

基于可变距离的车联网D2D通信连接选择

车联网是移动互联网的延伸,其中基站协作的D2D通信适用于车间交通消息的短距离无线传播.针对车辆快速移动导致的通信链路动态性,提出了一种基于可变距离的D2D连接选择方法.通过选择行车道及车间距离参数,估计D2D连接对的信道质量,推导了D2D连接选择的优先指数,并基于该优先指数建立D2D通信链路进行交通消息传播.仿真结果显示,所提方法在D2D连接的生存时间、传输效率方面得到提高,同时降低了D2D通信的中断概率,提升了车辆间通信可靠性.     

基于时延优化的蜂窝D2D通信联合用户关联及内容部署算法

针对蜂窝网络传输性能及基站(BS)缓存能力受限,多用户内容请求难以满足用户服务质量(QoS)需求等问题,该文提出一种蜂窝终端直通(D2D)通信联合用户关联及内容部署算法。考虑到位于特定区域的多用户可能对于相同内容存在内容请求,该文引入成簇思想,提出一种成簇及内容部署机制,通过为各簇头推送热点内容,而簇成员基于D2D通信模式关联簇头获取所需内容,可实现高效内容获取。综合考虑成簇数量、用户关联簇头、簇头缓存容量及传输速率等限制条件,建立基于用户总业务时延最小化的联合成簇及内容部署优化模型。该优化问题是一个非凸的混合整数优化问题,该文运用拉格朗日部分松弛法,将原优化问题等价转换为3个凸优化的子问题,并基于迭代算法及Kuhn-Munkres算法联合求解各子问题,从而得到联合成簇及内容部署优化策略。最后通过MATLAB仿真验证所提算法的有效性。     

中继协同D2D通信的能效优化

针对D2D中继通信中D2D设备电池容量受限问题,本文提出了一种逐步优化功率控制和中继选择从而最大化系统能量效率的方法。首先,在满足蜂窝链路最小数据速率的条件下,将功率控制问题建模为一个非线性规划问题,并求解出D2D发射机的最优发射功率;然后,分别利用发送节点与接收节点的邻域为半径建立节点均匀分布的球状模型;其次,基于路径损耗相似性对节点进行k-means迭代聚类,并得到路径损耗最小节点的质心;最后,将得到的质心作为中继节点进行D2D中继通信。仿真结果表明,在保证高质量通信的条件下,本文提出的优化方法能够最大化系统的能量效率。      

Multi-layer neural network algorithm for vehicle-to-everything communication in 5G networks

Internet of Vehicles (IoVs), the emerging trend of Internet of Things (IoTs), has undoubtedly become a promising trend to improve communication among vehicles on the roads. Vehicle-to-everything (V2X) communication that is based on 5G technology enables vehicle users to communicate and collaborate with each other to enhance road traffic efficiency and safety. Owing to the increased traffic load and restricted resources of existing network substructure, a channel that responds to the latency and reliability needs of V2X communication must be designed. Thereby, several intelligent spectrum allocation techniques have been proposed to improve the system's overall effectiveness. In this paper, we discuss the spectrum sharing issue of V2X communication in Device-to-Device (D2D)-based cellular networks. We propose a new multi-layer neural network (MLNN)-based Resource Allocation and sharing approach (MNNRA) for D2D-based V2X communications. According to the main advantages of MLNN, the proposed algorithm takes several profits by improving system performance while reducing computational complexity. Numerical analysis is presented to approve the effectiveness of our proposed solution in terms of network sum rate, packet reception ratio, resource utilization ratio, and time complexity.     

D2D communications with subchannel reusing for throughput‐guaranteed relay selection in LTE

Using full‐duplex relaying in device‐to‐device (D2D) communication, spectrum efficiency can be further improved as compared with traditional half‐duplex relaying. Due to the increasing demands for more system capacities and higher data rate, a throughput‐guaranteed and power‐aware relay selection mechanism is essential so that services can be successfully accomplished within tolerable power consumption. It is also imperative to prevent cellular users from interfering and preserve resources for more users at the same time. In current paper, we proposed an efficient relay selection scheme with subchannel reusing. Using the nonconflict group discovery algorithm, firstly, we divided D2D pairs into different groups based on the neighbor lists of all the devices. The D2D pairs in the same group were considered nonconflictive. By building a matrix that represents the power consumption of D2D transmission peers through relays, we proposed a group‐oriented relay selection scheme based on the Hungarian method allowing subchannel reuse over relay‐assisted D2D networks. Applying this mechanism, different D2D pairs are able to transmit messages at the same subchannel, whenever they are in the same group. Better throughput and spectrum usage than currently available relay selection schemes without subchannel reusing can be obtained. Particularly, more D2D pairs in high dense networks can be accommodated, and spectrum resources can be better preserved. The simulation results showed that our proposed mechanism can improve the total throughput by up to 35% as compared with an existing relay selection scheme without subchannel reusing, called as PRS‐D2D, when most D2D pairs are in a few groups.     

Scalable 3D video streaming over P2P networks with playback length changeable chunk segmentation

3D video distribution over P2P networks has been thought as a promising way for 3D video entering home. The convergence of scalable 3D video coding and P2P streaming can provide diverse 3D experiences for heterogeneous clients with high distribution efficiencies. However, the conventional chunk segmentation and scheduling algorithms originally aiming at the non-scalable 2D video streaming are not very efficient for scalable 3D video streaming over P2P networks due to the particular data characteristics of scalable 3D video. Based on this motivation, this paper first presents a playback length changeable 3D video chunk segmentation (PLC3DCS) algorithm to provide different error resilience strengths to video and depth as well as layers with different importance levels in the 3D video transmission. Then, a hybrid-priority based chunk scheduling (HPS) algorithm is proposed to be tied in with the proposed chunk segmentation algorithm to further promote the overall 3D video P2P streaming performance. The simulation results show that the proposed PLC3DCS algorithm with the corresponding HPS can increase the success delivery rates of chunks with more important levels, and further improve the user’s quality of 3D experience.     

A buffer‐aware fleet‐based cooperative H.264/SVC streaming over vehicular networks

Because of of the characteristics of high mobility, time varying and dynamic topology, how to provide multimedia streaming service for connected vehicles becomes one emerging and popular technical research. The motivation of this paper is to utilize cooperation among neighboring vehicles for video streaming's quality improvement over vehicular networks. In the proposed cooperative streaming scenario, a connected vehicle requests a video stream from the Internet by using its 3G/3.5G interface, which may not have enough bandwidth to receive good quality of video. Thus, the vehicle is suggested to ask neighboring members belonging to the same fleet to download the requested video data by using their 3G/3.5G interfaces. Then, neighboring members should forward video data to the requested vehicle by using another wireless technique, for example, dedicated short range communication (DSRC). Regarding the differentiation between the two access networks, that is, 3G/3.5G network and DSRC network, a buffer‐aware scheduling mechanism based on layered streaming is designed in this paper to adapt to the networking situation of the vehicular networks. Two selection algorithms are proposed to select neighboring vehicles from the fleet. According to our simulation results, the 3G/3.5G‐based selection algorithm is suitable to improve video quality for vehicles at low speeds. On the other hand, the DSRC‐based selection algorithm can get better performance when vehicles move at high speeds or too many data are transmitted among vehicles.Copyright © 2013 John Wiley & Sons, Ltd.     

Swarm intelligence‐based radio resource management for V2V‐based D2D communication

Internet of Things is a promising paradigm that provides the future network of interconnected devices. Device‐to‐Device (D2D) communication, which is considered as an enabler for vehicle‐to‐everything applications, has become an emerging technology to optimize network performance. In this paper, we study the Radio Resource Management (RRM) issue for D2D‐based Vehicle‐to‐Vehicle communication. The RRM key role is to assure the proficient exploitation of available resources while serving users according to their quality of service parameters. An Ant Colony Optimization (ACO)‐based Resource Allocation (ACORA) scheme is proposed in this paper. Swarm intelligence algorithm ACO is adopted to reduce the computational complexity while realizing satisfactory performance. Simulation results show promising performance of our proposed ACORA scheme.     

Cross-layer optimized authentication and error control for wireless 3D medical video streaming over LTE

3D video for tele-medicine applications is gradually gaining momentum since the 3D technology can provide precise location information. However, the weak link for 3D video streaming is the necessary wireless link of the communication system. Neglecting the wireless impairments can severely degrade the performance of 3D video streaming that communicates complex critical medical data. In this paper, we propose systematic methodology for ensuring high performance of the 3D medical video streaming system. First, we present a recursive end-to-end distortion estimation approach for MVC (multiview video coding)-based 3D video streaming over error-prone networks by considering the 3D inter-view prediction. Then, based on the previous model, we develop a cross-layer optimization scheme that considers the LTE wireless physical layer (PHY). In this optimization, the authentication requirements of 3D medical video are also taken into account. The proposed cross-layer optimization approach jointly controls and manages the authentication, video coding quantization of 3D video, and the modulation and channel coding scheme (MCS) of the LTE wireless PHY to minimize the end-to-end video distortion. Experimental results show that the proposed approach can provide superior 3D medical video streaming performance in terms of peak signal-to-noise ratio (PSNR) when compared to state-of-the-art approaches that include joint source-channel optimized streaming with multi-path hash-chaining based-authentication, and also conventional video streaming with single path hash-chaining-based authentication.     

车路通信环境下TD-LTE无线资源调度建模与仿真

为了改善现有车路通信方式覆盖范围小、交付时延大和传输速率低的现状,将TD-LTE技术引入车路通信接入系统。提出了基于TD-LTE的车路通信接入系统无线资源调度模型;构建了车路通信仿真场景,对比例公平算法、指数比例公平算法和改进的最大权重时延优先算法进行性能分析。仿真结果表明:车辆低速移动场景下,系统负载较低时指数比例公平算法性能较好,系统负载较高时改进的最大权重时延优先算法表现更优,比例公平算法不适合车路通信多媒体业务流调度;车辆高速移动场景下,三者都不适合车路通信多媒体业务流调度。     

蜂窝网络中全双工D2D通信功率控制

在蜂窝网络中,采用全双工传输的设备直通(D2D)通信可以共享蜂窝通信的信道资源,提升频谱利用率和系统吞吐量.针对单对全双工D2D用户复用单个蜂窝用户的上行信道资源时,用户之间会产生同频干扰的问题,提出了一种低复杂度的功率控制算法.该算法在保证全双工D2D用户和蜂窝用户(CU)的服务质量(QoS)的前提下,最大化全双工D2D链路的吞吐量.仿真结果表明,该算法能够提高全双工D2D链路的吞吐量;全双工D2D链路吞吐量取决于蜂窝用户的QoS要求、相对距离以及自干扰消除数量的限制.