ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2020, Vol. 57 ›› Issue (4): 723-735.doi: 10.7544/issn1000-1239.2020.20190876

所属专题: 2020数据驱动网络专题

• 网络技术 • 上一篇    下一篇

公交数据驱动的城市车联网转发机制

唐晓岚,顼尧,陈文龙   

  1. (首都师范大学信息工程学院 北京 100048) (tangxl@cnu.edu.cn)
  • 出版日期: 2020-04-01
  • 基金资助: 
    国家重点研发计划项目(2018YFB1800403);国家自然科学基金项目(61872252);北京市自然科学基金项目(4202012);北京市教委科技计划一般项目(KM201810028017)

Bus-Data-Driven Forwarding Scheme for Urban Vehicular Networks

Tang Xiaolan, Xu Yao, Chen Wenlong   

  1. (College of Information Engineering, Capital Normal University, Beijing 100048)
  • Online: 2020-04-01
  • Supported by: 
    This work was supported by the National Key Research and Development Program of China (2018YFB1800403), the National Natural Science Foundation of China (61872252), Beijing Natural Science Foundation (4202012), and the Science & Technology Project of Beijing Municipal Commission of Education (KM201810028017).

摘要: 在城市车联网中,由于交通状况复杂多变和出行路线多样性等特点,网络拓扑动态变化,车辆之间通信链路不稳定,影响着车联网数据传输性能.作为城市中重要的公共交通设施,公交车具有固定的行驶路线和发车时间,且公交线路广泛覆盖城市街道.与私家车相比,公交车是更好的数据携带者和转发者,有助于实现更可靠的车车通信.为此,提出公交数据驱动的城市车联网转发机制,简称BUF,旨在通过分析公交线路数据,选择合适的公交车做为转发节点,提高城市车联网数据传输效率.首先构建公交站点拓扑图,以目标场景中所有公交站点为顶点,在公交线路连续通过的站点之间连边,依据2个站点之间的预期公交车数量和距离计算边权值,进而使用迪杰斯特拉算法计算由源站点到目的站点的最优传输路径.为保证数据沿最优路径传输,优先选择与最优路径的后续站点重合度大于零的邻居骨干公交做为转发节点,且重合度越大越优先转发;当不存在骨干公交时,选择后续将经过期望的下一站点的邻居公交为转发节点,称为候补公交.针对不存在骨干公交和候补公交的场景,利用私家车建立多跳链路来寻找合适的公交转发节点,从而加速数据转发.使用北京市真实路网和公交线路数据的实验结果表明:与其他方案相比,BUF机制实现了更高的数据传输率和更短的传输时延.

关键词: 城市车联网, 公交线路, 数据转发, 最优路径, 多跳链路

Abstract: In urban vehicular ad hoc networks, due to the complex and dynamic traffic conditions and the diversity of driving routes, the network topology changes quickly and the communication links between vehicles are unstable, which affect the data forwarding performance of the vehicular networks. As an important public transportation facility in cities, buses have regular driving routes and departure time, and bus lines cover urban streets widely. Compared with private cars, buses are better data carriers and forwarders, and are helpful to achieve more reliable vehicle-to-vehicle communication. This paper proposes a bus-data-driven forwarding scheme for urban vehicular networks, called BUF, which aims to improve the transmission efficiency of urban vehicular networks by analyzing bus line data and selecting appropriate buses as forwarding nodes. First, a bus stop topology graph is constructed, in which all bus stops in the scenario are vertices and an edge links two vertices if there exist bus lines continuously passing through these two stops. The cost of an edge is computed based on the expected number of buses and the distance between two stops. Then the optimal forwarding path from the source stop to the destination stop is calculated by using Dijkstra algorithm. Moreover, in order to ensure that the data is forwarded along the optimal path, the neighbor backbone buses, whose overlapping degrees of subsequent stops with the optimal path are greater than zero, take priority to be selected as the forwarding nodes; and the greater the overlapping degree is, the higher priority the bus has to forward data. When no backbone bus exists, the neighbor buses, which will pass the expected next stop, called the supplement buses, are selected as relays. In the scenarios without backbone or supplement buses, private cars are used to establish a multi-hop link to find a suitable bus forwarder, in order to accelerate data forwarding. Experimental results with real Beijing road network and bus line data show that compared with other schemes, our BUF scheme achieves higher data delivery rate and shorter delay.

Key words: urban vehicular networks, bus line, data forwarding, optimal path, multi-hop link

中图分类号: