A Clustering Routing Algorithm Based on Improved Ant Colony Optimization for an Urban Rail Transit Ad Hoc Network

As traffic pressure increases, urban rail transit has attracted attention because of its high speed and growing capacity in recent years. However, the traditional vehicle–ground communication systems of urban rail transit have been unable to meet the increasing requirements for communication. In thi...

Full description

Saved in:
Bibliographic Details
Published in:Applied sciences Vol. 13; no. 21; p. 11769
Main Authors: Su, Zhaoyang, Xiao, Xiao, Han, Zijie, Liu, Liu
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.11.2023
Subjects:
ad hoc network
Advertising executives
Algorithms
ant colony optimization
Clustering
clustering routing algorithm
Communications networks
Energy consumption
Infrastructure
Internet
Light rail transit
Machine learning
Maintenance costs
Optimization
Trains
urban rail transit
Vehicles
Wireless communications
China
ISSN:2076-3417, 2076-3417
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:As traffic pressure increases, urban rail transit has attracted attention because of its high speed and growing capacity in recent years. However, the traditional vehicle–ground communication systems of urban rail transit have been unable to meet the increasing requirements for communication. In this paper, we introduce an ad hoc network for urban rail transit to improve communication reliability, reduce end-to-end latency, and improve throughput of vehicle–ground communication. A novel clustering algorithm based on improved ant colony optimization is presented, which integrates various variables to elect cluster heads and adopts a low-latency queuing strategy. In addition, the algorithm can also replace the cluster heads adaptively to optimize the communication quality. Through the simulation results, the proposed algorithm can reduce the packet loss rate by about 60%, reduce the delay by about 50%, and improve the throughput by about 40% compared with the classical clustering routing protocol.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app132111769