# Smart Bandwidth Assignation in an Underlay Cellular Network for Internet of Vehicles
## 2 Literature
As a result,they accomplish their primary aim which was to minimize the cellular radio resources consumption, but their approach does not satisfy QoS requirements for ITS applications deployment. In traditional D2D systems, the performance objectives have typically been to maximize the overall network throughput of the existing C-UEs and admissible D2D pairs and to prioritize cellular links [11; 18]. However, in vehicular environments most of the messages are relatively small and they have very strict requirements in terms of latency and reliability. Thus, the aforementioned performance will not be fulfilled for the deployment of ITS applications and, additionally, a number of other performance objectives have to be defined [16; 17]. [PERSON] et al. [17] propose an analytical method to transform latency and reliability requirements of V2V safety applications into optimization constraints. However, this concept does not consider the QoS requirements of other ITS applications. [PERSON] et al. [16] study two different power control problems: (1) SPC (Sum Rate Oriented Power Control) aimed at maximizing the sum rate of all V2V links associated with infotainment services and (2) MPC (Minimum Rate Oriented Power Control) attempting to maximize the minimum achievable rate among all V2V links corresponding to the active safety applications which usually rely on small, fixed-size packets. Although in this approach the authors assume vehicles will spontaneously form clusters while traveling along the highway, they do not leverage the opportunities offered by clustering as they do not tie them with the resource reuse mechanism. Once the performance objectives are defined, methodologies have to work out the RBAP (Resource Block Assignation Problem). Throughout history, it could be said that the most used method for solving the RBAP is the HA (Hungarian Algorithm) [19]. The HA is a combinatorial optimization algorithm originally designed for addressing assignment problems in a polynomial time. In this sense, it is interesting to point out that the HA is a deterministic algorithm. This method has been applied to RBAP problems in works such as [13; 17] or [20]. Furthermore, HA has been applied in other fields such as transport [21] or economics [22]. In addition to the HA, some other alternatives have been proposed in the literature for solving similar problems as the RBAP. In [23], for example, two different methods are presented, the first one based on dynamic programming, and the second one consisting on a greedy algorithm. On the other hand, in [23], a distributed dynamic spectrum protocol is developed. Although, as can be seen in the literature, HA is the most used algorithm for solving RBAP, this method presents some drawbacks. First of all, HA is an exact approach with a high complexity for large scenarios. Additionally, as it has been mentioned before, HA is a deterministic method. This is not a disadvantage by itself, but as it is demonstrated below, the presence of some randomness leads to higher quality solutions. There are many algorithms in the scientific community which base their execution on the application of some kind of randomness. Arguably, heuristics and metaheuristics [24] are the most used and well-known methods that can be classified in this group. Concretely, we have decided to use a metaheuristic for the resolution of the RBAP. A metaheuristic is an optimization technique that solves a specific problem using only general information and knowledge common to a wide variety of optimization problems with similar characteristics. Furthermore, metaheuristics explore the solution space in order to achieve good optimization results with independence of the problem. In this sense, the main reason of the utilization of a metaheuristic is its adaptability, and its easy implementation. Additionally, metaheuristics are flexible techniques, and their efficiency has been proved in a wide range of fields [25].