This paper considers a cluster-based relay vehicle selection scheme that adjusts the K-means-type algorithm to find real center mean vehicles under a restricted seeding range. With the help of the K-means-based VANET seeding principle, a local minimum cluster center is proposed, together with a rigorous proof by means of Lagrange multipliers. Unlike other existing works, relay vehicles in this correspondence are categorized into centroids and connecting vehicles to minimize the number of relay vehicles used and maximize the broadcasting power efficiency. To evaluate the system performance, we use different metrics to accommodate the realistic V2V scenario with NLOS signal dissemination, and empirical results show that both the algorithms themself and the system performance by implementing proposed algorithms are in the advantageous position over exsting appoaches.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Enhanced K-means-type Clustering Algorithm with Seeding Constraints for the VANET


    Contributors:
    Cui, Tao (author) / Sun, Chen (author) / Jia, Jing (author) / Zhou, Ming-Tuo (author)


    Publication date :

    2022-06-01


    Size :

    729616 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Enhanced Performance for Military Vehicles Using Clustering Algorithm in VANET

    Deepak Kumar Malviya / Prashant Shrivastav | BASE | 2018

    Free access

    Enhanced Load Balanced Clustering Technique for VANET Using Location Aware Genetic Algorithm

    Bhuvaneswari MADASAMY / Paramasivan BALASUBRAMANIAM | DOAJ | 2022

    Free access


    Work in progress paper: Utility based clustering algorithm for VANET

    Chai, Rong / Ge, Xianlei / Hu, Xun et al. | IEEE | 2014


    State Machine Based Clustering Algorithms in VANET

    Wang, Qi / Hu, Jianming / Wang, Yizhi et al. | ASCE | 2011