About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 – December 1, 2019, Proceedings, Part I

Research Article

A Design of D2D-Clustering Algorithm for Group D2D Communication

Download(Requires a free EAI acccount)
4 downloads
Cite
BibTeX Plain Text
  • @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
Ruoqi Shi1,*, Bicheng Wang1, Fanwei Shi1, Dongming Piao1, Jianling Hu1
  • 1: School of Electronic and Information Engineering
*Contact email: rqshi7@stu.suda.edu.cn

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.

Keywords
Internet-of-Vehicles D2D communication Clustering Neighbor detection Undirected graph
Published
2020-02-27
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-41114-5_27
Copyright © 2019–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL