Abstract:
VANET configuration begins with neighbor discovery (ND). ND convergence efficiency is challenged by VANET multivehicle fast networking with frequent topology changes. This article proposes VANET gossip-based information dissemination and sensing information-assisted ND with multipacket reception (GSIM-ND) algorithm.
Multipacket reception (MPR) uses gossip-based information dissemination with the GSIM-ND algorithm. Roadside units (RSUs) can also detect vehicle distribution and help vehicles find their neighbors using the multitarget detection function of multiple sensors. Thus, GSIM-ND uses sensing information dissemination.
The GSIM-ND algorithm is evaluated using the expected number of neighbors discovered in a given period. The expected time slots to discover a given number of neighbors are also derived. Simulations confirm theoretical derivation.
This article’s GSIM-ND algorithm always achieves short-term convergence quickly. GSIM-ND is more efficient and stable than the completely random algorithm (CRA), scan-based algorithm (SBA), and gossip-based algorithm. GSIM-ND’s convergence time is 40%–90% faster than these algorithms for low-density and high-density networks. GSIM-ND improves ND algorithm efficiency.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
