A Novel Heuristic Data Routing for Urban Vehicular Ad Hoc Networks
Autor: | Ping Liu, Liang Zhao, Ammar Hawbani, Mohammed A. A. Al-qaness, Xingfu Wang, Omar Busaileh, Ahmed Al-Dubai |
---|---|
Rok vydání: | 2021 |
Předmět: |
Routing protocol
Vehicular ad hoc network Computer Networks and Communications Computer science Heuristic (computer science) business.industry Wireless ad hoc network Computer Science Applications Hardware and Architecture Signal Processing Overhead (computing) Probability distribution Routing (electronic design automation) business Heuristic routing Information Systems Computer network |
Zdroj: | IEEE Internet of Things Journal. 8:8976-8989 |
ISSN: | 2372-2541 |
Popis: | This work is devoted to solving the problem of multicriteria multihop routing in vehicular ad hoc networks (VANETs), aiming at three goals: 1) increasing the end-to-end delivery ratio; 2) reducing the end-to-end latency; and 3) minimizing the network overhead. To this end and beyond the state of the art, heuristic routing for vehicular networks (HERO), which is a distributed routing protocol for urban environments, encapsulating two main components, is proposed. The first component, road-segment selection, aims to prioritize the road segments based on a heuristic function that contains two probability distributions, namely, shortest distance distribution (SDD) and connectivity distribution (CD). The mass function of SDD is the product of three quantities: 1) the perpendicular distance; 2) the dot-production angle; and 3) the segment length. On the other hand, the mass function of CD considers two quantities: 1) the density of vehicles and 2) the interdistance of vehicles on the road segment. The second component, vehicle selection, aims to prioritize the vehicles on the road segment based on four quantities: 1) the relative speed; 2) the movement direction; 3) the available buffer size; and 4) signal fading. The simulation results showed that HERO achieved a promising performance in terms of delivery success ratio, delivery delay, and communication overhead. |
Databáze: | OpenAIRE |
Externí odkaz: |