Content Downloading-Oriented Resource Allocation Joint Scheduling in Drive-Thru Networks
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

陈丽,李治军,姜守旭.车联网中传输调度与资源分配相结合的内容下载.软件学报,2014,25(10):2362-2372

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 15,2012
  • Revised:January 07,2013
  • Adopted:
  • Online: September 30,2014
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063