Iterative greedy user clustering algorithm for D2D–relay in vehicular communication systems. Issue 8 (4th June 2019)

• Record Type: Journal Article
• Authors: Wang, Zhenyu; Zhou, Ting; Xu, Tianheng; Hu, Honglin
• Is Part Of: IET microwaves, antennas & propagation. Volume 13:Issue 8(2019)
• Page Start: 1087
• Page End: 1095
• Publication Date: 2019-06-04
• Subjects: cooperative communication -- iterative methods -- resource allocation -- greedy algorithms -- computational complexity -- cellular radio -- wireless channels -- relay networks (telecommunication) -- vehicular ad hoc networks -- nonlinear programming; vehicular wireless channels -- greedy user clustering algorithm -- vehicular communication systems -- wireless services -- cellular networks -- mobile users -- traditional pairwise cooperation -- cluster‐wise cooperation -- intelligent transportation -- vehicular scenario -- clustering scheme -- system resources -- nonlinear binary programming problem -- device‐to‐device communications -- spectral power efficiency -- iterative greedy user clustering -- suboptimal algorithm IGUC -- D2D‐relay clustering network -- noncooperative uplink system; Microwaves -- Periodicals; Microwave antennas -- Periodicals; Antennas (Electronics) -- Periodicals; Radio wave propagation -- Periodicals; Microwave communication systems -- Periodicals; 621.381305
• DOI: 10.1049/iet-map.2018.6123
• Languages: English
• ISSNs: 1751-8725

Abstract

Abstract : Device‐to‐device (D2D) communications help in improving the performance of wireless services in cellular networks via enabling cooperation among mobile users. Further, compared to traditional pairwise cooperation, cluster‐wise cooperation can achieve even higher spectral and power efficiency. D2D clustering certainly can be a great supporting technology for the future of intelligent transportation. In this study, the authors investigate the D2D–relay clustering network in the vehicular scenario and propose a new clustering scheme named iterative greedy user clustering (IGUC). By exploiting those vehicles with better channel state, system resources can be saved. Here, they mainly focus on the question which is by applying D2D–relay clustering among vehicles, how much bandwidth could be saved in the uplink. This problem is mathematically formulated into a non‐linear binary programming problem with the goal being minimum spectrum usage. Due to the NP‐hardness, the low‐complexity suboptimal algorithm IGUC is introduced to tackle it. Simulation results show that compared to the non‐cooperative uplink system, IGUC saves a considerable proportion of the spectrum. Furthermore, clusters in denser and further areas tend to produce a higher gain. Influence of the fast time‐varying characteristic of vehicular wireless channels is also investigated, upon which an adaptive switch mechanism is proposed to further facilitate IGUC.