English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Neighbor discovery (ND) is a key initial step of network configuration andprerequisite of vehicular ad hoc network (VANET). However, the convergenceefficiency of ND is facing the requirements of multi-vehicle fast networking ofVANET with frequent topology changes. This paper proposes gossip-basedinformation dissemination and sensing information assisted ND with MPR(GSIM-ND) algorithm for VANET. GSIM-ND algorithm leverages efficientgossip-based information dissemination in the case of multi-packet reception(MPR). Besides, through multi-target detection function of multiple sensorsinstalled in roadside unit (RSU), RSU can sense the distribution of vehiclesand help vehicles to obtain the distribution of their neighbors. Thus, GSIM-NDalgorithm leverages the dissemination of sensing information as well. Theexpected number of discovered neighbors within a given period is theoreticallyderived and used as the critical metric to evaluate the performance of GSIM-NDalgorithm. The expected bounds of the number of time slots when a given numberof neighbors needs to be discovered is derived as well. The simulation resultsverify the correctness of theoretical derivation. It is discovered that GSIM-NDalgorithm proposed in this paper can always reach the short-term convergencequickly. Moreover, GSIM-ND algorithm is more efficient and stable compared withcompletely random algorithm (CRA), scan-based algorithm (SBA) and gossip-basedalgorithm. The convergence time of GSIM-ND algorithm is 40\%-90\% lower thanthat of these existing algorithms for both low density and high densitynetworks. Thus, GSIM-ND can improve the efficiency of ND algorithm.

Neighbor Discovery for VANET with Gossip Mechanism and Multi-packet Reception