Multi-hopping vehicular networks (VANETs) provide environmental awareness across large regions even if there does not exist direct communication between several vehicles within the region. However, the volume of messages that are received and rebroadcasted via the relay vehicles can cause broadcast storms and network jams. In this paper, we propose a selective message relaying algorithm to enable efficient information sharing of multi-hopping VANETs. The proposed algorithm is very general so that it can be applied to many real-world applications. We use a clustering mechanism to group messages that include the same or very similar information, and the number of clusters is adaptively varied based on the proximity of the messages. Supported by the clustering mechanism, each relay vehicle only rebroadcasts a few messages from each cluster. Numerical results show that the proposed algorithm reduces 75% message rebroadcasting but still keeps 98% environmental awareness on average. It can support trade-off analysis between design metrics and assist in future system-level design.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Selective message relaying for multi-hopping vehicular networks


    Beteiligte:


    Erscheinungsdatum :

    2016-12-01


    Format / Umfang :

    1319486 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Decentralized Relaying and Performance Analysis in Vehicular Ad Hoc Networks

    Lai, Wuwen / Ni, Wei / Wang, Hua et al. | IEEE | 2017



    Safety message broadcast in vehicular networks

    Bi, Yuanguo / Zhou, Haibo / Zhuang, Weihua et al. | TIBKAT | 2017


    Learning for Adaptive Multi-Copy Relaying in Vehicular Delay Tolerant Network

    Lin, Haifeng / Qian, Jingjing / Di, Bai | IEEE | 2024


    HAP-Aided Relaying Satellite FSO/QKD Systems for Secure Vehicular Networks

    Vu, Minh Q. / Dang, Ngoc T. / Pham, Anh T. | IEEE | 2019