OptDynLim: An Optimal Algorithm for the One-Dimensional RSU Deployment Problem With Nonuniform Profit Density

Abstract

Proper deployment of roadside units (RSUs) is of crucial importance to vehicular ad hoc networks (VANETs). However, our understandings to the simple one-dimensional RSU Deployment (D1RD) problem with nonuniform profit density is still seriously limited. In this paper, we analyze the D1RD problem and try to design optimal algorithms for it. We first analyze the properties of the optimal solutions of the D1RD problem involving a single RSU, and then extend to multiple RSUs. Next, we propose an efficient technique named Dynamic Limiting (DynLim), which reduces the solution search space size considerably by adjusting search space limits dynamically. Finally, an optimal algorithm named OptDynLim is proposed based on the DynLim technique, and its optimality is proved. Numerical simulations validate the correctness of our analyzes and show that DynLim can usually reduce solution search space size by more than 99%.