Research Article
A Design of D2D-Clustering Algorithm for Group D2D Communication
@INPROCEEDINGS{10.1007/978-3-030-41114-5_27, author={Ruoqi Shi and Bicheng Wang and Fanwei Shi and Dongming Piao and Jianling Hu}, title={A Design of D2D-Clustering Algorithm for Group D2D Communication}, proceedings={Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 -- December 1, 2019, Proceedings, Part I}, proceedings_a={CHINACOM}, year={2020}, month={2}, keywords={Internet-of-Vehicles D2D communication Clustering Neighbor detection Undirected graph}, doi={10.1007/978-3-030-41114-5_27} }- Ruoqi Shi
Bicheng Wang
Fanwei Shi
Dongming Piao
Jianling Hu
Year: 2020
A Design of D2D-Clustering Algorithm for Group D2D Communication
CHINACOM
Springer
DOI: 10.1007/978-3-030-41114-5_27
Abstract
Due to the characteristics of low latency and proximity discovery, D2D communication is considered to have an inherent advantage in supporting Internet-of-Vehicles (IoV) service. In this paper, considering that vehicular users can detect neighbor nodes in adjacent areas which are able to maintain high reliable communication with themselves, a novel design of D2D-Clustering algorithm is proposed in order to improve the QoS of users. The algorithm uses undirected graph to describe the neighborhood relationship between users. And the undirected graph is continuously simplified by multi-round traversal of vehicular users until user clustering is completed. Simulation results prove the validity of the proposed algorithm, pointing out that it helps reduce the energy consumption of the whole system.
