Chew's first Delaunay triangulation refinement scheme‐based positioning of road side units for optimal network coverage in vehicular ad‐hoc networks

Abstract

SummaryThe temporal network fragmentation and uncertain vehicle mobility are considered to impact the communication connectivity among the vehicular nodes of the network. In this context, road side units (RSUs) play an anchor role in enhancing the vehicle‐to‐vehicle (V2V) communication connectivity and support vehicle‐to‐infrastructure (V2I) communication. In the current scenario, deploying a huge number of RSUs in the vehicular networks at an initial stage is completely impossible as it incurs high installation cost and authority restriction. Moreover, the optimal placement of RSUs in the vehicular network needs to be enforced for attaining maximized network coverage. In this paper, Chew's first Delaunay triangulation refinement scheme (CFDTRS) is proposed for optimal positioning of RSUs in order to attain optimal network coverage in the vehicular network with minimized cost. This CFDTRS considered the factors of vehicular density, number of obstacles in the map, intersection popularity, and global coverage into account during the placement of RSUs. It is proposed with the objective of deploying required number of RSUs within the range of data transmission in order to achieve maximal coverage in the convex map, such that each area of the convex map is completely covered with at least a single RSU in the existence of multiple number of obstacles. The simulation results of the proposed CFDTRS attained from the real time situations of simplex, moderate, and complex maps confirmed improved packet delivery rate of 9.32%, throughput by 10.74% with minimized packet loss of 9.14%, and reduced end‐to‐end delay of 19.31$, compared to the benchmarked schemes considered for investigation.