Optimal allocation of resource based on probabilistic link in drive-thru networks

Li Chen, Zhijun Li, Shouxu Jiang, Wentao Fang, Shuai Wang

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

To improve AP's capability of communication services, this paper addresses the problem of efficiently downloading content when vehicles go through the limited coverage range of roadside access point(AP) in drive-thru internet. How to allocate channel resource and effectively utilize vehicle-to-vehicle communication is focused on to improve AP's capability of service. An optimization selection problem of k forwarding nodes to maximize the number of completed file download jobs is formalized, and that it is NP-Hard is proved. Based on this, allocation of resource (APL) scheme based on the prediction of link durations of the different pair users, and the APL approximate algorithm based on greedy are proposed. Extensive simulation results show that the APL consistently outperforms competitive allocation schemes under varying workloads.

Original languageEnglish (US)
Pages (from-to)40-44
Number of pages5
JournalHarbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology
Volume45
Issue number5
StatePublished - May 1 2013

Keywords

  • Drive-thru internet
  • Probabilistic link
  • Resource allocation
  • Vehicular ad hoc networks(VANETs)

Fingerprint Dive into the research topics of 'Optimal allocation of resource based on probabilistic link in drive-thru networks'. Together they form a unique fingerprint.

Cite this