Table 1.
Abbreviations.
Table 2.
Summary of related work.
Fig 1.
Some possible scenarios for resource-aware routing in C-V2X.
Fig 2.
A cellular network with frequency reuse where clusters are presented as free shapes: (a) BS 1 (green area) loaded by three red clusters, (b) re-clustering is done and some of vehicles of red clusters are now served by white clusters associated to the lowest load neighbors, i.e., BS 2 and BS 3.
Fig 3.
Sample vehicular scenario after applying algorithm 1 (ε = 50, MinPts = 6).
Table 3.
Notations and their description.
Fig 4.
A part of VANET area with an inacceptable difference in BSs’ loads, a) After DBSCAN, b) After DBSCAN 2.
Fig 5.
The flowchart of the proposed method.
Table 4.
Simulation settings.
Fig 6.
Compression of traditional [37] and proposed method in terms of RI.
Fig 7.
PDR at different loads in traditional [37] and proposed methods.
Fig 8.
Comparing the proposed method to the method of [37] in terms of the number of supported vehicles.
Fig 9.
Adjacent BSs’ loads at different Nmin and ε values using traditional method [37] (a) and proposed method (b).
Fig 10.
Right bars are the initial BSminload values after DBSCAN while left bars are the values after using proposed method.
Fig 11.
Left bars are initial BSmaxload after DBSCAN and right bars are new values using proposed method.
Fig 12.
left bars are LDf values of traditional method [37] while right bars are the LDf values using proposed method.