Abstract
In this work we propose a new algorithm, Delta-r-GRASP, for solving the allocation of Roadside Units (RSUs) in a Vehicular Network. Our goal is to find the minimum set of RSUs to meet a Deployment Δρ2 ρ1. The Deployment Δρ2 ρ1 is a metric for specifying minimum communication guarantees from the infrastructure supporting the Vehicular Network. We compare our algorithm with a baseline algorithm, Delta-r. Moreover, we compare our results with the optimal value achieved by solver CPLEX. Our results demonstrate that our approach requires up to 85% fewer RSUs to achieve the same deployment efficiency, and our results differ no more than 15% from the optimal values.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IM 2017 - 2017 IFIP/IEEE International Symposium on Integrated Network and Service Management |
| Publisher | IEEE |
| Pages | 369-376 |
| Number of pages | 8 |
| ISBN (Electronic) | 9783901882890 |
| DOIs | |
| Publication status | Published - 20 Jul 2017 |
| Event | 15th IFIP/IEEE International Symposium on Integrated Network and Service Management, IM 2017 - Lisbon, Portugal Duration: 8 May 2017 → 12 May 2017 |
Conference
| Conference | 15th IFIP/IEEE International Symposium on Integrated Network and Service Management, IM 2017 |
|---|---|
| Country/Territory | Portugal |
| City | Lisbon |
| Period | 8/05/17 → 12/05/17 |
Funding
This work was partially funded by CNPq, FAPEMIG, CAPES and CEFETMG.