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%.

中文翻译：

---

新模型的一维RSU部署问题的最优算法

正确部署路边单位（RSU）对车辆自组织网络（VANET）至关重要。但是，我们对具有不均匀利润密度的简单一维RSU部署（D1RD）问题的理解仍然受到严重限制。在本文中，我们分析了D1RD问题，并尝试为此设计最佳算法。我们首先分析涉及单个RSU的D1RD问题的最优解的性质，然后扩展到多个RSU。接下来，我们提出一种称为动态限制（DynLim）的有效技术，该技术通过动态调整搜索空间限制来显着减小解决方案搜索空间的大小。最后，基于DynLim技术提出了一种最优算法OptDynLim，并证明了其最优性。