GASPRO International Journal of Eminent Scholars

ABSTRACT

Mobile users may question sites of interest (such as restaurants and cafés) about a number of features thanks to location-based services (LBS) (e.g., price, quality, variety). Users also need current journey times and reliable query results. Lacking a road traffic monitoring infrastructure, the LBS may use internet pseudonym route APIs to get real-time trip times for pseudonym routes in order to provide reliable results. Our objective is to dramatically lower the LBS's request volume while maintaining accurate query results. The user can access the pseudonym router over the internet with our suggested work. He must select the destination point based on his current position, and LBS will then interact with the server and provide the areas that are closest to your chosen destination. In order to properly respond to requests, we first propose K-NN pseudonym route analysis to make use of recent pseudonym routes requested through pseudonym route APIs. Then, to effectively handle requests, we propose lower and upper bounds and sorting strategies. We research parallel pseudonym routing requests as well to speed up query response. Our experimental analysis demonstrates that our approach is three times more effective than arrival while still achieving good accuracy (above 99 percent). Develop techniques to parallelize pseudonym route requests in order to further reduce the query response time by combining information from many pseudonym routes in the log to determine lower and upper bounds on journey times. For scalability testing, compare our solutions using a genuine pseudonym route API with a simulated pseudonym route API.

KEYWORDS: Reliability, Availability, Redundancy and Vehicular Clouds