摘要翻译:
本文重点研究了城市VANET中车地通信的路由算法。公共汽车作为城市的基本交通设施之一,定期沿着固定的路线行驶,广泛覆盖城市街道。公交线路的轨迹可以看作是一个城市的子地图。根据公交网络的特点,提出了一种基于公交轨迹的以街道为中心的路由算法(BTSC)。在BTSC中,我们通过分析公交车在每条街道上出现的概率,建立基于公交线路轨迹的路由图。提出了两个新的概念,即街道一致性概率(PSC)和路径一致性概率(PPC),并将其作为确定消息传递路由路径的度量指标。其目的是选择总线密度高、传输方向偏离路由路径概率低的最佳路径。为了提高总线转发的机会,我们采用蚁群优化(FACO)设计了一种基于总线的转发策略,在两个中继总线之间寻找一个可靠稳定的多跳链路,以减少端到端的时延。BTSC在路由路径选择和消息转发策略上进行了改进。仿真结果表明,本文提出的路由算法在传输率、传输时延以及对不同网络的适应性等方面具有较好的性能。
---
英文标题:
《Bus Trajectory-Based Street-Centric Routing for Message Delivery in
Urban Vehicular Ad hoc Networks》
---
作者:
Gang Sun, Yijing Zhang, Dan Liao, Hongfang Yu, Xiaojiang Du, Mohsen
Guizani
---
最新提交年份:
2018
---
分类信息:
一级分类:Computer Science 计算机科学
二级分类:Networking and Internet Architecture 网络和因特网体系结构
分类描述:Covers all aspects of computer communication networks, including network architecture and design, network protocols, and internetwork standards (like TCP/IP). Also includes topics, such as web caching, that are directly relevant to Internet architecture and performance. Roughly includes all of ACM Subject Class C.2 except C.2.4, which is more likely to have Distributed, Parallel, and Cluster Computing as the primary subject area.
涵盖计算机通信网络的所有方面,包括网络体系结构和设计、网络协议和网络间标准(如TCP/IP)。还包括与Internet体系结构和性能直接相关的主题,如web缓存。大致包括除C.2.4以外的所有ACM主题类C.2,后者更有可能将分布式、并行和集群计算作为主要主题领域。
--
一级分类:Computer Science 计算机科学
二级分类:Cryptography and Security 密码学与安全
分类描述:Covers all areas of cryptography and security including authentication, public key cryptosytems, proof-carrying code, etc. Roughly includes material in ACM Subject Classes D.4.6 and E.3.
涵盖密码学和安全的所有领域,包括认证、公钥密码系统、携带证明的代码等。大致包括ACM主题课程D.4.6和E.3中的材料。
--
一级分类:Electrical Engineering and Systems Science 电气工程与系统科学
二级分类:Signal Processing 信号处理
分类描述:Theory, algorithms, performance analysis and applications of signal and data analysis, including physical modeling, processing, detection and parameter estimation, learning, mining, retrieval, and information extraction. The term "signal" includes speech, audio, sonar, radar, geophysical, physiological, (bio-) medical, image, video, and multimodal natural and man-made signals, including communication signals and data. Topics of interest include: statistical signal processing, spectral estimation and system identification; filter design, adaptive filtering / stochastic learning; (compressive) sampling, sensing, and transform-domain methods including fast algorithms; signal processing for machine learning and machine learning for signal processing applications; in-network and graph signal processing; convex and nonconvex optimization methods for signal processing applications; radar, sonar, and sensor array beamforming and direction finding; communications signal processing; low power, multi-core and system-on-chip signal processing; sensing, communication, analysis and optimization for cyber-physical systems such as power grids and the Internet of Things.
信号和数据分析的理论、算法、性能分析和应用,包括物理建模、处理、检测和参数估计、学习、挖掘、检索和信息提取。“信号”一词包括语音、音频、声纳、雷达、地球物理、生理、(生物)医学、图像、视频和多模态自然和人为信号,包括通信信号和数据。感兴趣的主题包括:统计信号处理、谱估计和系统辨识;滤波器设计;自适应滤波/随机学习;(压缩)采样、传感和变换域方法,包括快速算法;用于机器学习的信号处理和用于信号处理应用的机器学习;网络与图形信号处理;信号处理中的凸和非凸优化方法;雷达、声纳和传感器阵列波束形成和测向;通信信号处理;低功耗、多核、片上系统信号处理;信息物理系统的传感、通信、分析和优化,如电网和物联网。
--
---
英文摘要:
This paper focuses on the routing algorithm for the communications between vehicles and places in urban VANET. As one of the basic transportation facilities in an urban setting, buses periodically run along their fixed routes and widely cover city streets. The trajectory of bus lines can be seen as a sub map of a city. Based on the characters of bus networks, we propose a bus trajectory-based street-centric routing algorithm (BTSC), which uses bus as main relay to deliver message. In BTSC, we build a routing graph based on the trajectories of bus lines by analyzing the probability of bus appearing on every street. We propose two novel concepts, i.e. the probability of street consistency (PSC) and the probability of path consistency (PPC) which is used as metrics to determine routing paths for message delivery. This aims to choose the best path with higher density of busses and lower probability of transmission direction deviating from the routing path. In order to improve the bus forwarding opportunity, we design a bus-based forwarding strategy with ant colony optimization (FACO) to find a reliable and steady multi-hop link between two relay buses in order to decrease end-to-end delay. BTSC makes the improvements in the selection of routing path and the strategy of message forwarding. Simulation results show that our proposed routing algorithm has a better performance in transmission ratio, transmission delay and adaptability to different networks.
---
PDF链接:
https://arxiv.org/pdf/1804.02498