JOURNAL ARTICLE

Implementation of a Multi-Hop Vehicular Network Analyzer

Abstract

This paper designs and implements a connectivity analyzer for the multi-hop telematics network employing a stationary gateway, based on the genuine movement history data obtained from Jeju taxi telematics system. Aiming at providing efficient telematics network planning along with a visualized tool controllable by a human analyzer, the connectivity analysis function is implemented by a thread routine. The thread keeps track of the movement of each vehicle and periodically triggers the connectivity analysis module which runs the well-known Dijkstra's shortest path algorithm to calculate the reachability matrix, and then plots the individual path on the digital map. The simulator can evaluate and visualize the connectivity of the network according to the number of vehicles and connectivity pattern change along the time axis.

Keywords:
Computer science Telematics Reachability Spectrum analyzer Thread (computing) Hop (telecommunications) Dijkstra's algorithm Real-time computing Computer network Shortest path problem Algorithm Telecommunications Theoretical computer science

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
11
Refs
0.14
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Vehicular Ad Hoc Networks (VANETs)
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Human Mobility and Location-Based Analysis
Social Sciences →  Social Sciences →  Transportation
Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.