Change search
Link to record
Permanent link

Direct link
BETA
Abbas, Zainab
Publications (1 of 1) Show all publications
Abbas, Z., Sigurdsson, T. T., Al-Shishtawy, A. & Vlassov, V. (2018). Evaluation of the Use of Streaming Graph Processing Algorithms for Road Congestion Detection. In: Chen, JJ Yang, LT (Ed.), 2018 IEEE INT CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, UBIQUITOUS COMPUTING & COMMUNICATIONS, BIG DATA & CLOUD COMPUTING, SOCIAL COMPUTING & NETWORKING, SUSTAINABLE COMPUTING & COMMUNICATIONS: . Paper presented at 16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom, DEC 11-13, 2018, Melbourne, AUSTRALIA (pp. 1017-1025). IEEE COMPUTER SOC
Open this publication in new window or tab >>Evaluation of the Use of Streaming Graph Processing Algorithms for Road Congestion Detection
2018 (English)In: 2018 IEEE INT CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, UBIQUITOUS COMPUTING & COMMUNICATIONS, BIG DATA & CLOUD COMPUTING, SOCIAL COMPUTING & NETWORKING, SUSTAINABLE COMPUTING & COMMUNICATIONS / [ed] Chen, JJ Yang, LT, IEEE COMPUTER SOC , 2018, p. 1017-1025Conference paper, Published paper (Refereed)
Abstract [en]

Real-time road congestion detection allows improving traffic safety and route planning. In this work, we propose to use streaming graph processing algorithms for road congestion detection and evaluate their accuracy and performance. We represent road infrastructure sensors in the form of a directed weighted graph and adapt the Connected Components algorithm and some existing graph processing algorithms, originally used for community detection in social network graphs, for the task of road congestion detection. In our approach, we detect Connected Components or communities of sensors with similarly weighted edges that reflect different states in the traffic, e.g., free flow or congested state, in regions covered by detected sensor groups. We have adapted and implemented the Connected Components and community detection algorithms for detecting groups in the weighted sensor graphs in batch and streaming manner. We evaluate our approach by building and processing the road infrastructure sensor graph for Stockholm's highways using real-world data from the Motorway Control System operated by the Swedish traffic authority. Our results indicate that the Connected Components and DenGraph community detection algorithms can detect congestion with accuracy up to approximate to 94% for Connected Components and up to approximate to 88% for DenGraph. The Louvain Modularity algorithm for community detection fails to detect congestion regions for sparsely connected graphs, representing roads that we have considered in this study. The Hierarchical Clustering algorithm using speed and density readings is able to detect congestion without details, such as shockwaves.

Place, publisher, year, edition, pages
IEEE COMPUTER SOC, 2018
Series
IEEE International Symposium on Parallel and Distributed Processing with Applications, ISSN 2158-9178
Keywords
Streaming, Graph Processing, Congestion, Community Detection, Connected Components
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-252672 (URN)10.1109/BDCloud.2018.00148 (DOI)000467843200134 ()2-s2.0-85063892833 (Scopus ID)978-1-7281-1141-4 (ISBN)
Conference
16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom, DEC 11-13, 2018, Melbourne, AUSTRALIA
Note

QC 20190603

Available from: 2019-06-03 Created: 2019-06-03 Last updated: 2019-06-11Bibliographically approved
Organisations

Search in DiVA

Show all publications