• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on industrial informatics >OptDynLim: An Optimal Algorithm for the One-Dimensional RSU Deployment Problem With Nonuniform Profit Density
【24h】

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

机译：OptDynLim：具有非均匀利润密度的一维RSU部署问题的最优算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号