The University of Southampton
University of Southampton Institutional Repository

Route lifetime analysis for vehicular networks

Route lifetime analysis for vehicular networks
Route lifetime analysis for vehicular networks
Vehicular communications have a critical role in the future intelligent transportation systems as they promise safer, more efficient and enjoyable driving. Multi-hop communications can be employed through routing protocols in order to achieve increased data transmission and coverage. However, most vehicular applications encounter significant challenges due to the increased mobility of the vehicles. This leads to transient communication links, which may significantly degrade the overall routing performance. Additionally, efficient routing techniques are required in order to achieve a reliable and flexible vehicular communications system. In this paper, we provide a framework for route lifetime analysis based on an exhaustive search routing technique to set an upper bound on the lifetime, which can inform the design of routing techniques. We then highlight the purpose of our framework by comparing the upper bound to a shortest-path forwarding mechanism based on global state routing (GSR), chosen as a routing example. The route lifetime is measured in order to reveal the trade-off between the structure and dimension of the road-network and performance requirements as a fundamental research baseline for investigating and developing sophisticated routing models for vehicular networks. Our results reveal that, on average, the shortest-path route lifetime is sub-optimal 11.56% of the time compared to the upper bound route lifetime. Then, we provide a trade-off between the road-network dimensions and the quality-of-service (QoS) requirements, and finally demonstrate that on average, under channel fading conditions, 7 times higher route lifetime could be achieved in a line-of-sight (LOS) scenario compared to its non-line-of-sight (NLOS) counterpart.
Ivanescu, Teodor
98894ec7-417b-4460-84aa-a15fec69ff09
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Merrett, Geoff
89b3a696-41de-44c3-89aa-b0aa29f54020
Yetgin, Halil
a036d86f-32ed-4c2e-9f7e-341b77972417
Ivanescu, Teodor
98894ec7-417b-4460-84aa-a15fec69ff09
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Merrett, Geoff
89b3a696-41de-44c3-89aa-b0aa29f54020
Yetgin, Halil
a036d86f-32ed-4c2e-9f7e-341b77972417

Ivanescu, Teodor, El-Hajjar, Mohammed, Merrett, Geoff and Yetgin, Halil (2021) Route lifetime analysis for vehicular networks. 2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS): W5 :AI/Machine Learning Enabled Connected Vehicles, , Hyderabad, India. 6 pp . (In Press)

Record type: Conference or Workshop Item (Paper)

Abstract

Vehicular communications have a critical role in the future intelligent transportation systems as they promise safer, more efficient and enjoyable driving. Multi-hop communications can be employed through routing protocols in order to achieve increased data transmission and coverage. However, most vehicular applications encounter significant challenges due to the increased mobility of the vehicles. This leads to transient communication links, which may significantly degrade the overall routing performance. Additionally, efficient routing techniques are required in order to achieve a reliable and flexible vehicular communications system. In this paper, we provide a framework for route lifetime analysis based on an exhaustive search routing technique to set an upper bound on the lifetime, which can inform the design of routing techniques. We then highlight the purpose of our framework by comparing the upper bound to a shortest-path forwarding mechanism based on global state routing (GSR), chosen as a routing example. The route lifetime is measured in order to reveal the trade-off between the structure and dimension of the road-network and performance requirements as a fundamental research baseline for investigating and developing sophisticated routing models for vehicular networks. Our results reveal that, on average, the shortest-path route lifetime is sub-optimal 11.56% of the time compared to the upper bound route lifetime. Then, we provide a trade-off between the road-network dimensions and the quality-of-service (QoS) requirements, and finally demonstrate that on average, under channel fading conditions, 7 times higher route lifetime could be achieved in a line-of-sight (LOS) scenario compared to its non-line-of-sight (NLOS) counterpart.

Text
FINAL_ANTSw_Paper___Route_Lifetime_Analysis_in_Vehicular_Networks_Routing - Accepted Manuscript
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 6 November 2021
Venue - Dates: 2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS): W5 :AI/Machine Learning Enabled Connected Vehicles, , Hyderabad, India, 2021-12-13

Identifiers

Local EPrints ID: 452719
URI: http://eprints.soton.ac.uk/id/eprint/452719
PURE UUID: ea182903-5d90-43c5-867e-8df4272bd88e
ORCID for Teodor Ivanescu: ORCID iD orcid.org/0000-0003-1490-8573
ORCID for Mohammed El-Hajjar: ORCID iD orcid.org/0000-0002-7987-1401
ORCID for Geoff Merrett: ORCID iD orcid.org/0000-0003-4980-3894

Catalogue record

Date deposited: 15 Dec 2021 17:49
Last modified: 17 Mar 2024 03:28

Export record

Contributors

Author: Teodor Ivanescu ORCID iD
Author: Mohammed El-Hajjar ORCID iD
Author: Geoff Merrett ORCID iD
Author: Halil Yetgin

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×