Neighbor Discovery for VANET With Gossip Mechanism and Multipacket Reception

Abstract

Neighbor discovery (ND) is a key initial step of network configuration and prerequisite of vehicular <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> network (VANET). However, the convergence efficiency of ND is facing the requirements of multivehicle fast networking of VANET with frequent topology changes. This article proposes the gossip-based information dissemination and sensing information-assisted ND with multipacket reception (GSIM-ND) algorithm for VANET. The GSIM-ND algorithm leverages efficient gossip-based information dissemination in the case of multipacket reception (MPR). Besides, through the multitarget detection function of multiple sensors installed in roadside unit (RSU), RSU can sense the distribution of vehicles and help vehicles to obtain the distribution of their neighbors. Thus, the GSIM-ND algorithm leverages the dissemination of sensing information as well. The expected number of discovered neighbors within a given period is theoretically derived and used as the critical metric to evaluate the performance of the GSIM-ND algorithm. The expected bounds of the number of time slots when a given number of neighbors needs to be discovered are derived as well. The simulation results verify the correctness of theoretical derivation. It is discovered that GSIM-ND algorithm proposed in this article can always reach the short-term convergence quickly. Moreover, the GSIM-ND algorithm is more efficient and stable compared with the completely random algorithm (CRA), scan-based algorithm (SBA), and gossip-based algorithm. The convergence time of the GSIM-ND algorithm is 40%–90% lower than that of these existing algorithms for both low density and high density networks. Thus, GSIM-ND can improve the efficiency of ND algorithm.