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 journalArticle

1 Citation (Scopus)

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

Fingerprint

APL (programming language)
Vehicle to vehicle communications
Roadsides
Internet
Communication

Keywords

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

Cite this

Optimal allocation of resource based on probabilistic link in drive-thru networks. / Chen, Li; Li, Zhijun; Jiang, Shouxu; Fang, Wentao; Wang, Shuai.

In: Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, Vol. 45, No. 5, 01.05.2013, p. 40-44.

Research output: Contribution to journalArticle

Chen, Li ; Li, Zhijun ; Jiang, Shouxu ; Fang, Wentao ; Wang, Shuai. / Optimal allocation of resource based on probabilistic link in drive-thru networks. In: Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology. 2013 ; Vol. 45, No. 5. pp. 40-44.
@article{14a7995e062641e7a551accdaa240c97,
title = "Optimal allocation of resource based on probabilistic link in drive-thru networks",
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.",
keywords = "Drive-thru internet, Probabilistic link, Resource allocation, Vehicular ad hoc networks(VANETs)",
author = "Li Chen and Zhijun Li and Shouxu Jiang and Wentao Fang and Shuai Wang",
year = "2013",
month = "5",
day = "1",
language = "English (US)",
volume = "45",
pages = "40--44",
journal = "Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology",
issn = "0367-6234",
publisher = "Harbin Institute of Technology",
number = "5",

}

TY - JOUR

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

AU - Chen, Li

AU - Li, Zhijun

AU - Jiang, Shouxu

AU - Fang, Wentao

AU - Wang, Shuai

PY - 2013/5/1

Y1 - 2013/5/1

N2 - 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.

AB - 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.

KW - Drive-thru internet

KW - Probabilistic link

KW - Resource allocation

KW - Vehicular ad hoc networks(VANETs)

UR - http://www.scopus.com/inward/record.url?scp=84879536160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879536160&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84879536160

VL - 45

SP - 40

EP - 44

JO - Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology

JF - Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology

SN - 0367-6234

IS - 5

ER -