A genetic algorithm for deploying roadside units in VANETs

Abstract

In this work we propose a genetic algorithm, Delta-GA, for solving the allocation of Roadside Units (RSUs) in a Vehicular Network. Our goal is to find the minimum set of RSUs in order to meet a Deployment Δ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ1</sup> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ2</sub> . The Deployment Δ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ1</sup> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ2</sub> is a metric for specifying minimal communication guarantees from the infrastructure supporting the Vehicular Network. We compare Delta-GA to two baseline algorithms, Delta-g and Delta-r, to solve the Deployment Δ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ1</sup> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ρ2</sub> . Our results demonstrate that Delta-GA requires less Roadside Units in order to achieve the same deployment efficiency.