The University of Southampton
University of Southampton Institutional Repository

Twin-timescale artificial intelligence aided mobility-aware edge caching and computing in vehicular networks

Twin-timescale artificial intelligence aided mobility-aware edge caching and computing in vehicular networks
Twin-timescale artificial intelligence aided mobility-aware edge caching and computing in vehicular networks
In this paper, we propose a joint communication, caching and computing strategy for achieving cost efficiency in vehicular networks. In particular, the resource allocation policy is specifically designed by considering the vehicle’s mobility and the hard service deadline constraint. An artificial intelligence-
based multi-timescale framework is proposed for tackling these challenges. To mitigate the complexity associated with this large action and search space in the sophisticated multi-timescale framework considered, we propose to maximize a carefully constructed mobility-aware reward function using the classic particle swarm optimization scheme at the associated large timescale level, while we employ deep reinforcement learning at the small timescale level of our sophisticated twin-timescale solution. Numerical results are presented to illustrate the theoretical findings and to quantify the performance gains attained.
0018-9545
3086-3099
Tan, Le Thanh
d302db27-3fe5-4291-8aa3-604bc3bed906
Hu, Rose Qingyang
5001b455-00dd-49ca-8efb-74a009a5ba9f
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Tan, Le Thanh
d302db27-3fe5-4291-8aa3-604bc3bed906
Hu, Rose Qingyang
5001b455-00dd-49ca-8efb-74a009a5ba9f
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Tan, Le Thanh, Hu, Rose Qingyang and Hanzo, Lajos (2019) Twin-timescale artificial intelligence aided mobility-aware edge caching and computing in vehicular networks. IEEE Transactions on Vehicular Technology, 68 (4), 3086-3099. (doi:10.1109/TVT.2019.2893898).

Record type: Article

Abstract

In this paper, we propose a joint communication, caching and computing strategy for achieving cost efficiency in vehicular networks. In particular, the resource allocation policy is specifically designed by considering the vehicle’s mobility and the hard service deadline constraint. An artificial intelligence-
based multi-timescale framework is proposed for tackling these challenges. To mitigate the complexity associated with this large action and search space in the sophisticated multi-timescale framework considered, we propose to maximize a carefully constructed mobility-aware reward function using the classic particle swarm optimization scheme at the associated large timescale level, while we employ deep reinforcement learning at the small timescale level of our sophisticated twin-timescale solution. Numerical results are presented to illustrate the theoretical findings and to quantify the performance gains attained.

Text
MTFDRL caching final Jan 14 - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 11 January 2019
e-pub ahead of print date: 18 January 2019
Published date: 4 April 2019

Identifiers

Local EPrints ID: 427638
URI: http://eprints.soton.ac.uk/id/eprint/427638
ISSN: 0018-9545
PURE UUID: 8ea0b0a9-1579-4231-a47c-468f4955332d
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 24 Jan 2019 17:30
Last modified: 18 Mar 2024 02:36

Export record

Altmetrics

Contributors

Author: Le Thanh Tan
Author: Rose Qingyang Hu
Author: Lajos Hanzo ORCID iD

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.

×