Delay-bounded routing in vehicular ad-hoc networks
Delay-bounded routing in vehicular ad-hoc networks
复制标题
DOI：
10.1145/1374618.1374664
复制
发表时间：
2008-05
期刊：
影响因子：
--
通讯作者：
Antonios Skordylis;A. Trigoni
中科院分区：
文献类型：
--
作者：
Antonios Skordylis;A. Trigoni
由行驶车辆形成的自组织网络被设想成为一个通用平台，将支持从道路安全到广告和娱乐的各种应用。众多的车辆应用要求路由方案，满足用户定义的延迟要求，同时保持低水平的信道利用率，以允许它们共存。本文重点介绍了进位和转发方案的发展，试图在城市环境中提供数据从车辆到固定的基础设施节点。所提出的算法利用本地或全球的流量统计知识，仔细交替之间的数据Muling和多跳转发策略，以尽量减少通信开销，同时坚持应用程序所施加的延迟约束。我们提供了一个广泛的评估我们的计划，使用现实的车辆轨迹上的真实的城市地图。
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising and entertainment. The multitude of vehicular applications calls for routing schemes that satisfy user-defined delay requirements while at the same time maintaining a low level of channel utilization to allow their coexistence. This paper focuses on the development of carry-and-forward schemes that attempt to deliver data from vehicles to fixed infrastructure nodes in an urban setting. The proposed algorithms leverage local or global knowledge of traffic statistics to carefully alternate between the Data Muling and Multihop Forwarding strategies, in order to minimize communication overhead while adhering to delay constraints imposed by the application. We provide an extensive evaluation of our schemes using realistic vehicular traces on a real city map.