A Novel Hierarchical V2V Routing Algorithm Based on Bus in Urban VANETs

Xiang BI; Shengzhen YANG; Benhong ZHANG; Xing WEI

doi:10.1587/transcom.2022EBP3012

IEICE TRANSACTIONS on Communications

A Novel Hierarchical V2V Routing Algorithm Based on Bus in Urban VANETs

Xiang BI, Shengzhen YANG, Benhong ZHANG, Xing WEI

Full Text Views

0

Cite this

Summary :

Multi-hop V2V communication is a fundamental way to realize data transmission in Vehicular Ad-hoc Networks (VANET). It has excellent potential in intelligent transportation systems and automatic vehicle driving, and positively affects the safety, reliability, and comfort of vehicles. With advantages in speed and trajectory, distribution along the route, size, etc., the urban buses have become prospective relay nodes for urban VANETs. However, it is a considerable challenge to construct stable and reliable (meeting the requirements of bandwidth, delay, and bit error rate) multi-hop routing because of the complexity of the urban road and bus line network in the communication area, as well as many unevenly distributed buses on the road, etc. Given this above, this paper proposes a new hierarchical routing algorithm based on V2V geographic topology segmentation. Urban hierarchical routing is divided into two layers. The first layer of routing is called coarse routing, which is composed of areas; the second layer of routing is called internal routing (bus routing within the area). Q-learning is used to formulate the sequence of buses that transmit information within each area. Details are as follows: Firstly, based on a city map containing road network information, the entire city is divided into small grids by physical streets. Secondly, based on an analysis of the characteristics of the adjacent grid bus lines, the grids with the same routing attributes are integrated into the same area, reducing the algorithm's computational complexity during route discovery. Then, for the calculated area set, a coarse route composed of the selected area is established by filtering out a group of areas satisfying from the source node to the destination node. Finally, the bus sequence between anchor intersections is selected within the chosen area, and a complete multi-hop route from the source node to the destination node is finally constructed. Sufficient simulations show that the proposed routing algorithm has more stable performance in terms of packet transmission rate, average end-to-end delay, routing duration, and other indicators than similar algorithms.

Publication: IEICE TRANSACTIONS on Communications Vol.E105-B No.12 pp.1487-1497

Publication Date: 2022/12/01

Publicized: 2022/05/19

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2022EBP3012

Type of Manuscript: PAPER

Category: Network

Authors

Xiang BI
  Hefei University of Technology,Postdoctoral Research Center in Wuhu Token Sciences Co., Ltd.
Shengzhen YANG
  Hefei University of Technology
Benhong ZHANG
  Hefei University of Technology,Engineering Research Center of Safety Critical Industrial Measurement and Control Technology, Ministry of Education
Xing WEI
  Hefei University of Technology

Keyword

urban VANETs, hierarchical V2V routing, Q-learning

Cite this

Copy

Xiang BI, Shengzhen YANG, Benhong ZHANG, Xing WEI, "A Novel Hierarchical V2V Routing Algorithm Based on Bus in Urban VANETs" in IEICE TRANSACTIONS on Communications, vol. E105-B, no. 12, pp. 1487-1497, December 2022, doi: 10.1587/transcom.2022EBP3012.
Abstract: Multi-hop V2V communication is a fundamental way to realize data transmission in Vehicular Ad-hoc Networks (VANET). It has excellent potential in intelligent transportation systems and automatic vehicle driving, and positively affects the safety, reliability, and comfort of vehicles. With advantages in speed and trajectory, distribution along the route, size, etc., the urban buses have become prospective relay nodes for urban VANETs. However, it is a considerable challenge to construct stable and reliable (meeting the requirements of bandwidth, delay, and bit error rate) multi-hop routing because of the complexity of the urban road and bus line network in the communication area, as well as many unevenly distributed buses on the road, etc. Given this above, this paper proposes a new hierarchical routing algorithm based on V2V geographic topology segmentation. Urban hierarchical routing is divided into two layers. The first layer of routing is called coarse routing, which is composed of areas; the second layer of routing is called internal routing (bus routing within the area). Q-learning is used to formulate the sequence of buses that transmit information within each area. Details are as follows: Firstly, based on a city map containing road network information, the entire city is divided into small grids by physical streets. Secondly, based on an analysis of the characteristics of the adjacent grid bus lines, the grids with the same routing attributes are integrated into the same area, reducing the algorithm's computational complexity during route discovery. Then, for the calculated area set, a coarse route composed of the selected area is established by filtering out a group of areas satisfying from the source node to the destination node. Finally, the bus sequence between anchor intersections is selected within the chosen area, and a complete multi-hop route from the source node to the destination node is finally constructed. Sufficient simulations show that the proposed routing algorithm has more stable performance in terms of packet transmission rate, average end-to-end delay, routing duration, and other indicators than similar algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3012/_p

Copy

@ARTICLE{e105-b_12_1487,
author={Xiang BI, Shengzhen YANG, Benhong ZHANG, Xing WEI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Novel Hierarchical V2V Routing Algorithm Based on Bus in Urban VANETs},
year={2022},
volume={E105-B},
number={12},
pages={1487-1497},
abstract={Multi-hop V2V communication is a fundamental way to realize data transmission in Vehicular Ad-hoc Networks (VANET). It has excellent potential in intelligent transportation systems and automatic vehicle driving, and positively affects the safety, reliability, and comfort of vehicles. With advantages in speed and trajectory, distribution along the route, size, etc., the urban buses have become prospective relay nodes for urban VANETs. However, it is a considerable challenge to construct stable and reliable (meeting the requirements of bandwidth, delay, and bit error rate) multi-hop routing because of the complexity of the urban road and bus line network in the communication area, as well as many unevenly distributed buses on the road, etc. Given this above, this paper proposes a new hierarchical routing algorithm based on V2V geographic topology segmentation. Urban hierarchical routing is divided into two layers. The first layer of routing is called coarse routing, which is composed of areas; the second layer of routing is called internal routing (bus routing within the area). Q-learning is used to formulate the sequence of buses that transmit information within each area. Details are as follows: Firstly, based on a city map containing road network information, the entire city is divided into small grids by physical streets. Secondly, based on an analysis of the characteristics of the adjacent grid bus lines, the grids with the same routing attributes are integrated into the same area, reducing the algorithm's computational complexity during route discovery. Then, for the calculated area set, a coarse route composed of the selected area is established by filtering out a group of areas satisfying from the source node to the destination node. Finally, the bus sequence between anchor intersections is selected within the chosen area, and a complete multi-hop route from the source node to the destination node is finally constructed. Sufficient simulations show that the proposed routing algorithm has more stable performance in terms of packet transmission rate, average end-to-end delay, routing duration, and other indicators than similar algorithms.},
keywords={},
doi={10.1587/transcom.2022EBP3012},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - A Novel Hierarchical V2V Routing Algorithm Based on Bus in Urban VANETs
T2 - IEICE TRANSACTIONS on Communications
SP - 1487
EP - 1497
AU - Xiang BI
AU - Shengzhen YANG
AU - Benhong ZHANG
AU - Xing WEI
PY - 2022
DO - 10.1587/transcom.2022EBP3012
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2022
AB - Multi-hop V2V communication is a fundamental way to realize data transmission in Vehicular Ad-hoc Networks (VANET). It has excellent potential in intelligent transportation systems and automatic vehicle driving, and positively affects the safety, reliability, and comfort of vehicles. With advantages in speed and trajectory, distribution along the route, size, etc., the urban buses have become prospective relay nodes for urban VANETs. However, it is a considerable challenge to construct stable and reliable (meeting the requirements of bandwidth, delay, and bit error rate) multi-hop routing because of the complexity of the urban road and bus line network in the communication area, as well as many unevenly distributed buses on the road, etc. Given this above, this paper proposes a new hierarchical routing algorithm based on V2V geographic topology segmentation. Urban hierarchical routing is divided into two layers. The first layer of routing is called coarse routing, which is composed of areas; the second layer of routing is called internal routing (bus routing within the area). Q-learning is used to formulate the sequence of buses that transmit information within each area. Details are as follows: Firstly, based on a city map containing road network information, the entire city is divided into small grids by physical streets. Secondly, based on an analysis of the characteristics of the adjacent grid bus lines, the grids with the same routing attributes are integrated into the same area, reducing the algorithm's computational complexity during route discovery. Then, for the calculated area set, a coarse route composed of the selected area is established by filtering out a group of areas satisfying from the source node to the destination node. Finally, the bus sequence between anchor intersections is selected within the chosen area, and a complete multi-hop route from the source node to the destination node is finally constructed. Sufficient simulations show that the proposed routing algorithm has more stable performance in terms of packet transmission rate, average end-to-end delay, routing duration, and other indicators than similar algorithms.
ER -

IEICE TRANSACTIONS on Communications