Reference : Multi-flow congestion-aware routing in software-defined vehicular networks
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/41583
Multi-flow congestion-aware routing in software-defined vehicular networks
English
Di Maio, Antonio mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Palattella, Maria Rita mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Engel, Thomas mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
22-Sep-2019
2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall) Proceedings
Yes
International
2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)
from 22-09-2019 to 25-09-2019
Honolulu
USA
[en] SDN ; VANET ; Routing
[en] 5G-enabled vehicular networks will soon allow their users to exchange safety and non-safety related information over heterogeneous communication interfaces. Routing vehicular data flows over multi-hop Vehicle-to-Vehicle (V2V) communications is one of the hardest challenges in vehicular networking, and it has been tackled in literature by using distributed algorithms. The distributed approach has shown significant inefficiencies in such dynamic vehicular scenarios, mainly due to poor network congestion control. To overcome the complexity of the envisioned architecture, and the inefficiency of distributed routing algorithms, we hereby propose to leverage the coordination capabilities of Software-Defined Networking (SDN) to determine optimal V2V multi-hop paths and to offload traffic from the Vehicle-to-Infrastructure-to-Vehicle (V2I2V) to the V2V communications, using both cellular and Wi-Fi technologies. In order to achieve this goal, we propose Multi-Flow Congestion-Aware Routing (MFCAR), a centralized routing algorithm that relies on graph theory to choose short and uncongested V2V paths. Realistic simulations prove that MFCAR outperforms well- established centralized routing algorithms (e.g. Dijkstra's) in terms of Packet Delivery Ratio (PDR), goodput and average packet delay, up to a five-fold performance gain.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/41583
10.1109/VTCFall.2019.8891465
FnR ; FNR10487418 > Thomas Engel > CONTACT > CONtext and conTent Aware CommunicaTions for QoS support in VANETs > 01/05/2016 > 30/04/2019 > 2015

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
mfcar.pdfPublisher postprint306.19 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.