It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
VANET is used for contact between vehicles. There are two ways to do this: communication within the car and communication across stations. It has the links consistency protocol, which is utilized for node communications but isn’t good at handling dynamic functions; source routing is pretty static, so it can’t be optimized with proactive hop-by-hop communication; route selection isn’t done well, and there are times when processing takes too long; this is why the suggested idea of a bio-inspiring algorithm is utilized to fix problems with the current algorithm. In the VANET setting, it is used to cut down on data loss and delay. A new protocol called Bioinspired Routing Protocol finds the best router as well as base station to connect the service requester to the global server. This paper suggests an Advanced Greedy Hybrid Bio-Inspired (AGHBI) routing protocol via a greedy forwarding system to make IoV work better. It uses a modified hybrid routing scheme and bee colony enhancement to choose the best quality of service route as well as keep the path with the least quantity of overflow. The simulations show that the suggested protocol works well in both vehicle-to-vehicle (V2V) as well as vehicle-to-infrastructure (V2I) settings. It also has a big effect on lowering the delay and increasing the number of delivered packets while keeping the overhead and hop count at a reasonable level for all vehicles. SDN, or software-defined networking, is utilized to keep the networking structures stable in VANET sources.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer