Improved Rectangle Restricted Searching Area Algorithm for Optimal Route Determination

Intelligent Transportation System (ITS) was developed to increase traffic security and preserve the environment. Nowadays, a lot of focus is being placed on Vehicular Ad hoc Network (VANET) technology to meet the evolving and new requirements of ITS applications. Nonetheless, in order to promote ITS applications, the determination of an optimal route becomes critical, which in turn relies on effective Geographic-based Routing Protocols (GRPs). Determination of an optimal route toward the intended destination in a wide-range traffic network such as an urban environment is extremely important. Existing route discovery mechanisms generate high delays, particularly in areas containing a wide range of junctions and feeder roads. Thus, a new mechanism for reducing the size of the search area is required, which can avoid searching in a wide range of junctions and feeder roads. In this paper, the issue of the Rectangle Restricted Searching Area (RRS
area
) algorithm is discussed, which aims to reduce the size of the searching area in a wide-range traffic network for optimal route determination. The issue has been resolved by proposing an Improved Rectangle Restricted Searching Area ( RRS
area
) algorithm that can control the size of ellipse by widening and narrowing the search region to incorporate an adequate number of junctions and feeder roads. Thus, the optimal route in terms of low end-to-end delay can be determined. Analysis of the results has revealed that the proposed algorithm outperforms RRS
area
algorithm by considering two scenarios ranging between 0.3–1.2 km and 1.5–6.5 km for short and long distances. The results have clearly shown that the acceptable searching area size of the IRRS
area
algorithm was increased, i.e. it reached the range of 0.38-3.79 km
²
whereas it lowered and reached the range of 4.02-55.38 km
²
for both small and large distances respectively.