首页> 外文会议>The IEEE Ninth International Conference on Mobile Ad-hoc and Sensor Networks >Achieving Handoff Optimization and Throughput Efficiency in Vehicular Networks
【24h】

Achieving Handoff Optimization and Throughput Efficiency in Vehicular Networks

机译:在车载网络中实现切换优化和吞吐量效率

获取原文
获取原文并翻译 | 示例

摘要

As users drive through the vehicular networks with high speed, they frequently associate with different access points in succession to maintain connectivity. Without careful designed association control policy, it may lead to large number of handoffs and inefficient connections, which can potentially incur unacceptable delays and poor throughput. In this paper, we propose a new association control scheme with the goal of reducing the frequency of handoffs and improving throughput for all vehicular users. The defined problem HMTE (Handoff Minimization and Throughput Efficiency) is mathematically described as a min-max programming. Since the HMTE problem is NP-hard, we propose an alpha-approximation(alpha >= 2) algorithm CHMTE to resolve it. CHMTE employs a novel method to simplify the original problem to the Minimum cost Maximum flow problem, which is solved in polynomial time. Extensive evaluations show that the proposed algorithm outperforms the existing schemes in terms of the handoff frequency and network throughput.
机译:当用户高速穿越车载网络时,他们经常连续与不同的接入点关联以维持连接性。如果没有精心设计的关联控制策略,则可能导致大量的切换和低效的连接,从而可能导致无法接受的延迟和吞吐量降低。在本文中,我们提出了一种新的关联控制方案,其目的是减少所有车辆用户的切换频率并提高吞吐量。定义的问题HMTE(越区切换最小化和吞吐量效率)在数学上被描述为最小-最大编程。由于HMTE问题是NP难题,因此我们提出了一种alpha-approximation(alpha> = 2)算法CHMTE来解决它。 CHMTE采用一种新颖的方法将原始问题简化为最小成本最大流量问题,该问题可以在多项式时间内解决。大量评估表明,该算法在切换频率和网络吞吐量方面均优于现有方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号