Efficient Spatiotemporal Traffic Forecasting for Smart Cities Using DCRNN-Lite in a Digital Twin Environment

Main Article Content

👀 Hussain Ahmad Awad
🏢 Amma arab university
👀 Ahmed Suliman Zraikat
🏢 Amman Arab University, Jordan

Urban traffic congestion remains a critical challenge for smart city development, particularly in the context of real-time monitoring and prediction for intelligent transportation systems. To address this issue, this study proposes a Digital Twin-based urban traffic prediction framework using a lightweight Diffusion Convolutional Recurrent Neural Network (DCRNN-Lite). The proposed model integrates spatial dependencies among road segments through diffusion convolution and temporal traffic dynamics through recurrent modeling, enabling effective spatiotemporal traffic forecasting with reduced computational complexity. Experiments were conducted on the real-world METR-LA dataset, consisting of traffic speed data from 207 sensors deployed across the Los Angeles highway network. The experimental results demonstrate that DCRNN-Lite achieves stable prediction performance, as reflected by low Mean Absolute Error (MAE) and Root Mean Square Error (RMSE), consistent convergence behavior, and strong correlation between predicted and actual traffic speeds at both node and city-wide levels. Despite its simplified architecture, the model effectively captures local traffic variations and global mobility trends, making it suitable for real-time deployment. The findings indicate that the proposed approach provides a favorable balance between accuracy and efficiency, highlighting its potential as a core component for digital twin-enabled smart cities and metaverse-based urban traffic management systems.

Awad, H. A., & Zraikat, A. S. (2026). Efficient Spatiotemporal Traffic Forecasting for Smart Cities Using DCRNN-Lite in a Digital Twin Environment. International Journal Research on Metaverse, 3(3), 208–222. https://doi.org/10.47738/ijrm.v3i3.64

Article Details

Section
Articles

Similar Articles

<< < 1 2 3 4 5 > >> 

You may also start an advanced similarity search for this article.