Content downloading-oriented resource allocation joint scheduling in drive-thru networks

Li Chen, Zhi Jun Li, Shou Xu Jiang

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Vehicular content downloading via open WiFi access points (APs) can be challenging due to sparse AP deployment with bounded communication range and the rapid movement of traveling vehicles. For drive-thru networks, resource allocation and scheduling closely interrelate to and interact with each other, collectively affecting the performance of content downloading. However, none of the previous work has tackled this problem as a whole. This paper discusses joint resource allocation and scheduling problem for efficiently content downloading considering channel contention and scarce AP resource utilized effectively. It formalizes optimization selection problem of node set to maximize the total quantity of data downloaded, and proves that it is NP-hard. Further, it presents a solution with a joint resource allocation and scheduling approximate algorithm (JAS). Theoretical analysis and simulation results both verify that the presented implementation achieves higher throughput and delivery ratio than the existing algorithms.

Original languageEnglish (US)
Pages (from-to)2362-2372
Number of pages11
JournalRuan Jian Xue Bao/Journal of Software
Issue number10
StatePublished - Oct 1 2014
Externally publishedYes

Bibliographical note

Publisher Copyright:
© Copyright 2014, Institute of Software. the Chinese Academy of Sciences. All rights reserved.


  • Access points (APs)
  • Content downloading
  • Drive-thru Internet
  • Vehicle-to-vehicle (V2V)
  • Vehicular ad hoc network (VANET)


Dive into the research topics of 'Content downloading-oriented resource allocation joint scheduling in drive-thru networks'. Together they form a unique fingerprint.

Cite this