Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/223246
Title: Roadside Unit Caching: Auction-Based Storage Allocation for Multiple Content Providers
Authors: Zhiwen Hu;Zijie Zheng;Tao Wang;Lingyang Song;Xiaoming Li
Year: 2017
Publisher: IEEE
Abstract: Recent improvements in vehicular ad hoc networks are accelerating the realization of intelligent transportation system (ITS), which not only provides road safety and driving efficiency, but also enables infotainment services. Since data dissemination plays an important part in ITS, recent studies have found caching as a promising way to promote the efficiency of data dissemination against rapid variation of network topology. In this paper, we focus on the scenario of roadside unit (RSU) caching, where multiple content providers (CPs) aim to improve the data dissemination of their own contents by utilizing the storages of RSUs. To deal with the competition among multiple CPs for limited caching facilities, we propose a multi-object auction-based solution, which is sub-optimal and efficient to be carried out. A caching-specific handoff decision mechanism is also adopted to take advantages of the overlap of RSUs. Simulation results show that our solution leads to a satisfactory outcome.
URI: http://localhost/handle/Hannan/223246
volume: 16
issue: 10
More Information: 6321,
6334
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7973038.pdf2.45 MBAdobe PDF
Title: Roadside Unit Caching: Auction-Based Storage Allocation for Multiple Content Providers
Authors: Zhiwen Hu;Zijie Zheng;Tao Wang;Lingyang Song;Xiaoming Li
Year: 2017
Publisher: IEEE
Abstract: Recent improvements in vehicular ad hoc networks are accelerating the realization of intelligent transportation system (ITS), which not only provides road safety and driving efficiency, but also enables infotainment services. Since data dissemination plays an important part in ITS, recent studies have found caching as a promising way to promote the efficiency of data dissemination against rapid variation of network topology. In this paper, we focus on the scenario of roadside unit (RSU) caching, where multiple content providers (CPs) aim to improve the data dissemination of their own contents by utilizing the storages of RSUs. To deal with the competition among multiple CPs for limited caching facilities, we propose a multi-object auction-based solution, which is sub-optimal and efficient to be carried out. A caching-specific handoff decision mechanism is also adopted to take advantages of the overlap of RSUs. Simulation results show that our solution leads to a satisfactory outcome.
URI: http://localhost/handle/Hannan/223246
volume: 16
issue: 10
More Information: 6321,
6334
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7973038.pdf2.45 MBAdobe PDF
Title: Roadside Unit Caching: Auction-Based Storage Allocation for Multiple Content Providers
Authors: Zhiwen Hu;Zijie Zheng;Tao Wang;Lingyang Song;Xiaoming Li
Year: 2017
Publisher: IEEE
Abstract: Recent improvements in vehicular ad hoc networks are accelerating the realization of intelligent transportation system (ITS), which not only provides road safety and driving efficiency, but also enables infotainment services. Since data dissemination plays an important part in ITS, recent studies have found caching as a promising way to promote the efficiency of data dissemination against rapid variation of network topology. In this paper, we focus on the scenario of roadside unit (RSU) caching, where multiple content providers (CPs) aim to improve the data dissemination of their own contents by utilizing the storages of RSUs. To deal with the competition among multiple CPs for limited caching facilities, we propose a multi-object auction-based solution, which is sub-optimal and efficient to be carried out. A caching-specific handoff decision mechanism is also adopted to take advantages of the overlap of RSUs. Simulation results show that our solution leads to a satisfactory outcome.
URI: http://localhost/handle/Hannan/223246
volume: 16
issue: 10
More Information: 6321,
6334
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7973038.pdf2.45 MBAdobe PDF